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.r355-tall-171683760001012.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 greatspnxred
Input is ShieldRVt-PT-040A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683760001012
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 23:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 11 23:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 11 22:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 11 22:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 109K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717083095028

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-040A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 15:31:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 15:31:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 15:31:36] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-05-30 15:31:36] [INFO ] Transformed 323 places.
[2024-05-30 15:31:36] [INFO ] Transformed 323 transitions.
[2024-05-30 15:31:36] [INFO ] Found NUPN structural information;
[2024-05-30 15:31:36] [INFO ] Parsed PT model containing 323 places and 323 transitions and 1366 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-040A-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 46 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2024-05-30 15:31:36] [INFO ] Computed 161 invariants in 16 ms
[2024-05-30 15:31:37] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-05-30 15:31:37] [INFO ] Invariant cache hit.
[2024-05-30 15:31:37] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-05-30 15:31:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 321 unsolved in 15472 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 321/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 1128 constraints, problems are : Problem set: 0 solved, 321 unsolved in 17078 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 32697ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 32714ms
Finished structural reductions in LTL mode , in 1 iterations and 33445 ms. Remains : 323/323 places, 322/322 transitions.
Support contains 40 out of 323 places after structural reductions.
[2024-05-30 15:32:10] [INFO ] Flatten gal took : 88 ms
[2024-05-30 15:32:10] [INFO ] Flatten gal took : 36 ms
[2024-05-30 15:32:10] [INFO ] Input system was already deterministic with 322 transitions.
Reduction of identical properties reduced properties to check from 25 to 21
RANDOM walk for 40000 steps (8 resets) in 2395 ms. (16 steps per ms) remains 15/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 73 ms. (54 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 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 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
[2024-05-30 15:32:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 29/63 variables, 31/65 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 29/94 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 260/323 variables, 130/224 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 260/484 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 15 unsolved in 553 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 29/63 variables, 31/65 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 29/94 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 260/323 variables, 130/224 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 260/484 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 15/822 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/645 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 11 (OVERLAPS) 0/645 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 822 constraints, problems are : Problem set: 0 solved, 15 unsolved in 1012 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 1582ms problems are : Problem set: 0 solved, 15 unsolved
Fused 15 Parikh solutions to 11 different solutions.
Finished Parikh walk after 34369 steps, including 955 resets, run visited all 1 properties in 165 ms. (steps per millisecond=208 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 15 properties in 1573 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0) U (X(G(p0))||(!p1&&X((p0&&(p1 U p2))))))))'
Support contains 7 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 11 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2024-05-30 15:32:15] [INFO ] Invariant cache hit.
[2024-05-30 15:32:15] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-30 15:32:15] [INFO ] Invariant cache hit.
[2024-05-30 15:32:15] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-05-30 15:32:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 321 unsolved in 14408 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 321/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 1128 constraints, problems are : Problem set: 0 solved, 321 unsolved in 16731 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 31215ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 31224ms
Finished structural reductions in LTL mode , in 1 iterations and 31640 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 356 ms :[true, (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-00
Entered a terminal (fully accepting) state of product in 22192 steps with 0 reset in 164 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-00 finished in 32241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 322 transition count 321
Applied a total of 2 rules in 45 ms. Remains 322 /323 variables (removed 1) and now considering 321/322 (removed 1) transitions.
// Phase 1: matrix 321 rows 322 cols
[2024-05-30 15:32:47] [INFO ] Computed 161 invariants in 5 ms
[2024-05-30 15:32:47] [INFO ] Implicit Places using invariants in 163 ms returned [315]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 165 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 321/323 places, 321/322 transitions.
Applied a total of 0 rules in 15 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 226 ms. Remains : 321/323 places, 321/322 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 440 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-01 finished in 769 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U G((X(p1)||G(p2))))))'
Support contains 7 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 8 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2024-05-30 15:32:48] [INFO ] Computed 161 invariants in 2 ms
[2024-05-30 15:32:48] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-30 15:32:48] [INFO ] Invariant cache hit.
[2024-05-30 15:32:48] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-05-30 15:32:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 321 unsolved in 14277 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 321/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 1128 constraints, problems are : Problem set: 0 solved, 321 unsolved in 17114 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 31448ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 31451ms
Finished structural reductions in LTL mode , in 1 iterations and 31868 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 397 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p0), (AND (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-02
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-02 finished in 32296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(G(p1)||G(p2))))'
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 4 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2024-05-30 15:33:20] [INFO ] Invariant cache hit.
[2024-05-30 15:33:20] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-30 15:33:20] [INFO ] Invariant cache hit.
[2024-05-30 15:33:20] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-05-30 15:33:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 321 unsolved in 14790 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 321/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 1128 constraints, problems are : Problem set: 0 solved, 321 unsolved in 17683 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 32530ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 32534ms
Finished structural reductions in LTL mode , in 1 iterations and 32938 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-03 finished in 33137 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 4 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2024-05-30 15:33:53] [INFO ] Invariant cache hit.
[2024-05-30 15:33:53] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-30 15:33:53] [INFO ] Invariant cache hit.
[2024-05-30 15:33:53] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-05-30 15:33:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 321 unsolved in 15178 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 321/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 1128 constraints, problems are : Problem set: 0 solved, 321 unsolved in 17686 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 32915ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 32921ms
Finished structural reductions in LTL mode , in 1 iterations and 33338 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 419 ms.
Product exploration explored 100000 steps with 0 reset in 501 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 35787 steps (7 resets) in 350 ms. (101 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 7 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2024-05-30 15:34:28] [INFO ] Invariant cache hit.
[2024-05-30 15:34:28] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-30 15:34:28] [INFO ] Invariant cache hit.
[2024-05-30 15:34:28] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-05-30 15:34:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 321 unsolved in 14887 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 321/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 1128 constraints, problems are : Problem set: 0 solved, 321 unsolved in 17694 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 32638ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 32641ms
Finished structural reductions in LTL mode , in 1 iterations and 33055 ms. Remains : 323/323 places, 322/322 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 273 ms. (145 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 221 ms. (180 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1223 steps, run visited all 1 properties in 18 ms. (steps per millisecond=67 )
Probabilistic random walk after 1223 steps, saw 1152 distinct states, run finished after 22 ms. (steps per millisecond=55 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Entered a terminal (fully accepting) state of product in 61549 steps with 0 reset in 254 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-04 finished in 69281 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 5 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 322 transition count 321
Applied a total of 2 rules in 16 ms. Remains 322 /323 variables (removed 1) and now considering 321/322 (removed 1) transitions.
// Phase 1: matrix 321 rows 322 cols
[2024-05-30 15:35:02] [INFO ] Computed 161 invariants in 3 ms
[2024-05-30 15:35:02] [INFO ] Implicit Places using invariants in 141 ms returned [315]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 142 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 321/323 places, 321/322 transitions.
Applied a total of 0 rules in 12 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 171 ms. Remains : 321/323 places, 321/322 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 429 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-06 finished in 652 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X((p0&&(p1||X(p2))))&&(!p3 U (p4||G(!p3)))))))'
Support contains 6 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 5 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2024-05-30 15:35:03] [INFO ] Computed 161 invariants in 1 ms
[2024-05-30 15:35:03] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-30 15:35:03] [INFO ] Invariant cache hit.
[2024-05-30 15:35:03] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-05-30 15:35:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 321 unsolved in 15139 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 321/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 1128 constraints, problems are : Problem set: 0 solved, 321 unsolved in 17373 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 32587ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 32590ms
Finished structural reductions in LTL mode , in 1 iterations and 32984 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 403 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p3 (NOT p4)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND p0 (NOT p2) p3 (NOT p4)), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-07
Product exploration explored 100000 steps with 33303 reset in 818 ms.
Product exploration explored 100000 steps with 33232 reset in 830 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p4 (NOT p3) p0 p1 p2), (X (NOT p3)), (X (NOT (AND (NOT p4) p3 p0 (NOT p1)))), (X p4), (X (NOT (OR (AND p4 p0 (NOT p1)) (AND (NOT p3) p0 (NOT p1))))), (X (NOT (AND (NOT p4) p3))), (X (NOT (OR (AND p4 (NOT p0)) (AND (NOT p3) (NOT p0))))), (X (NOT (AND (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p4) p3 (NOT p0)))), (X (OR p4 (NOT p3))), (X (NOT (AND (NOT p4) (NOT p3) p0 (NOT p1)))), (X (NOT (AND (NOT p4) (NOT p3) (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p4) p3 p0 (NOT p1))))), (X (X p4)), (X (X (NOT (AND (NOT p4) (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND p4 p0 (NOT p1) (NOT p2)) (AND (NOT p3) p0 (NOT p1) (NOT p2)))))), (X (X (NOT (OR (AND p4 (NOT p0)) (AND (NOT p3) (NOT p0)))))), (X (X (NOT (AND (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p4) (NOT p3) p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND p4 (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p4) p3 p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p4 p0 (NOT p1)) (AND (NOT p3) p0 (NOT p1)))))), (X (X (NOT (AND (NOT p4) p3 p0 (NOT p2))))), (X (X (NOT (AND (NOT p4) p3)))), (X (X (NOT (AND (NOT p4) p3 (NOT p0))))), (X (X (NOT (OR (AND p4 (NOT p2)) (AND (NOT p3) (NOT p2)))))), (X (X (NOT (AND (NOT p4) (NOT p3) (NOT p2))))), (X (X (OR p4 (NOT p3)))), (X (X (NOT (AND (NOT p4) (NOT p3) p0 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p4) p3 (NOT p0) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 39 factoid took 204 ms. Reduced automaton from 7 states, 25 edges and 5 AP (stutter sensitive) to 7 states, 25 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 342 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p3 (NOT p4)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND p0 (NOT p2) p3 (NOT p4)), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 25 to 23
RANDOM walk for 40000 steps (8 resets) in 650 ms. (61 steps per ms) remains 18/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 18/18 properties
[2024-05-30 15:35:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 7/13 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 310/323 variables, 155/174 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 310/484 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 18 unsolved in 636 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
Problem apf6 is UNSAT
Problem apf9 is UNSAT
Problem apf12 is UNSAT
Problem apf14 is UNSAT
Problem apf17 is UNSAT
Problem apf18 is UNSAT
Problem apf23 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 7 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 7 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 7/13 variables, 6/12 constraints. Problems are: Problem set: 7 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 7/19 constraints. Problems are: Problem set: 7 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/19 constraints. Problems are: Problem set: 7 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 310/323 variables, 155/174 constraints. Problems are: Problem set: 7 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 310/484 constraints. Problems are: Problem set: 7 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 7 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 7 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 11/818 constraints. Problems are: Problem set: 7 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/645 variables, 0/818 constraints. Problems are: Problem set: 7 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/645 variables, 0/818 constraints. Problems are: Problem set: 7 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 818 constraints, problems are : Problem set: 7 solved, 11 unsolved in 805 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 11/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 1473ms problems are : Problem set: 7 solved, 11 unsolved
Fused 11 Parikh solutions to 8 different solutions.
Parikh walk visited 3 properties in 7107 ms.
Support contains 6 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 322/322 transitions.
Partial Free-agglomeration rule applied 38 times.
Drop transitions (Partial Free agglomeration) removed 38 transitions
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 323 transition count 322
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 323 transition count 284
Applied a total of 76 rules in 25 ms. Remains 323 /323 variables (removed 0) and now considering 284/322 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 323/323 places, 284/322 transitions.
Reduction of identical properties reduced properties to check from 8 to 5
RANDOM walk for 40000 steps (8 resets) in 235 ms. (169 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 122 ms. (325 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 125 ms. (317 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 3772 steps, run visited all 5 properties in 64 ms. (steps per millisecond=58 )
Probabilistic random walk after 3772 steps, saw 3669 distinct states, run finished after 64 ms. (steps per millisecond=58 ) properties seen :5
Found 7 invariant AP formulas.
Knowledge obtained : [(AND p4 (NOT p3) p0 p1 p2), (X (NOT p3)), (X (NOT (AND (NOT p4) p3 p0 (NOT p1)))), (X p4), (X (NOT (OR (AND p4 p0 (NOT p1)) (AND (NOT p3) p0 (NOT p1))))), (X (NOT (AND (NOT p4) p3))), (X (NOT (OR (AND p4 (NOT p0)) (AND (NOT p3) (NOT p0))))), (X (NOT (AND (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p4) p3 (NOT p0)))), (X (OR p4 (NOT p3))), (X (NOT (AND (NOT p4) (NOT p3) p0 (NOT p1)))), (X (NOT (AND (NOT p4) (NOT p3) (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT p3))), (X (X (NOT (AND (NOT p4) p3 p0 (NOT p1))))), (X (X p4)), (X (X (NOT (AND (NOT p4) (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND p4 p0 (NOT p1) (NOT p2)) (AND (NOT p3) p0 (NOT p1) (NOT p2)))))), (X (X (NOT (OR (AND p4 (NOT p0)) (AND (NOT p3) (NOT p0)))))), (X (X (NOT (AND (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p4) (NOT p3) p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND p4 (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p4) p3 p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p4 p0 (NOT p1)) (AND (NOT p3) p0 (NOT p1)))))), (X (X (NOT (AND (NOT p4) p3 p0 (NOT p2))))), (X (X (NOT (AND (NOT p4) p3)))), (X (X (NOT (AND (NOT p4) p3 (NOT p0))))), (X (X (NOT (OR (AND p4 (NOT p2)) (AND (NOT p3) (NOT p2)))))), (X (X (NOT (AND (NOT p4) (NOT p3) (NOT p2))))), (X (X (OR p4 (NOT p3)))), (X (X (NOT (AND (NOT p4) (NOT p3) p0 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p4) p3 (NOT p0) (NOT p2))))), (X (X p1)), (G (AND (OR p3 p2) (OR (NOT p4) p2))), (G (OR p3 p4 (NOT p0) p2)), (G (OR p3 p4 (NOT p0) p1 p2)), (G (AND (OR p3 (NOT p0) p1 p2) (OR (NOT p4) (NOT p0) p1 p2))), (G (OR p3 p4 p2)), (G (OR p3 p4 p0 p2)), (G (AND (OR p3 p0 p2) (OR (NOT p4) p0 p2)))]
False Knowledge obtained : [(F (NOT (OR p3 p4 (NOT p0) p1))), (F (NOT (OR (NOT p3) p4))), (F (NOT p1)), (F (NOT (OR (NOT p3) p4 p0))), (F (NOT p2)), (F (NOT p4)), (F p3), (F (NOT p0)), (F (NOT (OR (NOT p3) p4 (NOT p0) p1 p2))), (F (NOT (OR p3 p4 p0))), (F (NOT (OR (NOT p3) p4 (NOT p0) p2))), (F (NOT (OR (NOT p3) p4))), (F (NOT (OR (NOT p3) p4 p2))), (F (NOT (AND (OR p3 p0) (OR (NOT p4) p0)))), (F (NOT (OR p3 p4))), (F (NOT (OR (NOT p3) p4 (NOT p0) p1))), (F (NOT (OR (NOT p3) p4 p0 p2))), (F (NOT (AND (OR p3 (NOT p0) p1) (OR (NOT p4) (NOT p0) p1))))]
Knowledge based reduction with 46 factoid took 1396 ms. Reduced automaton from 7 states, 25 edges and 5 AP (stutter sensitive) to 7 states, 18 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 370 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p3 (NOT p4)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p2) p3 (NOT p4)) (AND p0 (NOT p1) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 371 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p3 (NOT p4)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p2) p3 (NOT p4)) (AND p0 (NOT p1) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 6 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2024-05-30 15:35:50] [INFO ] Invariant cache hit.
[2024-05-30 15:35:50] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-30 15:35:50] [INFO ] Invariant cache hit.
[2024-05-30 15:35:50] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-05-30 15:35:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 321 unsolved in 15023 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 321/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 1128 constraints, problems are : Problem set: 0 solved, 321 unsolved in 16810 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 31898ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 31901ms
Finished structural reductions in LTL mode , in 1 iterations and 32286 ms. Remains : 323/323 places, 322/322 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p3) p4 p0 p1 p2), (X (NOT p3)), (X p4), (X (OR (NOT p3) p4)), (X (NOT (AND (NOT p3) (NOT p4) p0 (NOT p1)))), (X (NOT (AND p3 (NOT p4) (NOT p0)))), (X (NOT (OR (AND (NOT p3) (NOT p0)) (AND p4 (NOT p0))))), (X (NOT (AND p3 (NOT p4)))), (X (NOT (AND p3 (NOT p4) p0 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p3) (NOT p4) (NOT p0)))), (X (NOT (OR (AND (NOT p3) p0 (NOT p1)) (AND p4 p0 (NOT p1))))), (X p0), (X p1), (X (X p2)), (X (X (NOT p3))), (X (X p4)), (X (X (OR (NOT p3) p4))), (X (X (NOT (AND (NOT p3) (NOT p4) p0 (NOT p1))))), (X (X (NOT (AND p3 (NOT p4) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0)) (AND p4 (NOT p0)))))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (NOT (AND p3 (NOT p4) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p4) (NOT p0))))), (X (X (NOT (OR (AND (NOT p3) p0 (NOT p1)) (AND p4 p0 (NOT p1)))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 506 ms. Reduced automaton from 7 states, 18 edges and 5 AP (stutter sensitive) to 7 states, 18 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 354 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p3 (NOT p4)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p2) p3 (NOT p4)) (AND p0 (NOT p1) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 17 to 15
RANDOM walk for 40000 steps (8 resets) in 348 ms. (114 steps per ms) remains 8/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 132 ms. (300 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 131 ms. (303 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 127 ms. (312 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 8/8 properties
[2024-05-30 15:36:24] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 7/13 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 310/323 variables, 155/174 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 310/484 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 8 unsolved in 367 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 7/13 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 310/323 variables, 155/174 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 310/484 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 8/815 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/645 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/645 variables, 0/815 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 815 constraints, problems are : Problem set: 0 solved, 8 unsolved in 671 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 1044ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 2623 ms.
Support contains 6 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 322/322 transitions.
Partial Free-agglomeration rule applied 38 times.
Drop transitions (Partial Free agglomeration) removed 38 transitions
Iterating global reduction 0 with 38 rules applied. Total rules applied 38 place count 323 transition count 322
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 323 transition count 284
Applied a total of 76 rules in 23 ms. Remains 323 /323 variables (removed 0) and now considering 284/322 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 323/323 places, 284/322 transitions.
RANDOM walk for 40000 steps (8 resets) in 289 ms. (137 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (8 resets) in 129 ms. (307 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 117 ms. (339 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 7/7 properties
Finished probabilistic random walk after 3772 steps, run visited all 7 properties in 68 ms. (steps per millisecond=55 )
Probabilistic random walk after 3772 steps, saw 3669 distinct states, run finished after 68 ms. (steps per millisecond=55 ) properties seen :7
Knowledge obtained : [(AND (NOT p3) p4 p0 p1 p2), (X (NOT p3)), (X p4), (X (OR (NOT p3) p4)), (X (NOT (AND (NOT p3) (NOT p4) p0 (NOT p1)))), (X (NOT (AND p3 (NOT p4) (NOT p0)))), (X (NOT (OR (AND (NOT p3) (NOT p0)) (AND p4 (NOT p0))))), (X (NOT (AND p3 (NOT p4)))), (X (NOT (AND p3 (NOT p4) p0 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p4)))), (X (NOT (AND (NOT p3) (NOT p4) (NOT p0)))), (X (NOT (OR (AND (NOT p3) p0 (NOT p1)) (AND p4 p0 (NOT p1))))), (X p0), (X p1), (X (X p2)), (X (X (NOT p3))), (X (X p4)), (X (X (OR (NOT p3) p4))), (X (X (NOT (AND (NOT p3) (NOT p4) p0 (NOT p1))))), (X (X (NOT (AND p3 (NOT p4) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p3) (NOT p0)) (AND p4 (NOT p0)))))), (X (X (NOT (AND p3 (NOT p4))))), (X (X (NOT (AND p3 (NOT p4) p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p4))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p3) (NOT p4) (NOT p0))))), (X (X (NOT (OR (AND (NOT p3) p0 (NOT p1)) (AND p4 p0 (NOT p1)))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (OR p3 p0) (OR (NOT p4) p0)))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR (NOT p3) p4))), (F (NOT p0)), (F (NOT (OR p3 p4 (NOT p0) p1))), (F (NOT (AND (OR p3 (NOT p0) p1) (OR (NOT p4) (NOT p0) p1)))), (F (NOT (OR (NOT p3) p4))), (F (NOT (OR p3 p4 p0))), (F (NOT (OR (NOT p3) p4 p0))), (F (NOT (OR p3 p4))), (F (NOT (OR (NOT p0) p2))), (F (NOT p2)), (F (NOT p4)), (F (NOT p1)), (F p3), (F (NOT (OR (NOT p3) p4 (NOT p0) p1))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 31 factoid took 1372 ms. Reduced automaton from 7 states, 18 edges and 5 AP (stutter sensitive) to 7 states, 18 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p3 (NOT p4)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p2) p3 (NOT p4)) (AND p0 (NOT p1) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 406 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p3 (NOT p4)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p2) p3 (NOT p4)) (AND p0 (NOT p1) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p3 (NOT p4)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND p0 (NOT p2) p3 (NOT p4)) (AND p0 (NOT p1) (NOT p2))), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 33155 reset in 722 ms.
Product exploration explored 100000 steps with 33273 reset in 772 ms.
Support contains 6 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 7 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2024-05-30 15:36:32] [INFO ] Invariant cache hit.
[2024-05-30 15:36:32] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-30 15:36:32] [INFO ] Invariant cache hit.
[2024-05-30 15:36:33] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-05-30 15:36:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/645 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 645/645 variables, and 807 constraints, problems are : Problem set: 0 solved, 321 unsolved in 14386 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/323 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (OVERLAPS) 322/645 variables, 323/807 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 321/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 8 (OVERLAPS) 0/645 variables, 0/1128 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 645/645 variables, and 1128 constraints, problems are : Problem set: 0 solved, 321 unsolved in 16904 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 31342ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 31345ms
Finished structural reductions in LTL mode , in 1 iterations and 31765 ms. Remains : 323/323 places, 322/322 transitions.
Treatment of property ShieldRVt-PT-040A-LTLFireability-07 finished in 121287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p0&&F(!p1))))))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 322 transition count 321
Applied a total of 2 rules in 12 ms. Remains 322 /323 variables (removed 1) and now considering 321/322 (removed 1) transitions.
// Phase 1: matrix 321 rows 322 cols
[2024-05-30 15:37:04] [INFO ] Computed 161 invariants in 1 ms
[2024-05-30 15:37:04] [INFO ] Implicit Places using invariants in 162 ms returned [315]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 165 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 321/323 places, 321/322 transitions.
Applied a total of 0 rules in 8 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 185 ms. Remains : 321/323 places, 321/322 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (AND p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 425 ms.
Product exploration explored 100000 steps with 0 reset in 508 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 101 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 298 ms. (133 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 25974 steps, run visited all 4 properties in 144 ms. (steps per millisecond=180 )
Probabilistic random walk after 25974 steps, saw 25091 distinct states, run finished after 145 ms. (steps per millisecond=179 ) properties seen :4
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 244 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0)]
Support contains 3 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 321/321 transitions.
Applied a total of 0 rules in 14 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
// Phase 1: matrix 321 rows 321 cols
[2024-05-30 15:37:06] [INFO ] Computed 160 invariants in 4 ms
[2024-05-30 15:37:07] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-30 15:37:07] [INFO ] Invariant cache hit.
[2024-05-30 15:37:07] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
[2024-05-30 15:37:07] [INFO ] Redundant transitions in 15 ms returned []
Running 320 sub problems to find dead transitions.
[2024-05-30 15:37:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 1/321 variables, 160/480 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (OVERLAPS) 321/642 variables, 321/802 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (OVERLAPS) 0/642 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 642/642 variables, and 802 constraints, problems are : Problem set: 0 solved, 320 unsolved in 14169 ms.
Refiners :[Domain max(s): 321/321 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 1/321 variables, 160/480 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (OVERLAPS) 321/642 variables, 321/802 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 320/1122 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/642 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (OVERLAPS) 0/642 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Int declared 642/642 variables, and 1122 constraints, problems are : Problem set: 0 solved, 320 unsolved in 15778 ms.
Refiners :[Domain max(s): 321/321 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints]
After SMT, in 29996ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 30000ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 30438 ms. Remains : 321/321 places, 321/321 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 117 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 385 ms. (103 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 110 ms. (360 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 110 ms. (360 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 25974 steps, run visited all 4 properties in 141 ms. (steps per millisecond=184 )
Probabilistic random walk after 25974 steps, saw 25091 distinct states, run finished after 142 ms. (steps per millisecond=182 ) properties seen :4
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 227 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (AND (NOT p0) p1), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 387 ms.
Product exploration explored 100000 steps with 0 reset in 453 ms.
Support contains 3 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 321/321 transitions.
Applied a total of 0 rules in 10 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
[2024-05-30 15:37:39] [INFO ] Invariant cache hit.
[2024-05-30 15:37:39] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-30 15:37:39] [INFO ] Invariant cache hit.
[2024-05-30 15:37:39] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2024-05-30 15:37:39] [INFO ] Redundant transitions in 4 ms returned []
Running 320 sub problems to find dead transitions.
[2024-05-30 15:37:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 1/321 variables, 160/480 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (OVERLAPS) 321/642 variables, 321/802 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (OVERLAPS) 0/642 variables, 0/802 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 642/642 variables, and 802 constraints, problems are : Problem set: 0 solved, 320 unsolved in 14564 ms.
Refiners :[Domain max(s): 321/321 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (OVERLAPS) 1/321 variables, 160/480 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (OVERLAPS) 321/642 variables, 321/802 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 320/1122 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/642 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 8 (OVERLAPS) 0/642 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Int declared 642/642 variables, and 1122 constraints, problems are : Problem set: 0 solved, 320 unsolved in 16073 ms.
Refiners :[Domain max(s): 321/321 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints]
After SMT, in 30714ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 30717ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31143 ms. Remains : 321/321 places, 321/321 transitions.
Treatment of property ShieldRVt-PT-040A-LTLFireability-08 finished in 66065 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(!p0)) U (p1 U p2)))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 320 transition count 320
Applied a total of 3 rules in 17 ms. Remains 320 /323 variables (removed 3) and now considering 320/322 (removed 2) transitions.
// Phase 1: matrix 320 rows 320 cols
[2024-05-30 15:38:10] [INFO ] Computed 160 invariants in 1 ms
[2024-05-30 15:38:10] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-30 15:38:10] [INFO ] Invariant cache hit.
[2024-05-30 15:38:11] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2024-05-30 15:38:11] [INFO ] Redundant transitions in 4 ms returned []
Running 319 sub problems to find dead transitions.
[2024-05-30 15:38:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 160/480 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (OVERLAPS) 320/640 variables, 320/800 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (OVERLAPS) 0/640 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Real declared 640/640 variables, and 800 constraints, problems are : Problem set: 0 solved, 319 unsolved in 11365 ms.
Refiners :[Domain max(s): 320/320 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 319 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 160/480 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (OVERLAPS) 320/640 variables, 320/800 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 319/1119 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (OVERLAPS) 0/640 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Int declared 640/640 variables, and 1119 constraints, problems are : Problem set: 0 solved, 319 unsolved in 13511 ms.
Refiners :[Domain max(s): 320/320 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 0/0 constraints]
After SMT, in 24919ms problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 24923ms
Starting structural reductions in SI_LTL mode, iteration 1 : 320/323 places, 320/322 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25341 ms. Remains : 320/323 places, 320/322 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p2), p0]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 403 ms.
Stack based approach found an accepted trace after 18639 steps with 0 reset with depth 18640 and stack size 3234 in 96 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-09 finished in 25942 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||X(F(p1))))'
Support contains 1 out of 323 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 8 ms. Remains 322 /323 variables (removed 1) and now considering 321/322 (removed 1) transitions.
// Phase 1: matrix 321 rows 322 cols
[2024-05-30 15:38:36] [INFO ] Computed 161 invariants in 2 ms
[2024-05-30 15:38:36] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-30 15:38:36] [INFO ] Invariant cache hit.
[2024-05-30 15:38:37] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2024-05-30 15:38:37] [INFO ] Redundant transitions in 5 ms returned []
Running 320 sub problems to find dead transitions.
[2024-05-30 15:38:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (OVERLAPS) 321/643 variables, 322/805 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/643 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (OVERLAPS) 0/643 variables, 0/805 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 643/643 variables, and 805 constraints, problems are : Problem set: 0 solved, 320 unsolved in 11413 ms.
Refiners :[Domain max(s): 322/322 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 322/322 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 161/483 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (OVERLAPS) 321/643 variables, 322/805 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/643 variables, 320/1125 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/643 variables, 0/1125 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (OVERLAPS) 0/643 variables, 0/1125 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Int declared 643/643 variables, and 1125 constraints, problems are : Problem set: 0 solved, 320 unsolved in 14189 ms.
Refiners :[Domain max(s): 322/322 constraints, Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints]
After SMT, in 25644ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 25648ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 26063 ms. Remains : 322/323 places, 321/322 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p1)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 379 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-13 finished in 26512 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 320 transition count 320
Applied a total of 3 rules in 23 ms. Remains 320 /323 variables (removed 3) and now considering 320/322 (removed 2) transitions.
// Phase 1: matrix 320 rows 320 cols
[2024-05-30 15:39:03] [INFO ] Computed 160 invariants in 2 ms
[2024-05-30 15:39:03] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-30 15:39:03] [INFO ] Invariant cache hit.
[2024-05-30 15:39:03] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2024-05-30 15:39:03] [INFO ] Redundant transitions in 1 ms returned []
Running 319 sub problems to find dead transitions.
[2024-05-30 15:39:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 160/480 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (OVERLAPS) 320/640 variables, 320/800 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (OVERLAPS) 0/640 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Real declared 640/640 variables, and 800 constraints, problems are : Problem set: 0 solved, 319 unsolved in 11132 ms.
Refiners :[Domain max(s): 320/320 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 319 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/320 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/320 variables, 160/480 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/320 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (OVERLAPS) 320/640 variables, 320/800 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/640 variables, 319/1119 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/640 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (OVERLAPS) 0/640 variables, 0/1119 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Int declared 640/640 variables, and 1119 constraints, problems are : Problem set: 0 solved, 319 unsolved in 13512 ms.
Refiners :[Domain max(s): 320/320 constraints, Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 0/0 constraints]
After SMT, in 24684ms problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 24687ms
Starting structural reductions in SI_LTL mode, iteration 1 : 320/323 places, 320/322 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25102 ms. Remains : 320/323 places, 320/322 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-14
Product exploration explored 100000 steps with 11 reset in 370 ms.
Stack based approach found an accepted trace after 73 steps with 0 reset with depth 74 and stack size 74 in 0 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-14 finished in 25585 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X((p0&&(p1||X(p2))))&&(!p3 U (p4||G(!p3)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p0&&F(!p1))))))'
[2024-05-30 15:39:29] [INFO ] Flatten gal took : 26 ms
[2024-05-30 15:39:29] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-30 15:39:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 323 places, 322 transitions and 1364 arcs took 6 ms.
Total runtime 472880 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldRVt-PT-040A

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/408/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 323
TRANSITIONS: 322
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.006s, Sys 0.001s]


SAVING FILE /home/mcc/execution/408/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1563
MODEL NAME: /home/mcc/execution/408/model
323 places, 322 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ShieldRVt-PT-040A-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA ShieldRVt-PT-040A-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717083570801

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-040A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is ShieldRVt-PT-040A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683760001012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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