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-171683762300996.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-030A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683762300996
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07: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 17K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 01:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 12 01:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 00:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 12 00:23 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 82K 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-030A-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717080841209

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-030A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-30 14:54:02] [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 14:54:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 14:54:02] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-05-30 14:54:02] [INFO ] Transformed 243 places.
[2024-05-30 14:54:02] [INFO ] Transformed 243 transitions.
[2024-05-30 14:54:02] [INFO ] Found NUPN structural information;
[2024-05-30 14:54:02] [INFO ] Parsed PT model containing 243 places and 243 transitions and 1026 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-030A-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030A-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030A-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 30 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2024-05-30 14:54:02] [INFO ] Computed 121 invariants in 18 ms
[2024-05-30 14:54:03] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-30 14:54:03] [INFO ] Invariant cache hit.
[2024-05-30 14:54:03] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-30 14:54:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 8120 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 10040 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 18274ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 18296ms
Finished structural reductions in LTL mode , in 1 iterations and 18975 ms. Remains : 243/243 places, 242/242 transitions.
Support contains 58 out of 243 places after structural reductions.
[2024-05-30 14:54:21] [INFO ] Flatten gal took : 52 ms
[2024-05-30 14:54:21] [INFO ] Flatten gal took : 37 ms
[2024-05-30 14:54:21] [INFO ] Input system was already deterministic with 242 transitions.
Reduction of identical properties reduced properties to check from 30 to 28
RANDOM walk for 40000 steps (8 resets) in 2572 ms. (15 steps per ms) remains 15/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 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 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
[2024-05-30 14:54:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 22/49 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 22/73 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 194/243 variables, 97/170 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 194/364 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 15 unsolved in 665 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 22/49 variables, 24/51 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 22/73 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 194/243 variables, 97/170 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 194/364 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 15/622 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 0/485 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 622 constraints, problems are : Problem set: 0 solved, 15 unsolved in 788 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 1462ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 11 different solutions.
Parikh walk visited 14 properties in 1547 ms.
Support contains 2 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 242/242 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 242 transition count 241
Partial Free-agglomeration rule applied 30 times.
Drop transitions (Partial Free agglomeration) removed 30 transitions
Iterating global reduction 0 with 30 rules applied. Total rules applied 32 place count 242 transition count 241
Drop transitions (Redundant composition of simpler transitions.) removed 30 transitions
Redundant transition composition rules discarded 30 transitions
Iterating global reduction 0 with 30 rules applied. Total rules applied 62 place count 242 transition count 211
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 63 place count 241 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 64 place count 240 transition count 210
Applied a total of 64 rules in 76 ms. Remains 240 /243 variables (removed 3) and now considering 210/242 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 240/243 places, 210/242 transitions.
RANDOM walk for 31535 steps (6 resets) in 304 ms. (103 steps per ms) remains 0/1 properties
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 7 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-30 14:54:26] [INFO ] Invariant cache hit.
[2024-05-30 14:54:26] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-30 14:54:26] [INFO ] Invariant cache hit.
[2024-05-30 14:54:26] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-30 14:54:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 8002 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 9800 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 17845ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 17848ms
Finished structural reductions in LTL mode , in 1 iterations and 18165 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-00
Entered a terminal (fully accepting) state of product in 256 steps with 0 reset in 6 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-00 finished in 18425 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))||((X(p3)||p2)&&p1))))'
Support contains 9 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 5 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-30 14:54:44] [INFO ] Invariant cache hit.
[2024-05-30 14:54:45] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-30 14:54:45] [INFO ] Invariant cache hit.
[2024-05-30 14:54:45] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-30 14:54:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 7839 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 9915 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 17796ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 17800ms
Finished structural reductions in LTL mode , in 1 iterations and 18155 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 283 ms :[true, (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 749 ms.
Product exploration explored 100000 steps with 50000 reset in 621 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p2 p0 p3), (X p1), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (X p3)), (X (X (NOT (AND p0 (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 22 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-030A-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-030A-LTLFireability-01 finished in 19866 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&&F(p1)))||(G(p0)&&p2)))&&X(p3))))'
Support contains 6 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 6 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-30 14:55:04] [INFO ] Invariant cache hit.
[2024-05-30 14:55:04] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-30 14:55:04] [INFO ] Invariant cache hit.
[2024-05-30 14:55:05] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-30 14:55:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 7758 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 9636 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 17437ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 17439ms
Finished structural reductions in LTL mode , in 1 iterations and 17729 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 336 ms :[(OR (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p3), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-02 finished in 18095 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((!p0&&X(G(p1)))) U G(p1)))'
Support contains 5 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 8 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-30 14:55:22] [INFO ] Invariant cache hit.
[2024-05-30 14:55:22] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-30 14:55:22] [INFO ] Invariant cache hit.
[2024-05-30 14:55:23] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-30 14:55:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 7964 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 10001 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 18003ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 18005ms
Finished structural reductions in LTL mode , in 1 iterations and 18332 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p1), (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-03 finished in 18472 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-30 14:55:41] [INFO ] Invariant cache hit.
[2024-05-30 14:55:41] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-30 14:55:41] [INFO ] Invariant cache hit.
[2024-05-30 14:55:41] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-30 14:55:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 7889 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 9661 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 17589ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 17592ms
Finished structural reductions in LTL mode , in 1 iterations and 17868 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-04
Product exploration explored 100000 steps with 18 reset in 319 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-030A-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-04 finished in 18359 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&&(p1 U X(p2))))))'
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-30 14:55:59] [INFO ] Invariant cache hit.
[2024-05-30 14:55:59] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-30 14:55:59] [INFO ] Invariant cache hit.
[2024-05-30 14:55:59] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-30 14:55:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 7857 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 9671 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 17563ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 17565ms
Finished structural reductions in LTL mode , in 1 iterations and 17857 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 328 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-030A-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-06 finished in 18335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)||F(p1)))))'
Support contains 7 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 5 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-30 14:56:18] [INFO ] Invariant cache hit.
[2024-05-30 14:56:18] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-30 14:56:18] [INFO ] Invariant cache hit.
[2024-05-30 14:56:18] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-30 14:56:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 7917 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 9943 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 17895ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 17897ms
Finished structural reductions in LTL mode , in 1 iterations and 18233 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-07
Product exploration explored 100000 steps with 33333 reset in 456 ms.
Product exploration explored 100000 steps with 33333 reset in 503 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 13 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-030A-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-030A-LTLFireability-07 finished in 19416 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 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-30 14:56:37] [INFO ] Invariant cache hit.
[2024-05-30 14:56:37] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-30 14:56:37] [INFO ] Invariant cache hit.
[2024-05-30 14:56:37] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-30 14:56:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 7942 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 9849 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 17826ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 17829ms
Finished structural reductions in LTL mode , in 1 iterations and 18128 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-08
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-08 finished in 18274 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||G(F(p1))))))'
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 12 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-30 14:56:55] [INFO ] Invariant cache hit.
[2024-05-30 14:56:55] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-30 14:56:55] [INFO ] Invariant cache hit.
[2024-05-30 14:56:55] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2024-05-30 14:56:55] [INFO ] Redundant transitions in 8 ms returned []
Running 241 sub problems to find dead transitions.
[2024-05-30 14:56:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 8114 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 9637 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 17786ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 17788ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 18087 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-10
Product exploration explored 100000 steps with 2202 reset in 356 ms.
Stack based approach found an accepted trace after 3620 steps with 82 reset with depth 18 and stack size 18 in 18 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-10 finished in 18558 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 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 242/242 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 242 transition count 241
Applied a total of 2 rules in 13 ms. Remains 242 /243 variables (removed 1) and now considering 241/242 (removed 1) transitions.
// Phase 1: matrix 241 rows 242 cols
[2024-05-30 14:57:14] [INFO ] Computed 121 invariants in 2 ms
[2024-05-30 14:57:14] [INFO ] Implicit Places using invariants in 110 ms returned [235]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 114 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 241/243 places, 241/242 transitions.
Applied a total of 0 rules in 8 ms. Remains 241 /241 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 136 ms. Remains : 241/243 places, 241/242 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 309 ms.
Stack based approach found an accepted trace after 88 steps with 0 reset with depth 89 and stack size 89 in 0 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-11 finished in 519 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 242/242 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 242 transition count 241
Applied a total of 2 rules in 17 ms. Remains 242 /243 variables (removed 1) and now considering 241/242 (removed 1) transitions.
[2024-05-30 14:57:14] [INFO ] Invariant cache hit.
[2024-05-30 14:57:14] [INFO ] Implicit Places using invariants in 120 ms returned [235]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 132 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 241/243 places, 241/242 transitions.
Applied a total of 0 rules in 7 ms. Remains 241 /241 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 156 ms. Remains : 241/243 places, 241/242 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 315 ms.
Stack based approach found an accepted trace after 20977 steps with 0 reset with depth 20978 and stack size 4973 in 80 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-12 finished in 590 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 (!p1&&X((!p1 U (G(!p1)||(X(p0)&&p2)))))))'
Support contains 8 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2024-05-30 14:57:15] [INFO ] Computed 121 invariants in 1 ms
[2024-05-30 14:57:15] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-30 14:57:15] [INFO ] Invariant cache hit.
[2024-05-30 14:57:15] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-30 14:57:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 7752 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 9761 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 17547ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 17549ms
Finished structural reductions in LTL mode , in 1 iterations and 17820 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 256 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-14
Product exploration explored 100000 steps with 25054 reset in 466 ms.
Product exploration explored 100000 steps with 24961 reset in 494 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) (NOT p0) (NOT p2)), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 185 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 437 ms. (91 steps per ms) remains 1/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 190 ms. (209 steps per ms) remains 1/1 properties
[2024-05-30 14:57:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 9/17 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 226/243 variables, 113/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 226/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 1 unsolved in 117 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 9/17 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 226/243 variables, 113/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 226/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/485 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 608 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 298ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 12029 steps, including 600 resets, run visited all 1 properties in 61 ms. (steps per millisecond=197 )
Parikh walk visited 1 properties in 71 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F p1), (F p0)]
Knowledge based reduction with 22 factoid took 462 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 224 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Support contains 8 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 1 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-30 14:57:36] [INFO ] Invariant cache hit.
[2024-05-30 14:57:36] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-30 14:57:36] [INFO ] Invariant cache hit.
[2024-05-30 14:57:36] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-30 14:57:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 7849 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 9815 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 17698ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 17701ms
Finished structural reductions in LTL mode , in 1 iterations and 17970 ms. Remains : 243/243 places, 242/242 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 p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 109 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 403 ms. (99 steps per ms) remains 1/12 properties
BEST_FIRST walk for 40002 steps (8 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
[2024-05-30 14:57:55] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 9/17 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 226/243 variables, 113/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 226/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 1 unsolved in 134 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 9/17 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 226/243 variables, 113/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 226/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 1/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/485 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 608 constraints, problems are : Problem set: 0 solved, 1 unsolved in 186 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 324ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 13455 steps, including 662 resets, run visited all 1 properties in 58 ms. (steps per millisecond=231 )
Parikh walk visited 1 properties in 58 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p1 p2 (NOT p0)))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (OR (NOT p1) p2 p0))), (F (NOT (OR p1 (NOT p2) p0))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F p1), (F p0)]
Knowledge based reduction with 22 factoid took 477 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 282 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 247 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Product exploration explored 100000 steps with 25142 reset in 468 ms.
Product exploration explored 100000 steps with 25001 reset in 503 ms.
Applying partial POR strategy [false, true, false, true, true, false, true]
Stuttering acceptance computed with spot in 245 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Support contains 8 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 243 transition count 242
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 23 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-30 14:57:58] [INFO ] Redundant transitions in 8 ms returned []
Running 241 sub problems to find dead transitions.
// Phase 1: matrix 242 rows 243 cols
[2024-05-30 14:57:58] [INFO ] Computed 121 invariants in 1 ms
[2024-05-30 14:57:58] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-30 14:58:01] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 6 ms to minimize.
Problem TDEAD120 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 1/365 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/365 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 6 (OVERLAPS) 242/485 variables, 243/608 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 2/610 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 0/610 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 9 (OVERLAPS) 0/485 variables, 0/610 constraints. Problems are: Problem set: 1 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 610 constraints, problems are : Problem set: 1 solved, 240 unsolved in 21579 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 241/241 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/241 variables, 0/241 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 2 (OVERLAPS) 2/243 variables, 121/362 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 2/364 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 1/365 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/365 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 6 (OVERLAPS) 242/485 variables, 243/608 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 2/610 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 240/850 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 0/850 constraints. Problems are: Problem set: 1 solved, 240 unsolved
At refinement iteration 10 (OVERLAPS) 0/485 variables, 0/850 constraints. Problems are: Problem set: 1 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 850 constraints, problems are : Problem set: 1 solved, 240 unsolved in 10314 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 240/241 constraints, Known Traps: 1/1 constraints]
After SMT, in 31939ms problems are : Problem set: 1 solved, 240 unsolved
Search for dead transitions found 1 dead transitions in 31943ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 243/243 places, 241/242 transitions.
Graph (complete) has 960 edges and 243 vertex of which 242 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 242 /243 variables (removed 1) and now considering 241/241 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 242/243 places, 241/242 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31995 ms. Remains : 242/243 places, 241/242 transitions.
Built C files in :
/tmp/ltsmin11395329130522419829
[2024-05-30 14:58:30] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11395329130522419829
Running compilation step : cd /tmp/ltsmin11395329130522419829;'/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 564 ms.
Running link step : cd /tmp/ltsmin11395329130522419829;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 135 ms.
Running LTSmin : cd /tmp/ltsmin11395329130522419829;'/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/stateBased5453189730437857368.hoa' '--buchi-type=spotba'
LTSmin run took 584 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-030A-LTLFireability-14 finished in 76071 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&X((X(G(p2))&&p1))) U X(X(p3)))))'
Support contains 7 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2024-05-30 14:58:31] [INFO ] Computed 121 invariants in 3 ms
[2024-05-30 14:58:31] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-30 14:58:31] [INFO ] Invariant cache hit.
[2024-05-30 14:58:31] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-30 14:58:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 0/485 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 485/485 variables, and 607 constraints, problems are : Problem set: 0 solved, 241 unsolved in 7881 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 242/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (OVERLAPS) 1/243 variables, 121/363 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/485 variables, 243/607 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 241/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 0/485 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 485/485 variables, and 848 constraints, problems are : Problem set: 0 solved, 241 unsolved in 9682 ms.
Refiners :[Domain max(s): 243/243 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 17602ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 17605ms
Finished structural reductions in LTL mode , in 1 iterations and 17907 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 421 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), true, (NOT p3), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-15
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-15 finished in 18350 ms.
All properties solved by simple procedures.
Total runtime 287443 ms.

BK_STOP 1717081129821

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-030A"
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-030A, 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-171683762300996"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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