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.r496-tall-171640603800596.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is GPUForwardProgress-PT-36a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640603800596
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 23:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 11 23:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 11 23:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 11 23:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 56K May 18 16:42 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 GPUForwardProgress-PT-36a-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-36a-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-36a-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-36a-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-36a-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-36a-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-36a-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-36a-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-36a-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-36a-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-36a-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-36a-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-36a-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-36a-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-36a-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-36a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717198924178

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-36a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:42:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 23:42:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:42:05] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-05-31 23:42:05] [INFO ] Transformed 152 places.
[2024-05-31 23:42:05] [INFO ] Transformed 189 transitions.
[2024-05-31 23:42:05] [INFO ] Found NUPN structural information;
[2024-05-31 23:42:05] [INFO ] Parsed PT model containing 152 places and 189 transitions and 741 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 38 transitions
Reduce redundant transitions removed 38 transitions.
FORMULA GPUForwardProgress-PT-36a-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-36a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-36a-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 72 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 151/151 transitions.
Applied a total of 0 rules in 18 ms. Remains 152 /152 variables (removed 0) and now considering 151/151 (removed 0) transitions.
// Phase 1: matrix 151 rows 152 cols
[2024-05-31 23:42:05] [INFO ] Computed 38 invariants in 19 ms
[2024-05-31 23:42:06] [INFO ] Implicit Places using invariants in 238 ms returned []
[2024-05-31 23:42:06] [INFO ] Invariant cache hit.
[2024-05-31 23:42:06] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 23:42:06] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-31 23:42:06] [INFO ] Invariant cache hit.
[2024-05-31 23:42:06] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 151/151 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 38/189 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 150/301 variables, 151/340 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 36/376 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 1/302 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/302 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 1/303 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 11 (OVERLAPS) 0/303 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 379 constraints, problems are : Problem set: 0 solved, 150 unsolved in 12941 ms.
Refiners :[Domain max(s): 152/152 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 152/152 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 151/151 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 38/189 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 150/301 variables, 151/340 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 36/376 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 150/526 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 1/302 variables, 1/527 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/302 variables, 1/528 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (OVERLAPS) 1/303 variables, 1/529 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/303 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 12 (OVERLAPS) 0/303 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 529 constraints, problems are : Problem set: 0 solved, 150 unsolved in 14479 ms.
Refiners :[Domain max(s): 152/152 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 152/152 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
After SMT, in 27615ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 27632ms
Finished structural reductions in LTL mode , in 1 iterations and 28107 ms. Remains : 152/152 places, 151/151 transitions.
Support contains 72 out of 152 places after structural reductions.
[2024-05-31 23:42:34] [INFO ] Flatten gal took : 35 ms
[2024-05-31 23:42:34] [INFO ] Flatten gal took : 17 ms
[2024-05-31 23:42:34] [INFO ] Input system was already deterministic with 151 transitions.
Support contains 71 out of 152 places (down from 72) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 36 to 35
RANDOM walk for 40000 steps (75 resets) in 1957 ms. (20 steps per ms) remains 1/35 properties
BEST_FIRST walk for 40004 steps (213 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
[2024-05-31 23:42:34] [INFO ] Invariant cache hit.
[2024-05-31 23:42:34] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 111/149 variables, 36/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 111/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/151 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 150/301 variables, 151/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 36/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/301 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/302 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/302 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/302 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/303 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/303 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/303 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 379 constraints, problems are : Problem set: 0 solved, 1 unsolved in 153 ms.
Refiners :[Domain max(s): 152/152 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 152/152 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 111/149 variables, 36/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 111/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/151 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 150/301 variables, 151/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 36/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/301 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/301 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/302 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/302 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/302 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/303 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/303 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/303 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 380 constraints, problems are : Problem set: 0 solved, 1 unsolved in 234 ms.
Refiners :[Domain max(s): 152/152 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 152/152 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 412ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 453 steps, including 2 resets, run visited all 1 properties in 6 ms. (steps per millisecond=75 )
Parikh walk visited 1 properties in 12 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 486 edges and 152 vertex of which 114 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.8 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 U p1)||G((p0||F(p2)))))))'
Support contains 5 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 151/151 transitions.
Graph (complete) has 486 edges and 152 vertex of which 114 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.1 ms
Discarding 38 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 35 Pre rules applied. Total rules applied 1 place count 114 transition count 115
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 0 with 70 rules applied. Total rules applied 71 place count 79 transition count 115
Applied a total of 71 rules in 28 ms. Remains 79 /152 variables (removed 73) and now considering 115/151 (removed 36) transitions.
// Phase 1: matrix 115 rows 79 cols
[2024-05-31 23:42:35] [INFO ] Computed 1 invariants in 6 ms
[2024-05-31 23:42:35] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-31 23:42:35] [INFO ] Invariant cache hit.
[2024-05-31 23:42:35] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 23:42:35] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2024-05-31 23:42:35] [INFO ] Redundant transitions in 2 ms returned []
Running 114 sub problems to find dead transitions.
[2024-05-31 23:42:35] [INFO ] Invariant cache hit.
[2024-05-31 23:42:35] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 114/192 variables, 78/157 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 36/193 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 1/193 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 1/194 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (OVERLAPS) 0/194 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 196 constraints, problems are : Problem set: 0 solved, 114 unsolved in 10338 ms.
Refiners :[Domain max(s): 79/79 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 79/79 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 114/192 variables, 78/157 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 36/193 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 114/307 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 1/193 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (OVERLAPS) 1/194 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 12 (OVERLAPS) 0/194 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 310 constraints, problems are : Problem set: 0 solved, 114 unsolved in 6104 ms.
Refiners :[Domain max(s): 79/79 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 79/79 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
After SMT, in 16580ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 16582ms
Starting structural reductions in SI_LTL mode, iteration 1 : 79/152 places, 115/151 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16763 ms. Remains : 79/152 places, 115/151 transitions.
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-36a-LTLFireability-00
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-36a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36a-LTLFireability-00 finished in 17027 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0 U (p1||G(p0)))&&(F(p3)||p2)))))'
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 151/151 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 151 transition count 151
Applied a total of 1 rules in 12 ms. Remains 151 /152 variables (removed 1) and now considering 151/151 (removed 0) transitions.
// Phase 1: matrix 151 rows 151 cols
[2024-05-31 23:42:52] [INFO ] Computed 37 invariants in 2 ms
[2024-05-31 23:42:52] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-31 23:42:52] [INFO ] Invariant cache hit.
[2024-05-31 23:42:52] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 23:42:53] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-31 23:42:53] [INFO ] Invariant cache hit.
[2024-05-31 23:42:53] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 37/187 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 150/300 variables, 150/337 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 36/373 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 1/301 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 1/302 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 11 (OVERLAPS) 0/302 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 376 constraints, problems are : Problem set: 0 solved, 150 unsolved in 12701 ms.
Refiners :[Domain max(s): 151/151 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 151/151 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 37/187 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 150/300 variables, 150/337 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 36/373 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 150/523 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 1/301 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 1/525 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (OVERLAPS) 1/302 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 12 (OVERLAPS) 0/302 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 526 constraints, problems are : Problem set: 0 solved, 150 unsolved in 13859 ms.
Refiners :[Domain max(s): 151/151 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 151/151 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
After SMT, in 26668ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 26673ms
Starting structural reductions in LTL mode, iteration 1 : 151/152 places, 151/151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27011 ms. Remains : 151/152 places, 151/151 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p3))), true, (NOT p3)]
Running random walk in product with property : GPUForwardProgress-PT-36a-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36a-LTLFireability-01 finished in 27201 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((F(p0) U (p0||G(!p1))))))'
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 151/151 transitions.
Graph (complete) has 486 edges and 152 vertex of which 114 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.3 ms
Discarding 38 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 34 Pre rules applied. Total rules applied 1 place count 114 transition count 116
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 0 with 68 rules applied. Total rules applied 69 place count 80 transition count 116
Applied a total of 69 rules in 21 ms. Remains 80 /152 variables (removed 72) and now considering 116/151 (removed 35) transitions.
// Phase 1: matrix 116 rows 80 cols
[2024-05-31 23:43:19] [INFO ] Computed 1 invariants in 1 ms
[2024-05-31 23:43:20] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-31 23:43:20] [INFO ] Invariant cache hit.
[2024-05-31 23:43:20] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 23:43:20] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-05-31 23:43:20] [INFO ] Redundant transitions in 3 ms returned []
Running 115 sub problems to find dead transitions.
[2024-05-31 23:43:20] [INFO ] Invariant cache hit.
[2024-05-31 23:43:20] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 115/194 variables, 79/159 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 36/195 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 1/195 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (OVERLAPS) 1/196 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 11 (OVERLAPS) 0/196 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 198 constraints, problems are : Problem set: 0 solved, 115 unsolved in 10575 ms.
Refiners :[Domain max(s): 80/80 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 80/80 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 115/194 variables, 79/159 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/194 variables, 36/195 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 115/310 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 1/195 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 1/196 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 12 (OVERLAPS) 0/196 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 313 constraints, problems are : Problem set: 0 solved, 115 unsolved in 6844 ms.
Refiners :[Domain max(s): 80/80 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 80/80 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
After SMT, in 17503ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 17505ms
Starting structural reductions in SI_LTL mode, iteration 1 : 80/152 places, 116/151 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17649 ms. Remains : 80/152 places, 116/151 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : GPUForwardProgress-PT-36a-LTLFireability-02
Product exploration explored 100000 steps with 711 reset in 523 ms.
Stack based approach found an accepted trace after 358 steps with 3 reset with depth 14 and stack size 12 in 2 ms.
FORMULA GPUForwardProgress-PT-36a-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property GPUForwardProgress-PT-36a-LTLFireability-02 finished in 18298 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)&&(!p1 U (p2||G(!p1)))))'
Support contains 42 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 151/151 transitions.
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 35 Pre rules applied. Total rules applied 0 place count 152 transition count 116
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 0 with 70 rules applied. Total rules applied 70 place count 117 transition count 116
Applied a total of 70 rules in 11 ms. Remains 117 /152 variables (removed 35) and now considering 116/151 (removed 35) transitions.
// Phase 1: matrix 116 rows 117 cols
[2024-05-31 23:43:38] [INFO ] Computed 38 invariants in 0 ms
[2024-05-31 23:43:38] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-31 23:43:38] [INFO ] Invariant cache hit.
[2024-05-31 23:43:38] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 23:43:38] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2024-05-31 23:43:38] [INFO ] Redundant transitions in 3 ms returned []
Running 115 sub problems to find dead transitions.
[2024-05-31 23:43:38] [INFO ] Invariant cache hit.
[2024-05-31 23:43:38] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 38/154 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 115/231 variables, 116/270 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 36/306 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (OVERLAPS) 1/232 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (OVERLAPS) 1/233 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 11 (OVERLAPS) 0/233 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 309 constraints, problems are : Problem set: 0 solved, 115 unsolved in 6949 ms.
Refiners :[Domain max(s): 117/117 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 117/117 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 116/116 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 38/154 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (OVERLAPS) 115/231 variables, 116/270 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 36/306 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 115/421 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 1/232 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 10 (OVERLAPS) 1/233 variables, 1/424 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 12 (OVERLAPS) 0/233 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 424 constraints, problems are : Problem set: 0 solved, 115 unsolved in 9408 ms.
Refiners :[Domain max(s): 117/117 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 117/117 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints]
After SMT, in 16458ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 16459ms
Starting structural reductions in SI_LTL mode, iteration 1 : 117/152 places, 116/151 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16711 ms. Remains : 117/152 places, 116/151 transitions.
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p2) p1), true, (NOT p0), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : GPUForwardProgress-PT-36a-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 304 ms.
Product exploration explored 100000 steps with 50000 reset in 311 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 451 edges and 117 vertex of which 79 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.1 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT p1)), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 17 factoid took 23 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-36a-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-36a-LTLFireability-04 finished in 17514 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U X((p1||F(G(p2))))))'
Support contains 5 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 151/151 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 151 transition count 151
Applied a total of 1 rules in 5 ms. Remains 151 /152 variables (removed 1) and now considering 151/151 (removed 0) transitions.
// Phase 1: matrix 151 rows 151 cols
[2024-05-31 23:43:55] [INFO ] Computed 37 invariants in 1 ms
[2024-05-31 23:43:55] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-31 23:43:55] [INFO ] Invariant cache hit.
[2024-05-31 23:43:55] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 23:43:56] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-31 23:43:56] [INFO ] Invariant cache hit.
[2024-05-31 23:43:56] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 37/187 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 150/300 variables, 150/337 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 36/373 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 1/301 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 1/302 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 11 (OVERLAPS) 0/302 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 376 constraints, problems are : Problem set: 0 solved, 150 unsolved in 12424 ms.
Refiners :[Domain max(s): 151/151 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 151/151 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 37/187 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 150/300 variables, 150/337 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 36/373 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 150/523 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 1/301 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 1/525 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (OVERLAPS) 1/302 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 12 (OVERLAPS) 0/302 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 526 constraints, problems are : Problem set: 0 solved, 150 unsolved in 13707 ms.
Refiners :[Domain max(s): 151/151 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 151/151 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
After SMT, in 26234ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 26236ms
Starting structural reductions in LTL mode, iteration 1 : 151/152 places, 151/151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26506 ms. Remains : 151/152 places, 151/151 transitions.
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) p0)]
Running random walk in product with property : GPUForwardProgress-PT-36a-LTLFireability-05
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36a-LTLFireability-05 finished in 26734 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||G(p1)) U (p2||X((G(p3) U (p2&&G(p3)))))))'
Support contains 6 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 151/151 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 151 transition count 151
Applied a total of 1 rules in 3 ms. Remains 151 /152 variables (removed 1) and now considering 151/151 (removed 0) transitions.
[2024-05-31 23:44:22] [INFO ] Invariant cache hit.
[2024-05-31 23:44:22] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-31 23:44:22] [INFO ] Invariant cache hit.
[2024-05-31 23:44:22] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 23:44:22] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-31 23:44:22] [INFO ] Invariant cache hit.
[2024-05-31 23:44:22] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 37/187 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 150/300 variables, 150/337 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 36/373 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 1/301 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 1/302 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 11 (OVERLAPS) 0/302 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 376 constraints, problems are : Problem set: 0 solved, 150 unsolved in 12607 ms.
Refiners :[Domain max(s): 151/151 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 151/151 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 37/187 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 150/300 variables, 150/337 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 36/373 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 150/523 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 1/301 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 1/525 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (OVERLAPS) 1/302 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 12 (OVERLAPS) 0/302 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 526 constraints, problems are : Problem set: 0 solved, 150 unsolved in 13835 ms.
Refiners :[Domain max(s): 151/151 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 151/151 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
After SMT, in 26548ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 26550ms
Starting structural reductions in LTL mode, iteration 1 : 151/152 places, 151/151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26809 ms. Remains : 151/152 places, 151/151 transitions.
Stuttering acceptance computed with spot in 280 ms :[(NOT p2), (OR (NOT p3) (NOT p2)), (OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), true, (NOT p3), (NOT p1), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-36a-LTLFireability-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36a-LTLFireability-06 finished in 27111 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 (G(p0)||(p0&&(!p1 U (p2||G(!p1)))))))'
Support contains 5 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 151/151 transitions.
Graph (complete) has 486 edges and 152 vertex of which 114 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.1 ms
Discarding 38 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 33 Pre rules applied. Total rules applied 1 place count 114 transition count 117
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 0 with 66 rules applied. Total rules applied 67 place count 81 transition count 117
Applied a total of 67 rules in 8 ms. Remains 81 /152 variables (removed 71) and now considering 117/151 (removed 34) transitions.
// Phase 1: matrix 117 rows 81 cols
[2024-05-31 23:44:49] [INFO ] Computed 1 invariants in 6 ms
[2024-05-31 23:44:49] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-31 23:44:49] [INFO ] Invariant cache hit.
[2024-05-31 23:44:49] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 23:44:49] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2024-05-31 23:44:49] [INFO ] Redundant transitions in 2 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-31 23:44:49] [INFO ] Invariant cache hit.
[2024-05-31 23:44:49] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 116/196 variables, 80/161 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 36/197 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 1/197 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 1/198 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (OVERLAPS) 0/198 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 200 constraints, problems are : Problem set: 0 solved, 116 unsolved in 10518 ms.
Refiners :[Domain max(s): 81/81 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 116/196 variables, 80/161 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 36/197 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 116/313 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 1/197 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 1/198 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 12 (OVERLAPS) 0/198 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 316 constraints, problems are : Problem set: 0 solved, 116 unsolved in 7270 ms.
Refiners :[Domain max(s): 81/81 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
After SMT, in 17862ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 17863ms
Starting structural reductions in SI_LTL mode, iteration 1 : 81/152 places, 117/151 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17989 ms. Remains : 81/152 places, 117/151 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2) p1), (AND (NOT p2) p1)]
Running random walk in product with property : GPUForwardProgress-PT-36a-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1071 steps with 2 reset in 10 ms.
FORMULA GPUForwardProgress-PT-36a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36a-LTLFireability-08 finished in 18122 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&&X((p0 U (!p1||G(p0))))) U (G((p0&&X((p0 U (!p1||G(p0))))))||(p0&&X((p0 U (!p1||G(p0))))&&G(p2)))))'
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 151/151 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 151 transition count 151
Applied a total of 1 rules in 2 ms. Remains 151 /152 variables (removed 1) and now considering 151/151 (removed 0) transitions.
// Phase 1: matrix 151 rows 151 cols
[2024-05-31 23:45:07] [INFO ] Computed 37 invariants in 2 ms
[2024-05-31 23:45:07] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-31 23:45:07] [INFO ] Invariant cache hit.
[2024-05-31 23:45:07] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 23:45:08] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-31 23:45:08] [INFO ] Invariant cache hit.
[2024-05-31 23:45:08] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 37/187 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 150/300 variables, 150/337 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 36/373 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 1/301 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 1/302 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 11 (OVERLAPS) 0/302 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 376 constraints, problems are : Problem set: 0 solved, 150 unsolved in 12459 ms.
Refiners :[Domain max(s): 151/151 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 151/151 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 37/187 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 150/300 variables, 150/337 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 36/373 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 150/523 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 1/301 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 1/525 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (OVERLAPS) 1/302 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 12 (OVERLAPS) 0/302 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 526 constraints, problems are : Problem set: 0 solved, 150 unsolved in 13809 ms.
Refiners :[Domain max(s): 151/151 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 151/151 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
After SMT, in 26358ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 26362ms
Starting structural reductions in LTL mode, iteration 1 : 151/152 places, 151/151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26655 ms. Remains : 151/152 places, 151/151 transitions.
Stuttering acceptance computed with spot in 199 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Running random walk in product with property : GPUForwardProgress-PT-36a-LTLFireability-09
Product exploration explored 100000 steps with 140 reset in 336 ms.
Product exploration explored 100000 steps with 144 reset in 358 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 484 edges and 151 vertex of which 114 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.1 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/151 stabilizing places and 1/151 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND p0 p2)), (X (NOT (AND p0 p2 p1))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2 (NOT p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 17 factoid took 519 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
RANDOM walk for 40000 steps (68 resets) in 557 ms. (71 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40003 steps (10 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
[2024-05-31 23:45:36] [INFO ] Invariant cache hit.
[2024-05-31 23:45:36] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 7/9 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 142/151 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 142/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 150/301 variables, 151/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 36/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/301 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/302 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/302 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/302 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 376 constraints, problems are : Problem set: 0 solved, 1 unsolved in 131 ms.
Refiners :[Domain max(s): 151/151 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 151/151 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 7/9 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 142/151 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 142/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 301/302 variables, and 339 constraints, problems are : Problem set: 1 solved, 0 unsolved in 83 ms.
Refiners :[Domain max(s): 151/151 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 151/151 constraints, ReadFeed: 0/37 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 218ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND p0 p2)), (X (NOT (AND p0 p2 p1))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2 (NOT p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (G (OR p0 p2))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (AND (OR p0 p2) (OR p0 (NOT p1))))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F p1), (F (NOT (AND p0 (NOT p2)))), (F (NOT p0))]
Knowledge based reduction with 18 factoid took 982 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 151/151 transitions.
Applied a total of 0 rules in 6 ms. Remains 151 /151 variables (removed 0) and now considering 151/151 (removed 0) transitions.
[2024-05-31 23:45:37] [INFO ] Invariant cache hit.
[2024-05-31 23:45:37] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-31 23:45:37] [INFO ] Invariant cache hit.
[2024-05-31 23:45:37] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 23:45:38] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-31 23:45:38] [INFO ] Invariant cache hit.
[2024-05-31 23:45:38] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 37/187 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 150/300 variables, 150/337 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 36/373 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 1/301 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 1/302 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 11 (OVERLAPS) 0/302 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 376 constraints, problems are : Problem set: 0 solved, 150 unsolved in 12196 ms.
Refiners :[Domain max(s): 151/151 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 151/151 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 37/187 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 150/300 variables, 150/337 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 36/373 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 150/523 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 1/301 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 1/525 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (OVERLAPS) 1/302 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 12 (OVERLAPS) 0/302 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 526 constraints, problems are : Problem set: 0 solved, 150 unsolved in 13944 ms.
Refiners :[Domain max(s): 151/151 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 151/151 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
After SMT, in 26244ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 26247ms
Finished structural reductions in LTL mode , in 1 iterations and 26527 ms. Remains : 151/151 places, 151/151 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 484 edges and 151 vertex of which 114 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.4 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/151 stabilizing places and 1/151 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p2)), (X (NOT (AND p0 p2 p1))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2 (NOT p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 18 factoid took 482 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
RANDOM walk for 40000 steps (73 resets) in 271 ms. (147 steps per ms) remains 1/10 properties
BEST_FIRST walk for 843 steps (0 resets) in 6 ms. (120 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p2)), (X (NOT (AND p0 p2 p1))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2 (NOT p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F p2), (F p1), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 18 factoid took 865 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Product exploration explored 100000 steps with 153 reset in 315 ms.
Product exploration explored 100000 steps with 141 reset in 335 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 151/151 transitions.
Graph (complete) has 484 edges and 151 vertex of which 114 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.3 ms
Discarding 37 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 35 Pre rules applied. Total rules applied 1 place count 114 transition count 185
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 0 with 35 rules applied. Total rules applied 36 place count 114 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 36 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 37 place count 114 transition count 185
Deduced a syphon composed of 36 places in 0 ms
Applied a total of 37 rules in 20 ms. Remains 114 /151 variables (removed 37) and now considering 185/151 (removed -34) transitions.
[2024-05-31 23:46:07] [INFO ] Redundant transitions in 5 ms returned []
Running 184 sub problems to find dead transitions.
// Phase 1: matrix 185 rows 114 cols
[2024-05-31 23:46:07] [INFO ] Computed 1 invariants in 1 ms
[2024-05-31 23:46:07] [INFO ] State equation strengthened by 108 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 113/113 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 184 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
At refinement iteration 3 (OVERLAPS) 184/297 variables, 113/227 constraints. Problems are: Problem set: 71 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 107/334 constraints. Problems are: Problem set: 71 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/334 constraints. Problems are: Problem set: 71 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 1/298 variables, 1/335 constraints. Problems are: Problem set: 71 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 1/336 constraints. Problems are: Problem set: 71 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 0/336 constraints. Problems are: Problem set: 71 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 1/299 variables, 1/337 constraints. Problems are: Problem set: 71 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 0/337 constraints. Problems are: Problem set: 71 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/299 variables, 0/337 constraints. Problems are: Problem set: 71 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 299/299 variables, and 337 constraints, problems are : Problem set: 71 solved, 113 unsolved in 5355 ms.
Refiners :[Domain max(s): 114/114 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 71 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 71 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 71 solved, 113 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 1/78 constraints. Problems are: Problem set: 71 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/79 constraints. Problems are: Problem set: 71 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/79 constraints. Problems are: Problem set: 71 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 184/262 variables, 78/157 constraints. Problems are: Problem set: 71 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 107/264 constraints. Problems are: Problem set: 71 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 113/377 constraints. Problems are: Problem set: 71 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/377 constraints. Problems are: Problem set: 71 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 36/298 variables, 36/413 constraints. Problems are: Problem set: 71 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/298 variables, 36/449 constraints. Problems are: Problem set: 71 solved, 113 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/298 variables, 0/449 constraints. Problems are: Problem set: 71 solved, 113 unsolved
At refinement iteration 12 (OVERLAPS) 1/299 variables, 1/450 constraints. Problems are: Problem set: 71 solved, 113 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/299 variables, 0/450 constraints. Problems are: Problem set: 71 solved, 113 unsolved
At refinement iteration 14 (OVERLAPS) 0/299 variables, 0/450 constraints. Problems are: Problem set: 71 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 299/299 variables, and 450 constraints, problems are : Problem set: 71 solved, 113 unsolved in 7629 ms.
Refiners :[Domain max(s): 114/114 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 114/114 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 113/184 constraints, Known Traps: 0/0 constraints]
After SMT, in 13168ms problems are : Problem set: 71 solved, 113 unsolved
Search for dead transitions found 71 dead transitions in 13171ms
Found 71 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 71 transitions
Dead transitions reduction (with SMT) removed 71 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 114/151 places, 114/151 transitions.
Graph (complete) has 338 edges and 114 vertex of which 78 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.2 ms
Discarding 36 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 78 /114 variables (removed 36) and now considering 114/114 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/151 places, 114/151 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13228 ms. Remains : 78/151 places, 114/151 transitions.
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 151/151 transitions.
Applied a total of 0 rules in 3 ms. Remains 151 /151 variables (removed 0) and now considering 151/151 (removed 0) transitions.
// Phase 1: matrix 151 rows 151 cols
[2024-05-31 23:46:20] [INFO ] Computed 37 invariants in 1 ms
[2024-05-31 23:46:20] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-31 23:46:20] [INFO ] Invariant cache hit.
[2024-05-31 23:46:20] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 23:46:20] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-31 23:46:20] [INFO ] Invariant cache hit.
[2024-05-31 23:46:20] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 37/187 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 150/300 variables, 150/337 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 36/373 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 1/301 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 1/302 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 11 (OVERLAPS) 0/302 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 376 constraints, problems are : Problem set: 0 solved, 150 unsolved in 12442 ms.
Refiners :[Domain max(s): 151/151 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 151/151 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 37/187 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 150/300 variables, 150/337 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 36/373 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 150/523 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 1/301 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 1/525 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (OVERLAPS) 1/302 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 12 (OVERLAPS) 0/302 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 526 constraints, problems are : Problem set: 0 solved, 150 unsolved in 13915 ms.
Refiners :[Domain max(s): 151/151 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 151/151 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
After SMT, in 26439ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 26442ms
Finished structural reductions in LTL mode , in 1 iterations and 26739 ms. Remains : 151/151 places, 151/151 transitions.
Treatment of property GPUForwardProgress-PT-36a-LTLFireability-09 finished in 99740 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((F(p1)&&p0))||X(p1)))'
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 151/151 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 151 transition count 151
Applied a total of 1 rules in 1 ms. Remains 151 /152 variables (removed 1) and now considering 151/151 (removed 0) transitions.
[2024-05-31 23:46:47] [INFO ] Invariant cache hit.
[2024-05-31 23:46:47] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-31 23:46:47] [INFO ] Invariant cache hit.
[2024-05-31 23:46:47] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 23:46:47] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-31 23:46:47] [INFO ] Invariant cache hit.
[2024-05-31 23:46:47] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 37/187 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 150/300 variables, 150/337 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 36/373 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 1/301 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 1/302 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 11 (OVERLAPS) 0/302 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 376 constraints, problems are : Problem set: 0 solved, 150 unsolved in 12347 ms.
Refiners :[Domain max(s): 151/151 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 151/151 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 37/187 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 150/300 variables, 150/337 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 36/373 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 150/523 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 1/301 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 1/525 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (OVERLAPS) 1/302 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 12 (OVERLAPS) 0/302 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 526 constraints, problems are : Problem set: 0 solved, 150 unsolved in 13551 ms.
Refiners :[Domain max(s): 151/151 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 151/151 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
After SMT, in 25983ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 25985ms
Starting structural reductions in LTL mode, iteration 1 : 151/152 places, 151/151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26221 ms. Remains : 151/152 places, 151/151 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-36a-LTLFireability-10
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36a-LTLFireability-10 finished in 26379 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&&X(G((p0||G(p1)))))))'
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 151/151 transitions.
Graph (complete) has 486 edges and 152 vertex of which 114 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.1 ms
Discarding 38 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 35 Pre rules applied. Total rules applied 1 place count 114 transition count 115
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 0 with 70 rules applied. Total rules applied 71 place count 79 transition count 115
Applied a total of 71 rules in 21 ms. Remains 79 /152 variables (removed 73) and now considering 115/151 (removed 36) transitions.
// Phase 1: matrix 115 rows 79 cols
[2024-05-31 23:47:13] [INFO ] Computed 1 invariants in 1 ms
[2024-05-31 23:47:13] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-31 23:47:13] [INFO ] Invariant cache hit.
[2024-05-31 23:47:13] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 23:47:13] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-05-31 23:47:13] [INFO ] Redundant transitions in 1 ms returned []
Running 114 sub problems to find dead transitions.
[2024-05-31 23:47:13] [INFO ] Invariant cache hit.
[2024-05-31 23:47:14] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 114/192 variables, 78/157 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 36/193 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (OVERLAPS) 1/193 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (OVERLAPS) 1/194 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (OVERLAPS) 0/194 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 196 constraints, problems are : Problem set: 0 solved, 114 unsolved in 4618 ms.
Refiners :[Domain max(s): 79/79 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 79/79 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (OVERLAPS) 114/192 variables, 78/157 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 36/193 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 114/307 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 1/193 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 10 (OVERLAPS) 1/194 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 12 (OVERLAPS) 0/194 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 310 constraints, problems are : Problem set: 0 solved, 114 unsolved in 7017 ms.
Refiners :[Domain max(s): 79/79 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 79/79 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
After SMT, in 11716ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 11718ms
Starting structural reductions in SI_LTL mode, iteration 1 : 79/152 places, 115/151 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11881 ms. Remains : 79/152 places, 115/151 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-36a-LTLFireability-11
Stuttering criterion allowed to conclude after 183 steps with 2 reset in 1 ms.
FORMULA GPUForwardProgress-PT-36a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36a-LTLFireability-11 finished in 12054 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 38 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 151/151 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 36 Pre rules applied. Total rules applied 0 place count 151 transition count 114
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 0 with 72 rules applied. Total rules applied 72 place count 115 transition count 114
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 74 place count 114 transition count 113
Applied a total of 74 rules in 13 ms. Remains 114 /152 variables (removed 38) and now considering 113/151 (removed 38) transitions.
// Phase 1: matrix 113 rows 114 cols
[2024-05-31 23:47:25] [INFO ] Computed 38 invariants in 1 ms
[2024-05-31 23:47:25] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-31 23:47:25] [INFO ] Invariant cache hit.
[2024-05-31 23:47:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:47:26] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2024-05-31 23:47:26] [INFO ] Redundant transitions in 1 ms returned []
Running 77 sub problems to find dead transitions.
[2024-05-31 23:47:26] [INFO ] Invariant cache hit.
[2024-05-31 23:47:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 36/114 variables, 36/116 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 36/152 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 112/226 variables, 114/266 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 1/227 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 0/227 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 267 constraints, problems are : Problem set: 0 solved, 77 unsolved in 2017 ms.
Refiners :[Domain max(s): 114/114 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 114/114 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 36/114 variables, 36/116 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 36/152 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 112/226 variables, 114/266 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 77/343 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 1/227 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 0/227 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 344 constraints, problems are : Problem set: 0 solved, 77 unsolved in 3298 ms.
Refiners :[Domain max(s): 114/114 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 114/114 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
After SMT, in 5362ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 5365ms
Starting structural reductions in SI_LTL mode, iteration 1 : 114/152 places, 113/151 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5639 ms. Remains : 114/152 places, 113/151 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-36a-LTLFireability-13
Product exploration explored 100000 steps with 316 reset in 306 ms.
Product exploration explored 100000 steps with 332 reset in 322 ms.
Computed a total of 0 stabilizing places and 1 stable transitions
Graph (complete) has 411 edges and 114 vertex of which 76 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (162 resets) in 267 ms. (149 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (332 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1757576 steps, run timeout after 3001 ms. (steps per millisecond=585 ) properties seen :0 out of 1
Probabilistic random walk after 1757576 steps, saw 967714 distinct states, run finished after 3004 ms. (steps per millisecond=585 ) properties seen :0
[2024-05-31 23:47:35] [INFO ] Invariant cache hit.
[2024-05-31 23:47:35] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 74/112 variables, 36/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 74/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/114 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 112/226 variables, 114/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/227 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/227 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 182 ms.
Refiners :[Domain max(s): 114/114 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 114/114 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 74/112 variables, 36/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 74/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/114 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 112/226 variables, 114/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/227 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/227 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/227 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 152 ms.
Refiners :[Domain max(s): 114/114 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 114/114 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 340ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 232 steps, including 2 resets, run visited all 1 properties in 4 ms. (steps per millisecond=58 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 38 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 113/113 transitions.
Applied a total of 0 rules in 7 ms. Remains 114 /114 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2024-05-31 23:47:36] [INFO ] Invariant cache hit.
[2024-05-31 23:47:36] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-31 23:47:36] [INFO ] Invariant cache hit.
[2024-05-31 23:47:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:47:36] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2024-05-31 23:47:36] [INFO ] Redundant transitions in 0 ms returned []
Running 77 sub problems to find dead transitions.
[2024-05-31 23:47:36] [INFO ] Invariant cache hit.
[2024-05-31 23:47:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 36/114 variables, 36/116 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 36/152 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 112/226 variables, 114/266 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 1/227 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 0/227 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 267 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1930 ms.
Refiners :[Domain max(s): 114/114 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 114/114 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 36/114 variables, 36/116 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 36/152 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 112/226 variables, 114/266 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 77/343 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 1/227 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 0/227 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 344 constraints, problems are : Problem set: 0 solved, 77 unsolved in 3265 ms.
Refiners :[Domain max(s): 114/114 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 114/114 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
After SMT, in 5239ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 5241ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5509 ms. Remains : 114/114 places, 113/113 transitions.
Computed a total of 0 stabilizing places and 1 stable transitions
Graph (complete) has 411 edges and 114 vertex of which 76 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (155 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (316 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1847175 steps, run timeout after 3001 ms. (steps per millisecond=615 ) properties seen :0 out of 1
Probabilistic random walk after 1847175 steps, saw 1015867 distinct states, run finished after 3001 ms. (steps per millisecond=615 ) properties seen :0
[2024-05-31 23:47:44] [INFO ] Invariant cache hit.
[2024-05-31 23:47:44] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 74/112 variables, 36/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 74/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/114 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 112/226 variables, 114/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/227 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/227 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/227 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 189 ms.
Refiners :[Domain max(s): 114/114 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 114/114 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 74/112 variables, 36/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 74/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/114 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 2/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 112/226 variables, 114/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/226 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/226 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/227 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/227 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/227 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 143 ms.
Refiners :[Domain max(s): 114/114 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 114/114 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 337ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 234 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=78 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 336 reset in 310 ms.
Product exploration explored 100000 steps with 360 reset in 377 ms.
Support contains 38 out of 114 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 114/114 places, 113/113 transitions.
Applied a total of 0 rules in 3 ms. Remains 114 /114 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2024-05-31 23:47:46] [INFO ] Invariant cache hit.
[2024-05-31 23:47:46] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-31 23:47:46] [INFO ] Invariant cache hit.
[2024-05-31 23:47:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:47:46] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2024-05-31 23:47:46] [INFO ] Redundant transitions in 1 ms returned []
Running 77 sub problems to find dead transitions.
[2024-05-31 23:47:46] [INFO ] Invariant cache hit.
[2024-05-31 23:47:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 36/114 variables, 36/116 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 36/152 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 112/226 variables, 114/266 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 1/227 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/227 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 0/227 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 227/227 variables, and 267 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1998 ms.
Refiners :[Domain max(s): 114/114 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 114/114 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 36/114 variables, 36/116 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 36/152 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 112/226 variables, 114/266 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 77/343 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/226 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 1/227 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/227 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 0/227 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 227/227 variables, and 344 constraints, problems are : Problem set: 0 solved, 77 unsolved in 3270 ms.
Refiners :[Domain max(s): 114/114 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 114/114 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
After SMT, in 5318ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 5319ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5602 ms. Remains : 114/114 places, 113/113 transitions.
Treatment of property GPUForwardProgress-PT-36a-LTLFireability-13 finished in 26131 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)&&X(F(p1))))'
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 152/152 places, 151/151 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 151 transition count 151
Applied a total of 1 rules in 5 ms. Remains 151 /152 variables (removed 1) and now considering 151/151 (removed 0) transitions.
// Phase 1: matrix 151 rows 151 cols
[2024-05-31 23:47:52] [INFO ] Computed 37 invariants in 1 ms
[2024-05-31 23:47:52] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-31 23:47:52] [INFO ] Invariant cache hit.
[2024-05-31 23:47:52] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 23:47:52] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-31 23:47:52] [INFO ] Invariant cache hit.
[2024-05-31 23:47:52] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 37/187 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 150/300 variables, 150/337 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 36/373 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 1/301 variables, 1/374 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 1/302 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/302 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 11 (OVERLAPS) 0/302 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 376 constraints, problems are : Problem set: 0 solved, 150 unsolved in 12567 ms.
Refiners :[Domain max(s): 151/151 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 151/151 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 150/150 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 37/187 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 150/300 variables, 150/337 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 36/373 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 150/523 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 1/301 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 1/525 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/301 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (OVERLAPS) 1/302 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/302 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 12 (OVERLAPS) 0/302 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 526 constraints, problems are : Problem set: 0 solved, 150 unsolved in 13917 ms.
Refiners :[Domain max(s): 151/151 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 151/151 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 0/0 constraints]
After SMT, in 26575ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 26579ms
Starting structural reductions in LTL mode, iteration 1 : 151/152 places, 151/151 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26894 ms. Remains : 151/152 places, 151/151 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-36a-LTLFireability-14
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36a-LTLFireability-14 finished in 27021 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) U (F(!p2)&&p1)) U (p3||G(!p3))))'
Support contains 6 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 151/151 transitions.
Graph (complete) has 486 edges and 152 vertex of which 114 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.1 ms
Discarding 38 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 33 Pre rules applied. Total rules applied 1 place count 114 transition count 117
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 0 with 66 rules applied. Total rules applied 67 place count 81 transition count 117
Applied a total of 67 rules in 10 ms. Remains 81 /152 variables (removed 71) and now considering 117/151 (removed 34) transitions.
// Phase 1: matrix 117 rows 81 cols
[2024-05-31 23:48:19] [INFO ] Computed 1 invariants in 1 ms
[2024-05-31 23:48:19] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-31 23:48:19] [INFO ] Invariant cache hit.
[2024-05-31 23:48:19] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 23:48:19] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-31 23:48:19] [INFO ] Redundant transitions in 0 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-31 23:48:19] [INFO ] Invariant cache hit.
[2024-05-31 23:48:19] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 116/196 variables, 80/161 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 36/197 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 1/197 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 1/198 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (OVERLAPS) 0/198 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 200 constraints, problems are : Problem set: 0 solved, 116 unsolved in 14433 ms.
Refiners :[Domain max(s): 81/81 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 116/196 variables, 80/161 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 36/197 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 116/313 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 1/197 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (OVERLAPS) 1/198 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 12 (OVERLAPS) 0/198 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 316 constraints, problems are : Problem set: 0 solved, 116 unsolved in 7046 ms.
Refiners :[Domain max(s): 81/81 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 81/81 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 0/0 constraints]
After SMT, in 21581ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 21582ms
Starting structural reductions in SI_LTL mode, iteration 1 : 81/152 places, 117/151 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21721 ms. Remains : 81/152 places, 117/151 transitions.
Stuttering acceptance computed with spot in 275 ms :[false, (AND (NOT p0) p3), (OR (AND (NOT p1) p3) (AND p2 p3)), (AND p2 p3), (NOT p0), (OR (NOT p1) p2), p2]
Running random walk in product with property : GPUForwardProgress-PT-36a-LTLFireability-15
Stuttering criterion allowed to conclude after 1188 steps with 463 reset in 9 ms.
FORMULA GPUForwardProgress-PT-36a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36a-LTLFireability-15 finished in 22026 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&&X((p0 U (!p1||G(p0))))) U (G((p0&&X((p0 U (!p1||G(p0))))))||(p0&&X((p0 U (!p1||G(p0))))&&G(p2)))))'
Found a Shortening insensitive property : GPUForwardProgress-PT-36a-LTLFireability-09
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 152/152 places, 151/151 transitions.
Graph (complete) has 486 edges and 152 vertex of which 114 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.1 ms
Discarding 38 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 35 Pre rules applied. Total rules applied 1 place count 114 transition count 115
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 0 with 70 rules applied. Total rules applied 71 place count 79 transition count 115
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 73 place count 78 transition count 114
Applied a total of 73 rules in 8 ms. Remains 78 /152 variables (removed 74) and now considering 114/151 (removed 37) transitions.
// Phase 1: matrix 114 rows 78 cols
[2024-05-31 23:48:41] [INFO ] Computed 1 invariants in 1 ms
[2024-05-31 23:48:41] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-31 23:48:41] [INFO ] Invariant cache hit.
[2024-05-31 23:48:41] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 23:48:41] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-31 23:48:41] [INFO ] Invariant cache hit.
[2024-05-31 23:48:41] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 113/190 variables, 77/155 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 72/227 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 1/191 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 1/192 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/192 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 230 constraints, problems are : Problem set: 0 solved, 113 unsolved in 4366 ms.
Refiners :[Domain max(s): 78/78 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 113/190 variables, 77/155 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 72/227 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 113/340 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 1/191 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 1/192 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 12 (OVERLAPS) 0/192 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 343 constraints, problems are : Problem set: 0 solved, 113 unsolved in 5990 ms.
Refiners :[Domain max(s): 78/78 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 10467ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 10470ms
Starting structural reductions in LI_LTL mode, iteration 1 : 78/152 places, 114/151 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10627 ms. Remains : 78/152 places, 114/151 transitions.
Running random walk in product with property : GPUForwardProgress-PT-36a-LTLFireability-09
Product exploration explored 100000 steps with 303 reset in 320 ms.
Product exploration explored 100000 steps with 303 reset in 351 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/78 stabilizing places and 1/114 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND p0 p2)), (X (NOT (AND p0 p2 p1))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2 (NOT p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 17 factoid took 512 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
RANDOM walk for 40000 steps (167 resets) in 229 ms. (173 steps per ms) remains 1/11 properties
BEST_FIRST walk for 40004 steps (16 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
[2024-05-31 23:48:53] [INFO ] Invariant cache hit.
[2024-05-31 23:48:53] [INFO ] State equation strengthened by 73 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 3/5 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 150/155 variables, 40/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 40/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 72/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/156 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/156 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 35/191 variables, 35/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/191 variables, 35/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/191 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/192 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/192 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/192 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 230 constraints, problems are : Problem set: 0 solved, 1 unsolved in 80 ms.
Refiners :[Domain max(s): 78/78 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 3/5 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 155/192 variables, and 44 constraints, problems are : Problem set: 1 solved, 0 unsolved in 34 ms.
Refiners :[Domain max(s): 2/78 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 42/78 constraints, ReadFeed: 0/73 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 132ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (AND p0 p2)), (X (NOT (AND p0 p2 p1))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2 (NOT p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (G (OR p0 p2))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (AND (OR p0 p2) (OR p0 (NOT p1))))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F p2), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F p1), (F (NOT (AND p0 (NOT p2)))), (F (NOT p0))]
Knowledge based reduction with 18 factoid took 864 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 78 /78 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-05-31 23:48:54] [INFO ] Invariant cache hit.
[2024-05-31 23:48:54] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-31 23:48:54] [INFO ] Invariant cache hit.
[2024-05-31 23:48:54] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 23:48:55] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-31 23:48:55] [INFO ] Invariant cache hit.
[2024-05-31 23:48:55] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 113/190 variables, 77/155 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 72/227 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 1/191 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 1/192 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/192 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 230 constraints, problems are : Problem set: 0 solved, 113 unsolved in 4433 ms.
Refiners :[Domain max(s): 78/78 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 113/190 variables, 77/155 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 72/227 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 113/340 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 1/191 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 1/192 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 12 (OVERLAPS) 0/192 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 343 constraints, problems are : Problem set: 0 solved, 113 unsolved in 5775 ms.
Refiners :[Domain max(s): 78/78 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 10303ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 10306ms
Finished structural reductions in LTL mode , in 1 iterations and 10458 ms. Remains : 78/78 places, 114/114 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/78 stabilizing places and 1/114 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p2)), (X (NOT (AND p0 p2 p1))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2 (NOT p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 18 factoid took 451 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
RANDOM walk for 8395 steps (38 resets) in 49 ms. (167 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p2)), (X (NOT (AND p0 p2 p1))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (NOT (AND p0 (NOT p2)))), (X (AND p0 p2 (NOT p1))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F p2), (F p1), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 18 factoid took 895 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Product exploration explored 100000 steps with 322 reset in 321 ms.
Product exploration explored 100000 steps with 321 reset in 325 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 114/114 transitions.
Applied a total of 0 rules in 5 ms. Remains 78 /78 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-05-31 23:49:08] [INFO ] Redundant transitions in 0 ms returned []
Running 113 sub problems to find dead transitions.
[2024-05-31 23:49:08] [INFO ] Invariant cache hit.
[2024-05-31 23:49:08] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 113/190 variables, 77/155 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 72/227 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 1/191 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 1/192 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/192 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 230 constraints, problems are : Problem set: 0 solved, 113 unsolved in 4397 ms.
Refiners :[Domain max(s): 78/78 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 113/190 variables, 77/155 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 72/227 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 113/340 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 1/191 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 1/192 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 12 (OVERLAPS) 0/192 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 343 constraints, problems are : Problem set: 0 solved, 113 unsolved in 5928 ms.
Refiners :[Domain max(s): 78/78 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 10426ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 10427ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10441 ms. Remains : 78/78 places, 114/114 transitions.
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 114/114 transitions.
Applied a total of 0 rules in 1 ms. Remains 78 /78 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-05-31 23:49:18] [INFO ] Invariant cache hit.
[2024-05-31 23:49:18] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-31 23:49:18] [INFO ] Invariant cache hit.
[2024-05-31 23:49:18] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-31 23:49:18] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2024-05-31 23:49:18] [INFO ] Invariant cache hit.
[2024-05-31 23:49:18] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 113/190 variables, 77/155 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 72/227 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 1/191 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 1/192 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/192 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 230 constraints, problems are : Problem set: 0 solved, 113 unsolved in 4198 ms.
Refiners :[Domain max(s): 78/78 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (OVERLAPS) 113/190 variables, 77/155 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 72/227 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 113/340 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 1/191 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 1/342 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 1/192 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 12 (OVERLAPS) 0/192 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 343 constraints, problems are : Problem set: 0 solved, 113 unsolved in 5895 ms.
Refiners :[Domain max(s): 78/78 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 78/78 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 0/0 constraints]
After SMT, in 10200ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 10203ms
Finished structural reductions in LTL mode , in 1 iterations and 10353 ms. Remains : 78/78 places, 114/114 transitions.
Treatment of property GPUForwardProgress-PT-36a-LTLFireability-09 finished in 48011 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)))'
[2024-05-31 23:49:29] [INFO ] Flatten gal took : 14 ms
[2024-05-31 23:49:29] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-31 23:49:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 152 places, 151 transitions and 665 arcs took 3 ms.
Total runtime 443824 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA GPUForwardProgress-PT-36a-LTLFireability-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : GPUForwardProgress-PT-36a-LTLFireability-13

