About the Execution of GreatSPN+red for GPUForwardProgress-PT-24b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 695.424 | 632749.00 | 750778.00 | 1755.30 | FFFTFFFFTFFFFTFF | normal |
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.r179-tall-171640601800556.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is GPUForwardProgress-PT-24b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601800556
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 22:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Apr 11 22:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 22:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 22:13 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 122K 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-24b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-24b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716479303110
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-24b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 15:48:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 15:48:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 15:48:24] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2024-05-23 15:48:24] [INFO ] Transformed 492 places.
[2024-05-23 15:48:24] [INFO ] Transformed 517 transitions.
[2024-05-23 15:48:24] [INFO ] Found NUPN structural information;
[2024-05-23 15:48:24] [INFO ] Parsed PT model containing 492 places and 517 transitions and 1277 arcs in 240 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 492 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 517/517 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 491 transition count 517
Discarding 49 places :
Symmetric choice reduction at 1 with 49 rule applications. Total rules 50 place count 442 transition count 468
Iterating global reduction 1 with 49 rules applied. Total rules applied 99 place count 442 transition count 468
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 120 place count 421 transition count 447
Iterating global reduction 1 with 21 rules applied. Total rules applied 141 place count 421 transition count 447
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 160 place count 421 transition count 428
Applied a total of 160 rules in 116 ms. Remains 421 /492 variables (removed 71) and now considering 428/517 (removed 89) transitions.
// Phase 1: matrix 428 rows 421 cols
[2024-05-23 15:48:24] [INFO ] Computed 25 invariants in 24 ms
[2024-05-23 15:48:25] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-05-23 15:48:25] [INFO ] Invariant cache hit.
[2024-05-23 15:48:25] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2024-05-23 15:48:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (OVERLAPS) 428/848 variables, 420/445 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/848 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (OVERLAPS) 1/849 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/849 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (OVERLAPS) 0/849 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 427 unsolved
No progress, stopping.
After SMT solving in domain Real declared 849/849 variables, and 446 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 421/421 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 427 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/420 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/420 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (OVERLAPS) 428/848 variables, 420/445 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/848 variables, 427/872 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/848 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 5 (OVERLAPS) 1/849 variables, 1/873 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/849 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 849/849 variables, and 873 constraints, problems are : Problem set: 0 solved, 427 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 421/421 constraints, PredecessorRefiner: 427/427 constraints, Known Traps: 0/0 constraints]
After SMT, in 60256ms problems are : Problem set: 0 solved, 427 unsolved
Search for dead transitions found 0 dead transitions in 60279ms
Starting structural reductions in LTL mode, iteration 1 : 421/492 places, 428/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61087 ms. Remains : 421/492 places, 428/517 transitions.
Support contains 28 out of 421 places after structural reductions.
[2024-05-23 15:49:26] [INFO ] Flatten gal took : 56 ms
[2024-05-23 15:49:26] [INFO ] Flatten gal took : 23 ms
[2024-05-23 15:49:26] [INFO ] Input system was already deterministic with 428 transitions.
RANDOM walk for 40000 steps (190 resets) in 2782 ms. (14 steps per ms) remains 5/24 properties
BEST_FIRST walk for 40004 steps (21 resets) in 137 ms. (289 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (21 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (20 resets) in 55 ms. (714 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (22 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (23 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
[2024-05-23 15:49:27] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 90/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 326/420 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 428/848 variables, 420/445 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/848 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/849 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/849 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/849 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 849/849 variables, and 446 constraints, problems are : Problem set: 0 solved, 4 unsolved in 345 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 421/421 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 90/94 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 326/420 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 428/848 variables, 420/445 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/848 variables, 4/449 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/848 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/849 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/849 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/849 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 849/849 variables, and 450 constraints, problems are : Problem set: 0 solved, 4 unsolved in 419 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 421/421 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 775ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 7829 steps, including 55 resets, run visited all 4 properties in 138 ms. (steps per millisecond=56 )
Parikh walk visited 4 properties in 145 ms.
Computed a total of 81 stabilizing places and 81 stable transitions
Graph (complete) has 653 edges and 421 vertex of which 393 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.17 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Graph (trivial) has 351 edges and 421 vertex of which 6 / 421 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 647 edges and 416 vertex of which 388 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.3 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 202 transitions
Trivial Post-agglo rules discarded 202 transitions
Performed 202 trivial Post agglomeration. Transition count delta: 202
Iterating post reduction 0 with 202 rules applied. Total rules applied 204 place count 387 transition count 216
Reduce places removed 202 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 210 rules applied. Total rules applied 414 place count 185 transition count 208
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 417 place count 182 transition count 208
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 417 place count 182 transition count 157
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 519 place count 131 transition count 157
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 543 place count 107 transition count 133
Iterating global reduction 3 with 24 rules applied. Total rules applied 567 place count 107 transition count 133
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 567 place count 107 transition count 132
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 569 place count 106 transition count 132
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 146 rules applied. Total rules applied 715 place count 33 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 716 place count 33 transition count 58
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 739 place count 10 transition count 13
Iterating global reduction 4 with 23 rules applied. Total rules applied 762 place count 10 transition count 13
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 4 with 2 rules applied. Total rules applied 764 place count 9 transition count 12
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 765 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 766 place count 8 transition count 11
Applied a total of 766 rules in 48 ms. Remains 8 /421 variables (removed 413) and now considering 11/428 (removed 417) transitions.
[2024-05-23 15:49:28] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
// Phase 1: matrix 10 rows 8 cols
[2024-05-23 15:49:28] [INFO ] Computed 0 invariants in 1 ms
[2024-05-23 15:49:28] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-23 15:49:28] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
[2024-05-23 15:49:28] [INFO ] Invariant cache hit.
[2024-05-23 15:49:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 15:49:28] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-23 15:49:28] [INFO ] Redundant transitions in 13 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-23 15:49:28] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
[2024-05-23 15:49:28] [INFO ] Invariant cache hit.
[2024-05-23 15:49:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/17 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/18 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 9 constraints, problems are : Problem set: 0 solved, 6 unsolved in 70 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 9/15 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/17 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/18 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 15 constraints, problems are : Problem set: 0 solved, 6 unsolved in 66 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 146ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 148ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/421 places, 11/428 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 265 ms. Remains : 8/421 places, 11/428 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-01
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-01 finished in 475 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)||F((p1||X((p2||X(F((p2&&F(p0))))))))))))'
Support contains 3 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 412 transition count 419
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 412 transition count 419
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 412 transition count 416
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 409 transition count 413
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 409 transition count 413
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 409 transition count 411
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 408 transition count 410
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 408 transition count 410
Applied a total of 31 rules in 54 ms. Remains 408 /421 variables (removed 13) and now considering 410/428 (removed 18) transitions.
// Phase 1: matrix 410 rows 408 cols
[2024-05-23 15:49:29] [INFO ] Computed 25 invariants in 8 ms
[2024-05-23 15:49:29] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-23 15:49:29] [INFO ] Invariant cache hit.
[2024-05-23 15:49:29] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2024-05-23 15:49:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 410/817 variables, 407/432 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/817 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 1/818 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/818 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 0/818 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 818/818 variables, and 433 constraints, problems are : Problem set: 0 solved, 409 unsolved in 28534 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 408/408 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 410/817 variables, 407/432 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/817 variables, 409/841 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/817 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 1/818 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/818 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (OVERLAPS) 0/818 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Int declared 818/818 variables, and 842 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 408/408 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints]
After SMT, in 58652ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 58657ms
Starting structural reductions in LTL mode, iteration 1 : 408/421 places, 410/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59083 ms. Remains : 408/421 places, 410/428 transitions.
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-03
Product exploration explored 100000 steps with 25000 reset in 284 ms.
Product exploration explored 100000 steps with 25000 reset in 146 ms.
Computed a total of 75 stabilizing places and 75 stable transitions
Graph (complete) has 635 edges and 408 vertex of which 380 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.6 ms
Computed a total of 75 stabilizing places and 75 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 5 states, 5 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (190 resets) in 386 ms. (103 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (22 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
[2024-05-23 15:50:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 358/407 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 410/817 variables, 407/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/817 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/818 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/818 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/818 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 818/818 variables, and 433 constraints, problems are : Problem set: 0 solved, 1 unsolved in 262 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 408/408 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 358/407 variables, 24/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 410/817 variables, 407/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/817 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/817 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/818 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/818 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/818 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 818/818 variables, and 434 constraints, problems are : Problem set: 0 solved, 1 unsolved in 202 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 408/408 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 489ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 101 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=101 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT (OR p0 p1 p2)))]
Knowledge based reduction with 2 factoid took 293 ms. Reduced automaton from 5 states, 5 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 3 out of 408 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 408/408 places, 410/410 transitions.
Applied a total of 0 rules in 11 ms. Remains 408 /408 variables (removed 0) and now considering 410/410 (removed 0) transitions.
[2024-05-23 15:50:30] [INFO ] Invariant cache hit.
[2024-05-23 15:50:30] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-23 15:50:30] [INFO ] Invariant cache hit.
[2024-05-23 15:50:30] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2024-05-23 15:50:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 410/817 variables, 407/432 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/817 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 1/818 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/818 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 0/818 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 818/818 variables, and 433 constraints, problems are : Problem set: 0 solved, 409 unsolved in 27747 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 408/408 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 410/817 variables, 407/432 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/817 variables, 409/841 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/817 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 1/818 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/818 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (OVERLAPS) 0/818 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Int declared 818/818 variables, and 842 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 408/408 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints]
After SMT, in 57857ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 57863ms
Finished structural reductions in LTL mode , in 1 iterations and 58210 ms. Remains : 408/408 places, 410/410 transitions.
Computed a total of 75 stabilizing places and 75 stable transitions
Graph (complete) has 635 edges and 408 vertex of which 380 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.4 ms
Computed a total of 75 stabilizing places and 75 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 5 states, 5 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
RANDOM walk for 36420 steps (171 resets) in 248 ms. (146 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT (OR p0 p1 p2)))]
Knowledge based reduction with 1 factoid took 188 ms. Reduced automaton from 5 states, 5 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 118 ms.
Product exploration explored 100000 steps with 25000 reset in 126 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 3 out of 408 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 408/408 places, 410/410 transitions.
Graph (trivial) has 328 edges and 408 vertex of which 6 / 408 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 629 edges and 403 vertex of which 375 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.4 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 192 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 192 rules applied. Total rules applied 194 place count 375 transition count 401
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 28 Pre rules applied. Total rules applied 194 place count 375 transition count 403
Deduced a syphon composed of 220 places in 1 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 222 place count 375 transition count 403
Discarding 143 places :
Symmetric choice reduction at 1 with 143 rule applications. Total rules 365 place count 232 transition count 260
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 1 with 143 rules applied. Total rules applied 508 place count 232 transition count 260
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 531 place count 209 transition count 237
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 554 place count 209 transition count 237
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 152 places in 0 ms
Iterating global reduction 1 with 75 rules applied. Total rules applied 629 place count 209 transition count 238
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 631 place count 209 transition count 236
Discarding 52 places :
Symmetric choice reduction at 2 with 52 rule applications. Total rules 683 place count 157 transition count 183
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 2 with 52 rules applied. Total rules applied 735 place count 157 transition count 183
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 736 place count 157 transition count 183
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 737 place count 156 transition count 182
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 738 place count 156 transition count 182
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: -65
Deduced a syphon composed of 122 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 760 place count 156 transition count 247
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 802 place count 114 transition count 163
Deduced a syphon composed of 100 places in 0 ms
Iterating global reduction 2 with 42 rules applied. Total rules applied 844 place count 114 transition count 163
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 904 place count 54 transition count 63
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 2 with 60 rules applied. Total rules applied 964 place count 54 transition count 63
Deduced a syphon composed of 40 places in 0 ms
Applied a total of 964 rules in 98 ms. Remains 54 /408 variables (removed 354) and now considering 63/410 (removed 347) transitions.
[2024-05-23 15:51:30] [INFO ] Redundant transitions in 13 ms returned []
Running 62 sub problems to find dead transitions.
// Phase 1: matrix 63 rows 54 cols
[2024-05-23 15:51:30] [INFO ] Computed 0 invariants in 2 ms
[2024-05-23 15:51:30] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 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 TDEAD25 is UNSAT
Problem TDEAD26 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 TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
At refinement iteration 1 (OVERLAPS) 62/115 variables, 53/53 constraints. Problems are: Problem set: 44 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 12/65 constraints. Problems are: Problem set: 44 solved, 18 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/65 constraints. Problems are: Problem set: 44 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 1/116 variables, 1/66 constraints. Problems are: Problem set: 44 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/66 constraints. Problems are: Problem set: 44 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 1/117 variables, 1/67 constraints. Problems are: Problem set: 44 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/67 constraints. Problems are: Problem set: 44 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/67 constraints. Problems are: Problem set: 44 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 67 constraints, problems are : Problem set: 44 solved, 18 unsolved in 405 ms.
Refiners :[State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 44 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 44 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 61/74 variables, 13/13 constraints. Problems are: Problem set: 44 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 12/25 constraints. Problems are: Problem set: 44 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 18/43 constraints. Problems are: Problem set: 44 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/43 constraints. Problems are: Problem set: 44 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 42/116 variables, 41/84 constraints. Problems are: Problem set: 44 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/84 constraints. Problems are: Problem set: 44 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1/117 variables, 1/85 constraints. Problems are: Problem set: 44 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/85 constraints. Problems are: Problem set: 44 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/117 variables, 0/85 constraints. Problems are: Problem set: 44 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 85 constraints, problems are : Problem set: 44 solved, 18 unsolved in 381 ms.
Refiners :[State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 18/62 constraints, Known Traps: 0/0 constraints]
After SMT, in 801ms problems are : Problem set: 44 solved, 18 unsolved
Search for dead transitions found 44 dead transitions in 803ms
Found 44 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 44 transitions
Dead transitions reduction (with SMT) removed 44 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 54/408 places, 19/410 transitions.
Graph (complete) has 47 edges and 54 vertex of which 14 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 14 /54 variables (removed 40) and now considering 19/19 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/408 places, 19/410 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 931 ms. Remains : 14/408 places, 19/410 transitions.
Support contains 3 out of 408 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 408/408 places, 410/410 transitions.
Applied a total of 0 rules in 11 ms. Remains 408 /408 variables (removed 0) and now considering 410/410 (removed 0) transitions.
// Phase 1: matrix 410 rows 408 cols
[2024-05-23 15:51:31] [INFO ] Computed 25 invariants in 6 ms
[2024-05-23 15:51:31] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-23 15:51:31] [INFO ] Invariant cache hit.
[2024-05-23 15:51:32] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2024-05-23 15:51:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 410/817 variables, 407/432 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/817 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 1/818 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/818 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 0/818 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 818/818 variables, and 433 constraints, problems are : Problem set: 0 solved, 409 unsolved in 27295 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 408/408 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 410/817 variables, 407/432 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/817 variables, 409/841 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/817 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 1/818 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/818 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (OVERLAPS) 0/818 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Int declared 818/818 variables, and 842 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 408/408 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints]
After SMT, in 57372ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 57378ms
Finished structural reductions in LTL mode , in 1 iterations and 57711 ms. Remains : 408/408 places, 410/410 transitions.
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-03 finished in 180311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0 U p1)||F(p2)))))'
Support contains 3 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Graph (trivial) has 347 edges and 421 vertex of which 6 / 421 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 647 edges and 416 vertex of which 388 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.4 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 0 with 198 rules applied. Total rules applied 200 place count 387 transition count 220
Reduce places removed 198 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 204 rules applied. Total rules applied 404 place count 189 transition count 214
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 406 place count 187 transition count 214
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 406 place count 187 transition count 162
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 510 place count 135 transition count 162
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 533 place count 112 transition count 139
Iterating global reduction 3 with 23 rules applied. Total rules applied 556 place count 112 transition count 139
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 704 place count 38 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 705 place count 38 transition count 64
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 727 place count 16 transition count 21
Iterating global reduction 4 with 22 rules applied. Total rules applied 749 place count 16 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 753 place count 14 transition count 20
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 755 place count 14 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 756 place count 13 transition count 19
Applied a total of 756 rules in 28 ms. Remains 13 /421 variables (removed 408) and now considering 19/428 (removed 409) transitions.
[2024-05-23 15:52:29] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
// Phase 1: matrix 18 rows 13 cols
[2024-05-23 15:52:29] [INFO ] Computed 0 invariants in 0 ms
[2024-05-23 15:52:29] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-23 15:52:29] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
[2024-05-23 15:52:29] [INFO ] Invariant cache hit.
[2024-05-23 15:52:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-23 15:52:29] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-23 15:52:29] [INFO ] Redundant transitions in 10 ms returned []
Running 17 sub problems to find dead transitions.
[2024-05-23 15:52:29] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
[2024-05-23 15:52:29] [INFO ] Invariant cache hit.
[2024-05-23 15:52:29] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 17/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/31 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/31 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 16 constraints, problems are : Problem set: 0 solved, 17 unsolved in 124 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 17/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 2/30 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/31 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/31 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/31 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 33 constraints, problems are : Problem set: 0 solved, 17 unsolved in 153 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 284ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 285ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/421 places, 19/428 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 373 ms. Remains : 13/421 places, 19/428 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-04
Stuttering criterion allowed to conclude after 26 steps with 1 reset in 1 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-04 finished in 520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||G(p2))))'
Support contains 3 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 413 transition count 420
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 413 transition count 420
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 413 transition count 417
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 411 transition count 415
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 411 transition count 415
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 411 transition count 414
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 410 transition count 413
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 410 transition count 413
Applied a total of 26 rules in 66 ms. Remains 410 /421 variables (removed 11) and now considering 413/428 (removed 15) transitions.
// Phase 1: matrix 413 rows 410 cols
[2024-05-23 15:52:30] [INFO ] Computed 25 invariants in 19 ms
[2024-05-23 15:52:30] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-23 15:52:30] [INFO ] Invariant cache hit.
[2024-05-23 15:52:30] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-05-23 15:52:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 413/822 variables, 409/434 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/822 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (OVERLAPS) 1/823 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/823 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (OVERLAPS) 0/823 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 412 unsolved
No progress, stopping.
After SMT solving in domain Real declared 823/823 variables, and 435 constraints, problems are : Problem set: 0 solved, 412 unsolved in 27935 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 413/822 variables, 409/434 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/822 variables, 412/846 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/822 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (OVERLAPS) 1/823 variables, 1/847 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (OVERLAPS) 0/823 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 412 unsolved
No progress, stopping.
After SMT solving in domain Int declared 823/823 variables, and 847 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints]
After SMT, in 58036ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 58044ms
Starting structural reductions in LTL mode, iteration 1 : 410/421 places, 413/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58483 ms. Remains : 410/421 places, 413/428 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-05
Entered a terminal (fully accepting) state of product in 10366 steps with 48 reset in 47 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-05 finished in 58735 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((F(G(p0)) U p1))))'
Support contains 4 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 413 transition count 420
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 413 transition count 420
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 413 transition count 417
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 411 transition count 415
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 411 transition count 415
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 411 transition count 414
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 410 transition count 413
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 410 transition count 413
Applied a total of 26 rules in 30 ms. Remains 410 /421 variables (removed 11) and now considering 413/428 (removed 15) transitions.
// Phase 1: matrix 413 rows 410 cols
[2024-05-23 15:53:28] [INFO ] Computed 25 invariants in 3 ms
[2024-05-23 15:53:28] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-23 15:53:28] [INFO ] Invariant cache hit.
[2024-05-23 15:53:29] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-05-23 15:53:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 413/822 variables, 409/434 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/822 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (OVERLAPS) 1/823 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/823 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (OVERLAPS) 0/823 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 412 unsolved
No progress, stopping.
After SMT solving in domain Real declared 823/823 variables, and 435 constraints, problems are : Problem set: 0 solved, 412 unsolved in 28885 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 413/822 variables, 409/434 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/822 variables, 412/846 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/822 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (OVERLAPS) 1/823 variables, 1/847 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (OVERLAPS) 0/823 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 412 unsolved
No progress, stopping.
After SMT solving in domain Int declared 823/823 variables, and 847 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints]
After SMT, in 58978ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 58981ms
Starting structural reductions in LTL mode, iteration 1 : 410/421 places, 413/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59356 ms. Remains : 410/421 places, 413/428 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-06
Stuttering criterion allowed to conclude after 223 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-06 finished in 59563 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Graph (trivial) has 351 edges and 421 vertex of which 6 / 421 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 647 edges and 416 vertex of which 388 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.3 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 202 place count 387 transition count 218
Reduce places removed 200 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 208 rules applied. Total rules applied 410 place count 187 transition count 210
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 414 place count 184 transition count 209
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 415 place count 183 transition count 209
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 51 Pre rules applied. Total rules applied 415 place count 183 transition count 158
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 517 place count 132 transition count 158
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 541 place count 108 transition count 134
Iterating global reduction 4 with 24 rules applied. Total rules applied 565 place count 108 transition count 134
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 565 place count 108 transition count 133
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 567 place count 107 transition count 133
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 715 place count 33 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 716 place count 33 transition count 58
Discarding 23 places :
Symmetric choice reduction at 5 with 23 rule applications. Total rules 739 place count 10 transition count 13
Iterating global reduction 5 with 23 rules applied. Total rules applied 762 place count 10 transition count 13
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 5 with 2 rules applied. Total rules applied 764 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 765 place count 8 transition count 11
Applied a total of 765 rules in 34 ms. Remains 8 /421 variables (removed 413) and now considering 11/428 (removed 417) transitions.
// Phase 1: matrix 11 rows 8 cols
[2024-05-23 15:54:28] [INFO ] Computed 0 invariants in 1 ms
[2024-05-23 15:54:28] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-23 15:54:28] [INFO ] Invariant cache hit.
[2024-05-23 15:54:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 15:54:28] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-23 15:54:28] [INFO ] Redundant transitions in 11 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-23 15:54:28] [INFO ] Invariant cache hit.
[2024-05-23 15:54:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/18 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/19 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 9 constraints, problems are : Problem set: 0 solved, 7 unsolved in 58 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/19 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 65 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 132ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 133ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/421 places, 11/428 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 242 ms. Remains : 8/421 places, 11/428 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-07
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-07 finished in 303 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&&F(p1)) U X(G((p2&&X(!p0))))))'
Support contains 3 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 413 transition count 420
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 413 transition count 420
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 413 transition count 417
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 410 transition count 414
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 410 transition count 414
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 27 place count 410 transition count 412
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 409 transition count 411
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 409 transition count 411
Applied a total of 29 rules in 31 ms. Remains 409 /421 variables (removed 12) and now considering 411/428 (removed 17) transitions.
// Phase 1: matrix 411 rows 409 cols
[2024-05-23 15:54:28] [INFO ] Computed 25 invariants in 2 ms
[2024-05-23 15:54:28] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-23 15:54:28] [INFO ] Invariant cache hit.
[2024-05-23 15:54:28] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Running 410 sub problems to find dead transitions.
[2024-05-23 15:54:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (OVERLAPS) 411/819 variables, 408/433 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/819 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 4 (OVERLAPS) 1/820 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/820 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 6 (OVERLAPS) 0/820 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 410 unsolved
No progress, stopping.
After SMT solving in domain Real declared 820/820 variables, and 434 constraints, problems are : Problem set: 0 solved, 410 unsolved in 29055 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 409/409 constraints, PredecessorRefiner: 410/410 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (OVERLAPS) 411/819 variables, 408/433 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/819 variables, 410/843 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/819 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 5 (OVERLAPS) 1/820 variables, 1/844 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/820 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 7 (OVERLAPS) 0/820 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 410 unsolved
No progress, stopping.
After SMT solving in domain Int declared 820/820 variables, and 844 constraints, problems are : Problem set: 0 solved, 410 unsolved in 30011 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 409/409 constraints, PredecessorRefiner: 410/410 constraints, Known Traps: 0/0 constraints]
After SMT, in 59155ms problems are : Problem set: 0 solved, 410 unsolved
Search for dead transitions found 0 dead transitions in 59161ms
Starting structural reductions in LTL mode, iteration 1 : 409/421 places, 411/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59521 ms. Remains : 409/421 places, 411/428 transitions.
Stuttering acceptance computed with spot in 368 ms :[(OR (NOT p2) p0), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (OR (NOT p2) p0), true, (AND p2 p0), (NOT p1), (AND (NOT p1) p2 p0), p0]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-09
Stuttering criterion allowed to conclude after 201 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-09 finished in 59917 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Graph (trivial) has 353 edges and 421 vertex of which 6 / 421 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 647 edges and 416 vertex of which 388 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 203 transitions
Trivial Post-agglo rules discarded 203 transitions
Performed 203 trivial Post agglomeration. Transition count delta: 203
Iterating post reduction 0 with 203 rules applied. Total rules applied 205 place count 387 transition count 215
Reduce places removed 203 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 211 rules applied. Total rules applied 416 place count 184 transition count 207
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 419 place count 181 transition count 207
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 419 place count 181 transition count 156
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 521 place count 130 transition count 156
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 545 place count 106 transition count 132
Iterating global reduction 3 with 24 rules applied. Total rules applied 569 place count 106 transition count 132
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 569 place count 106 transition count 131
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 571 place count 105 transition count 131
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 715 place count 33 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 716 place count 33 transition count 58
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 740 place count 9 transition count 11
Iterating global reduction 4 with 24 rules applied. Total rules applied 764 place count 9 transition count 11
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 4 with 2 rules applied. Total rules applied 766 place count 8 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 767 place count 7 transition count 9
Applied a total of 767 rules in 23 ms. Remains 7 /421 variables (removed 414) and now considering 9/428 (removed 419) transitions.
// Phase 1: matrix 9 rows 7 cols
[2024-05-23 15:55:28] [INFO ] Computed 0 invariants in 1 ms
[2024-05-23 15:55:28] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-23 15:55:28] [INFO ] Invariant cache hit.
[2024-05-23 15:55:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 15:55:28] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-23 15:55:28] [INFO ] Redundant transitions in 10 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-23 15:55:28] [INFO ] Invariant cache hit.
[2024-05-23 15:55:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 8 constraints, problems are : Problem set: 0 solved, 5 unsolved in 44 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/16 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 13 constraints, problems are : Problem set: 0 solved, 5 unsolved in 43 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 91ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 91ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/421 places, 9/428 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 180 ms. Remains : 7/421 places, 9/428 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-11
Stuttering criterion allowed to conclude after 6 steps with 1 reset in 1 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-11 finished in 274 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)||G(p1)))'
Support contains 2 out of 421 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Graph (trivial) has 349 edges and 421 vertex of which 6 / 421 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 647 edges and 416 vertex of which 388 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 200 rules applied. Total rules applied 202 place count 387 transition count 218
Reduce places removed 200 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 206 rules applied. Total rules applied 408 place count 187 transition count 212
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 410 place count 185 transition count 212
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 410 place count 185 transition count 160
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 514 place count 133 transition count 160
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 538 place count 109 transition count 136
Iterating global reduction 3 with 24 rules applied. Total rules applied 562 place count 109 transition count 136
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 562 place count 109 transition count 135
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 564 place count 108 transition count 135
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 708 place count 36 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 709 place count 36 transition count 62
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 732 place count 13 transition count 17
Iterating global reduction 4 with 23 rules applied. Total rules applied 755 place count 13 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 759 place count 11 transition count 16
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 761 place count 11 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 762 place count 10 transition count 15
Applied a total of 762 rules in 24 ms. Remains 10 /421 variables (removed 411) and now considering 15/428 (removed 413) transitions.
[2024-05-23 15:55:28] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
// Phase 1: matrix 14 rows 10 cols
[2024-05-23 15:55:28] [INFO ] Computed 0 invariants in 0 ms
[2024-05-23 15:55:28] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-23 15:55:28] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2024-05-23 15:55:28] [INFO ] Invariant cache hit.
[2024-05-23 15:55:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 15:55:28] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-23 15:55:28] [INFO ] Redundant transitions in 14 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-23 15:55:28] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2024-05-23 15:55:28] [INFO ] Invariant cache hit.
[2024-05-23 15:55:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 3/23 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/24 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 11 constraints, problems are : Problem set: 0 solved, 8 unsolved in 66 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 3/23 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 19 constraints, problems are : Problem set: 0 solved, 8 unsolved in 77 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 149ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 149ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/421 places, 15/428 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 246 ms. Remains : 10/421 places, 15/428 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-12
Stuttering criterion allowed to conclude after 6 steps with 1 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-12 finished in 343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||G(p1))))'
Support contains 2 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 412 transition count 419
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 412 transition count 419
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 412 transition count 416
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 409 transition count 413
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 409 transition count 413
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 409 transition count 411
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 408 transition count 410
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 408 transition count 410
Applied a total of 31 rules in 29 ms. Remains 408 /421 variables (removed 13) and now considering 410/428 (removed 18) transitions.
// Phase 1: matrix 410 rows 408 cols
[2024-05-23 15:55:29] [INFO ] Computed 25 invariants in 7 ms
[2024-05-23 15:55:29] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-23 15:55:29] [INFO ] Invariant cache hit.
[2024-05-23 15:55:29] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2024-05-23 15:55:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 410/817 variables, 407/432 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/817 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 1/818 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/818 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 0/818 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 818/818 variables, and 433 constraints, problems are : Problem set: 0 solved, 409 unsolved in 27753 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 408/408 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 410/817 variables, 407/432 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/817 variables, 409/841 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/817 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 1/818 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/818 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (OVERLAPS) 0/818 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Int declared 818/818 variables, and 842 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 408/408 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints]
After SMT, in 57867ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 57872ms
Starting structural reductions in LTL mode, iteration 1 : 408/421 places, 410/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58234 ms. Remains : 408/421 places, 410/428 transitions.
Stuttering acceptance computed with spot in 189 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-24b-LTLFireability-13
Product exploration explored 100000 steps with 33333 reset in 150 ms.
Product exploration explored 100000 steps with 33333 reset in 157 ms.
Computed a total of 75 stabilizing places and 75 stable transitions
Graph (complete) has 635 edges and 408 vertex of which 380 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.3 ms
Computed a total of 75 stabilizing places and 75 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 17 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-24b-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-13 finished in 58778 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)||(p1&&X(p1)))))'
Support contains 4 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 414 transition count 421
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 414 transition count 421
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 414 transition count 419
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 411 transition count 416
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 411 transition count 416
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 411 transition count 414
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 410 transition count 413
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 410 transition count 413
Applied a total of 26 rules in 28 ms. Remains 410 /421 variables (removed 11) and now considering 413/428 (removed 15) transitions.
// Phase 1: matrix 413 rows 410 cols
[2024-05-23 15:56:27] [INFO ] Computed 25 invariants in 5 ms
[2024-05-23 15:56:28] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-23 15:56:28] [INFO ] Invariant cache hit.
[2024-05-23 15:56:28] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-05-23 15:56:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 413/822 variables, 409/434 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/822 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (OVERLAPS) 1/823 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/823 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (OVERLAPS) 0/823 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 412 unsolved
No progress, stopping.
After SMT solving in domain Real declared 823/823 variables, and 435 constraints, problems are : Problem set: 0 solved, 412 unsolved in 28581 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 413/822 variables, 409/434 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/822 variables, 412/846 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/822 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (OVERLAPS) 1/823 variables, 1/847 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (OVERLAPS) 0/823 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 412 unsolved
No progress, stopping.
After SMT solving in domain Int declared 823/823 variables, and 847 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints]
After SMT, in 58677ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 58683ms
Starting structural reductions in LTL mode, iteration 1 : 410/421 places, 413/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59056 ms. Remains : 410/421 places, 413/428 transitions.
Stuttering acceptance computed with spot in 212 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-14 finished in 59287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 421/421 places, 428/428 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 412 transition count 419
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 412 transition count 419
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 412 transition count 416
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 409 transition count 413
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 409 transition count 413
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 409 transition count 411
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 408 transition count 410
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 408 transition count 410
Applied a total of 31 rules in 29 ms. Remains 408 /421 variables (removed 13) and now considering 410/428 (removed 18) transitions.
// Phase 1: matrix 410 rows 408 cols
[2024-05-23 15:57:27] [INFO ] Computed 25 invariants in 2 ms
[2024-05-23 15:57:27] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-23 15:57:27] [INFO ] Invariant cache hit.
[2024-05-23 15:57:27] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2024-05-23 15:57:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 410/817 variables, 407/432 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/817 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 1/818 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/818 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 0/818 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 818/818 variables, and 433 constraints, problems are : Problem set: 0 solved, 409 unsolved in 28580 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 408/408 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 410/817 variables, 407/432 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/817 variables, 409/841 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/817 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 1/818 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/818 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (OVERLAPS) 0/818 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Int declared 818/818 variables, and 842 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30010 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 408/408 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints]
After SMT, in 58683ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 58687ms
Starting structural reductions in LTL mode, iteration 1 : 408/421 places, 410/428 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59135 ms. Remains : 408/421 places, 410/428 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLFireability-15
Product exploration explored 100000 steps with 628 reset in 135 ms.
Product exploration explored 100000 steps with 637 reset in 152 ms.
Computed a total of 75 stabilizing places and 75 stable transitions
Graph (complete) has 635 edges and 408 vertex of which 380 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Computed a total of 75 stabilizing places and 75 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 607 steps (0 resets) in 4 ms. (121 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 133 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 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
[2024-05-23 15:58:27] [INFO ] Invariant cache hit.
[2024-05-23 15:58:27] [INFO ] [Real]Absence check using 0 positive and 25 generalized place invariants in 8 ms returned sat
[2024-05-23 15:58:27] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-05-23 15:58:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:58:27] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 8 ms returned sat
[2024-05-23 15:58:27] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2024-05-23 15:58:27] [INFO ] Computed and/alt/rep : 404/530/404 causal constraints (skipped 5 transitions) in 40 ms.
[2024-05-23 15:58:30] [INFO ] Added : 390 causal constraints over 78 iterations in 2550 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 408 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 408/408 places, 410/410 transitions.
Graph (trivial) has 333 edges and 408 vertex of which 6 / 408 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 629 edges and 403 vertex of which 375 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.6 ms
Discarding 28 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 191 transitions
Trivial Post-agglo rules discarded 191 transitions
Performed 191 trivial Post agglomeration. Transition count delta: 191
Iterating post reduction 0 with 191 rules applied. Total rules applied 193 place count 374 transition count 209
Reduce places removed 191 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 192 rules applied. Total rules applied 385 place count 183 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 386 place count 182 transition count 208
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 386 place count 182 transition count 156
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 490 place count 130 transition count 156
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 513 place count 107 transition count 133
Iterating global reduction 3 with 23 rules applied. Total rules applied 536 place count 107 transition count 133
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 684 place count 33 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 685 place count 33 transition count 58
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 708 place count 10 transition count 13
Iterating global reduction 4 with 23 rules applied. Total rules applied 731 place count 10 transition count 13
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 4 with 2 rules applied. Total rules applied 733 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 734 place count 8 transition count 11
Applied a total of 734 rules in 24 ms. Remains 8 /408 variables (removed 400) and now considering 11/410 (removed 399) transitions.
// Phase 1: matrix 11 rows 8 cols
[2024-05-23 15:58:30] [INFO ] Computed 0 invariants in 0 ms
[2024-05-23 15:58:30] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-23 15:58:30] [INFO ] Invariant cache hit.
[2024-05-23 15:58:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 15:58:30] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-05-23 15:58:30] [INFO ] Redundant transitions in 56 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-23 15:58:30] [INFO ] Invariant cache hit.
[2024-05-23 15:58:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/18 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/19 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 9 constraints, problems are : Problem set: 0 solved, 7 unsolved in 86 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/19 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 157 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 264ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 264ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/408 places, 11/410 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 453 ms. Remains : 8/408 places, 11/410 transitions.
Computed a total of 2 stabilizing places and 4 stable transitions
Computed a total of 2 stabilizing places and 4 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 274 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 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 9 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 170 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 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
[2024-05-23 15:58:31] [INFO ] Invariant cache hit.
[2024-05-23 15:58:31] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-23 15:58:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 15:58:31] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-23 15:58:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 15:58:31] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-23 15:58:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-23 15:58:31] [INFO ] Computed and/alt/rep : 7/15/7 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-23 15:58:31] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLFireability-15 finished in 64504 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)||F((p1||X((p2||X(F((p2&&F(p0))))))))))))'
[2024-05-23 15:58:31] [INFO ] Flatten gal took : 35 ms
[2024-05-23 15:58:31] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-23 15:58:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 421 places, 428 transitions and 1097 arcs took 4 ms.
Total runtime 607598 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running GPUForwardProgress-PT-24b
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 421
TRANSITIONS: 428
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.000s]
SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1372
MODEL NAME: /home/mcc/execution/411/model
421 places, 428 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA GPUForwardProgress-PT-24b-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716479935859
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPUForwardProgress-PT-24b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is GPUForwardProgress-PT-24b, 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 r179-tall-171640601800556"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-24b.tgz
mv GPUForwardProgress-PT-24b 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 '
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 ;