BK_STOP 1717199882936

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name GPUForwardProgress-PT-36a-LTLFireability-09
ltl formula formula --ltl=/tmp/1828/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 152 places, 151 transitions and 665 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1828/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1828/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1828/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1828/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 154 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 153, there are 203 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~2293 levels ~10000 states ~120948 transitions
pnml2lts-mc( 2/ 4): ~592 levels ~20000 states ~121128 transitions
pnml2lts-mc( 2/ 4): ~748 levels ~40000 states ~236472 transitions
pnml2lts-mc( 0/ 4): ~18824 levels ~80000 states ~852372 transitions
pnml2lts-mc( 0/ 4): ~37603 levels ~160000 states ~1707740 transitions
pnml2lts-mc( 0/ 4): ~70076 levels ~320000 states ~3019616 transitions
pnml2lts-mc( 0/ 4): ~74188 levels ~640000 states ~4749036 transitions
pnml2lts-mc( 0/ 4): ~75037 levels ~1280000 states ~8450492 transitions
pnml2lts-mc( 0/ 4): ~86649 levels ~2560000 states ~16376336 transitions
pnml2lts-mc( 0/ 4): ~87912 levels ~5120000 states ~33409396 transitions
pnml2lts-mc( 0/ 4): ~123476 levels ~10240000 states ~68367212 transitions
pnml2lts-mc( 0/ 4): ~125671 levels ~20480000 states ~142626668 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 8580129
pnml2lts-mc( 0/ 4): unique states count: 27938415
pnml2lts-mc( 0/ 4): unique transitions count: 203626205
pnml2lts-mc( 0/ 4): - self-loop count: 9864199
pnml2lts-mc( 0/ 4): - claim dead count: 52898615
pnml2lts-mc( 0/ 4): - claim found count: 105518019
pnml2lts-mc( 0/ 4): - claim success count: 27938426
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1605745
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 27938426 states 203626433 transitions, fanout: 7.288
pnml2lts-mc( 0/ 4): Total exploration time 102.800 sec (102.780 sec minimum, 102.790 sec on average)
pnml2lts-mc( 0/ 4): States per second: 271775, Transitions per second: 1980802
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 260.1MB, 8.1 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/6.0%
pnml2lts-mc( 0/ 4): Stored 151 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 260.1MB (~256.0MB paged-in)
ltl formula name GPUForwardProgress-PT-36a-LTLFireability-13
ltl formula formula --ltl=/tmp/1828/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 152 places, 151 transitions and 665 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1828/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1828/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1828/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1828/ltl_1_

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="GPUForwardProgress-PT-36a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is GPUForwardProgress-PT-36a, 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 r496-tall-171640603800596"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-36a.tgz
mv GPUForwardProgress-PT-36a 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 ;