About the Execution of ITS-Tools for GPUForwardProgress-PT-32b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 973.804 | 851787.00 | 1033758.00 | 2392.30 | FFFFFFFFTFFTFTFF | 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.r180-tall-171640603800588.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is GPUForwardProgress-PT-32b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640603800588
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 22:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 11 22:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 11 22:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 11 22:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 160K 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-32b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-32b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716512659194
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-32b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-24 01:04:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 01:04:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 01:04:20] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-05-24 01:04:20] [INFO ] Transformed 644 places.
[2024-05-24 01:04:20] [INFO ] Transformed 677 transitions.
[2024-05-24 01:04:20] [INFO ] Found NUPN structural information;
[2024-05-24 01:04:20] [INFO ] Parsed PT model containing 644 places and 677 transitions and 1677 arcs in 201 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 3 formulas.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 644 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 644/644 places, 677/677 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 643 transition count 677
Discarding 62 places :
Symmetric choice reduction at 1 with 62 rule applications. Total rules 63 place count 581 transition count 615
Iterating global reduction 1 with 62 rules applied. Total rules applied 125 place count 581 transition count 615
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 153 place count 553 transition count 587
Iterating global reduction 1 with 28 rules applied. Total rules applied 181 place count 553 transition count 587
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 206 place count 553 transition count 562
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 207 place count 552 transition count 561
Iterating global reduction 2 with 1 rules applied. Total rules applied 208 place count 552 transition count 561
Applied a total of 208 rules in 152 ms. Remains 552 /644 variables (removed 92) and now considering 561/677 (removed 116) transitions.
// Phase 1: matrix 561 rows 552 cols
[2024-05-24 01:04:21] [INFO ] Computed 33 invariants in 22 ms
[2024-05-24 01:04:21] [INFO ] Implicit Places using invariants in 456 ms returned []
[2024-05-24 01:04:21] [INFO ] Invariant cache hit.
[2024-05-24 01:04:21] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 830 ms to find 0 implicit places.
Running 560 sub problems to find dead transitions.
[2024-05-24 01:04:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/551 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/551 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 2 (OVERLAPS) 561/1112 variables, 551/584 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1112 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 4 (OVERLAPS) 1/1113 variables, 1/585 constraints. Problems are: Problem set: 0 solved, 560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1113/1113 variables, and 585 constraints, problems are : Problem set: 0 solved, 560 unsolved in 30037 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 552/552 constraints, PredecessorRefiner: 560/560 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 560 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/551 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/551 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 2 (OVERLAPS) 561/1112 variables, 551/584 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1112 variables, 560/1144 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1112 variables, 0/1144 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 5 (OVERLAPS) 1/1113 variables, 1/1145 constraints. Problems are: Problem set: 0 solved, 560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1113/1113 variables, and 1145 constraints, problems are : Problem set: 0 solved, 560 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 552/552 constraints, PredecessorRefiner: 560/560 constraints, Known Traps: 0/0 constraints]
After SMT, in 60289ms problems are : Problem set: 0 solved, 560 unsolved
Search for dead transitions found 0 dead transitions in 60308ms
Starting structural reductions in LTL mode, iteration 1 : 552/644 places, 561/677 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61322 ms. Remains : 552/644 places, 561/677 transitions.
Support contains 28 out of 552 places after structural reductions.
[2024-05-24 01:05:22] [INFO ] Flatten gal took : 59 ms
[2024-05-24 01:05:22] [INFO ] Flatten gal took : 27 ms
[2024-05-24 01:05:22] [INFO ] Input system was already deterministic with 561 transitions.
RANDOM walk for 40000 steps (145 resets) in 2553 ms. (15 steps per ms) remains 8/26 properties
BEST_FIRST walk for 40004 steps (14 resets) in 125 ms. (317 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (14 resets) in 115 ms. (344 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (14 resets) in 59 ms. (666 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (15 resets) in 193 ms. (206 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (14 resets) in 92 ms. (430 steps per ms) remains 5/5 properties
[2024-05-24 01:05:23] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 542/551 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/551 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 561/1112 variables, 551/584 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1112 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/1113 variables, 1/585 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1113 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/1113 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1113/1113 variables, and 585 constraints, problems are : Problem set: 0 solved, 5 unsolved in 518 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 552/552 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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 542/551 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/551 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 561/1112 variables, 551/584 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1112 variables, 5/589 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1112 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/1113 variables, 1/590 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1113 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/1113 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1113/1113 variables, and 590 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1476 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 552/552 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 2009ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 475 steps, including 0 resets, run visited all 5 properties in 13 ms. (steps per millisecond=36 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 23 ms.
Computed a total of 102 stabilizing places and 102 stable transitions
Graph (complete) has 858 edges and 552 vertex of which 516 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.20 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)||G(p1))))'
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Graph (trivial) has 456 edges and 552 vertex of which 6 / 552 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 852 edges and 547 vertex of which 511 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.3 ms
Discarding 36 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 269 transitions
Trivial Post-agglo rules discarded 269 transitions
Performed 269 trivial Post agglomeration. Transition count delta: 269
Iterating post reduction 0 with 269 rules applied. Total rules applied 271 place count 510 transition count 282
Reduce places removed 269 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 276 rules applied. Total rules applied 547 place count 241 transition count 275
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 549 place count 240 transition count 274
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 550 place count 239 transition count 274
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 67 Pre rules applied. Total rules applied 550 place count 239 transition count 207
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 684 place count 172 transition count 207
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 716 place count 140 transition count 175
Iterating global reduction 4 with 32 rules applied. Total rules applied 748 place count 140 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 749 place count 140 transition count 174
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 749 place count 140 transition count 173
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 751 place count 139 transition count 173
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 5 with 192 rules applied. Total rules applied 943 place count 43 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 944 place count 43 transition count 76
Discarding 31 places :
Symmetric choice reduction at 6 with 31 rule applications. Total rules 975 place count 12 transition count 15
Iterating global reduction 6 with 31 rules applied. Total rules applied 1006 place count 12 transition count 15
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 6 with 2 rules applied. Total rules applied 1008 place count 11 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1009 place count 10 transition count 13
Applied a total of 1009 rules in 63 ms. Remains 10 /552 variables (removed 542) and now considering 13/561 (removed 548) transitions.
// Phase 1: matrix 13 rows 10 cols
[2024-05-24 01:05:26] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 01:05:26] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-24 01:05:26] [INFO ] Invariant cache hit.
[2024-05-24 01:05:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 01:05:26] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2024-05-24 01:05:26] [INFO ] Redundant transitions in 14 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-24 01:05:26] [INFO ] Invariant cache hit.
[2024-05-24 01:05:26] [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) 12/19 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 3/22 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/23 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 11 constraints, problems are : Problem set: 0 solved, 8 unsolved in 187 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) 12/19 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 3/22 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/23 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/23 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 19 constraints, problems are : Problem set: 0 solved, 8 unsolved in 276 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 468ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 469ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/552 places, 13/561 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 702 ms. Remains : 10/552 places, 13/561 transitions.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-00
Stuttering criterion allowed to conclude after 253 steps with 22 reset in 5 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-00 finished in 909 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)))&&F((p1&&X((p1 U (p2||G(p1))))))))'
Support contains 3 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 543 transition count 552
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 543 transition count 552
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 537 transition count 546
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 537 transition count 546
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 36 place count 537 transition count 540
Applied a total of 36 rules in 69 ms. Remains 537 /552 variables (removed 15) and now considering 540/561 (removed 21) transitions.
// Phase 1: matrix 540 rows 537 cols
[2024-05-24 01:05:26] [INFO ] Computed 33 invariants in 5 ms
[2024-05-24 01:05:27] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-24 01:05:27] [INFO ] Invariant cache hit.
[2024-05-24 01:05:27] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
Running 539 sub problems to find dead transitions.
[2024-05-24 01:05:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 2 (OVERLAPS) 540/1076 variables, 536/569 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1076 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 4 (OVERLAPS) 1/1077 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 539 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1077/1077 variables, and 570 constraints, problems are : Problem set: 0 solved, 539 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 537/537 constraints, PredecessorRefiner: 539/539 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 539 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 2 (OVERLAPS) 540/1076 variables, 536/569 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1076 variables, 539/1108 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1076 variables, 0/1108 constraints. Problems are: Problem set: 0 solved, 539 unsolved
At refinement iteration 5 (OVERLAPS) 1/1077 variables, 1/1109 constraints. Problems are: Problem set: 0 solved, 539 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1077/1077 variables, and 1109 constraints, problems are : Problem set: 0 solved, 539 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 537/537 constraints, PredecessorRefiner: 539/539 constraints, Known Traps: 0/0 constraints]
After SMT, in 60305ms problems are : Problem set: 0 solved, 539 unsolved
Search for dead transitions found 0 dead transitions in 60312ms
Starting structural reductions in LTL mode, iteration 1 : 537/552 places, 540/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60872 ms. Remains : 537/552 places, 540/561 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-01
Stuttering criterion allowed to conclude after 265 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-01 finished in 61069 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 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Graph (trivial) has 460 edges and 552 vertex of which 6 / 552 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 852 edges and 547 vertex of which 511 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.2 ms
Discarding 36 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 271 transitions
Trivial Post-agglo rules discarded 271 transitions
Performed 271 trivial Post agglomeration. Transition count delta: 271
Iterating post reduction 0 with 271 rules applied. Total rules applied 273 place count 510 transition count 280
Reduce places removed 271 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 279 rules applied. Total rules applied 552 place count 239 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 553 place count 238 transition count 272
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 553 place count 238 transition count 204
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 689 place count 170 transition count 204
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 720 place count 139 transition count 173
Iterating global reduction 3 with 31 rules applied. Total rules applied 751 place count 139 transition count 173
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 947 place count 41 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 948 place count 41 transition count 74
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 979 place count 10 transition count 13
Iterating global reduction 4 with 31 rules applied. Total rules applied 1010 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 1012 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 1013 place count 8 transition count 11
Applied a total of 1013 rules in 43 ms. Remains 8 /552 variables (removed 544) and now considering 11/561 (removed 550) transitions.
// Phase 1: matrix 11 rows 8 cols
[2024-05-24 01:06:28] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 01:06:28] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-24 01:06:28] [INFO ] Invariant cache hit.
[2024-05-24 01:06:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 01:06:28] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-05-24 01:06:28] [INFO ] Redundant transitions in 10 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-24 01:06:28] [INFO ] Invariant cache hit.
[2024-05-24 01:06: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 52 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 67 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 131ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 132ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/552 places, 11/561 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 360 ms. Remains : 8/552 places, 11/561 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-02
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-02 finished in 410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 542 transition count 551
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 542 transition count 551
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 542 transition count 550
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 536 transition count 544
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 536 transition count 544
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 39 place count 536 transition count 538
Applied a total of 39 rules in 36 ms. Remains 536 /552 variables (removed 16) and now considering 538/561 (removed 23) transitions.
// Phase 1: matrix 538 rows 536 cols
[2024-05-24 01:06:28] [INFO ] Computed 33 invariants in 5 ms
[2024-05-24 01:06:28] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-24 01:06:28] [INFO ] Invariant cache hit.
[2024-05-24 01:06:28] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Running 537 sub problems to find dead transitions.
[2024-05-24 01:06:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1073 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 4 (OVERLAPS) 1/1074 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1074/1074 variables, and 569 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 537 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1073 variables, 537/1105 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1073 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 5 (OVERLAPS) 1/1074 variables, 1/1106 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1074/1074 variables, and 1106 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints]
After SMT, in 60160ms problems are : Problem set: 0 solved, 537 unsolved
Search for dead transitions found 0 dead transitions in 60165ms
Starting structural reductions in LTL mode, iteration 1 : 536/552 places, 538/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60721 ms. Remains : 536/552 places, 538/561 transitions.
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 11170 steps with 39 reset in 33 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-03 finished in 60998 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0)) U p1))))'
Support contains 4 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 543 transition count 552
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 543 transition count 552
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 543 transition count 551
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 25 place count 537 transition count 545
Iterating global reduction 1 with 6 rules applied. Total rules applied 31 place count 537 transition count 545
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 37 place count 537 transition count 539
Applied a total of 37 rules in 25 ms. Remains 537 /552 variables (removed 15) and now considering 539/561 (removed 22) transitions.
// Phase 1: matrix 539 rows 537 cols
[2024-05-24 01:07:29] [INFO ] Computed 33 invariants in 2 ms
[2024-05-24 01:07:29] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-24 01:07:29] [INFO ] Invariant cache hit.
[2024-05-24 01:07:30] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
Running 538 sub problems to find dead transitions.
[2024-05-24 01:07:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 2 (OVERLAPS) 539/1075 variables, 536/569 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1075 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 4 (OVERLAPS) 1/1076 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 538 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1076/1076 variables, and 570 constraints, problems are : Problem set: 0 solved, 538 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 537/537 constraints, PredecessorRefiner: 538/538 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 538 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/536 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/536 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 2 (OVERLAPS) 539/1075 variables, 536/569 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1075 variables, 538/1107 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1075 variables, 0/1107 constraints. Problems are: Problem set: 0 solved, 538 unsolved
At refinement iteration 5 (OVERLAPS) 1/1076 variables, 1/1108 constraints. Problems are: Problem set: 0 solved, 538 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1076/1076 variables, and 1108 constraints, problems are : Problem set: 0 solved, 538 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 537/537 constraints, PredecessorRefiner: 538/538 constraints, Known Traps: 0/0 constraints]
After SMT, in 60155ms problems are : Problem set: 0 solved, 538 unsolved
Search for dead transitions found 0 dead transitions in 60160ms
Starting structural reductions in LTL mode, iteration 1 : 537/552 places, 539/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60798 ms. Remains : 537/552 places, 539/561 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-05
Product exploration explored 100000 steps with 1310 reset in 208 ms.
Product exploration explored 100000 steps with 1319 reset in 266 ms.
Computed a total of 100 stabilizing places and 100 stable transitions
Graph (complete) has 836 edges and 537 vertex of which 501 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.6 ms
Computed a total of 100 stabilizing places and 100 stable transitions
Detected a total of 100/537 stabilizing places and 100/539 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 104 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 40000 steps (146 resets) in 228 ms. (174 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 1/1 properties
[2024-05-24 01:08:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 532/536 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/536 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 539/1075 variables, 536/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1075 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/1076 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1076 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1076 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1076/1076 variables, and 570 constraints, problems are : Problem set: 0 solved, 1 unsolved in 298 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 537/537 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 532/536 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/536 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 539/1075 variables, 536/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1075 variables, 1/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1075 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/1076 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1076 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1076 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1076/1076 variables, and 571 constraints, problems are : Problem set: 0 solved, 1 unsolved in 338 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 537/537 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 649ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 243 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=121 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0)]
Knowledge based reduction with 5 factoid took 224 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p0)]
[2024-05-24 01:08:32] [INFO ] Invariant cache hit.
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 5 factoid took 212 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-32b-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-05 finished in 63748 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)))'
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 543 transition count 552
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 543 transition count 552
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 543 transition count 551
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 538 transition count 546
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 538 transition count 546
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 34 place count 538 transition count 541
Applied a total of 34 rules in 29 ms. Remains 538 /552 variables (removed 14) and now considering 541/561 (removed 20) transitions.
// Phase 1: matrix 541 rows 538 cols
[2024-05-24 01:08:33] [INFO ] Computed 33 invariants in 13 ms
[2024-05-24 01:08:33] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-24 01:08:33] [INFO ] Invariant cache hit.
[2024-05-24 01:08:33] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
Running 540 sub problems to find dead transitions.
[2024-05-24 01:08:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1078 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (OVERLAPS) 1/1079 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1079/1079 variables, and 571 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1078 variables, 540/1110 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1078 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 5 (OVERLAPS) 1/1079 variables, 1/1111 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1079/1079 variables, and 1111 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
After SMT, in 60159ms problems are : Problem set: 0 solved, 540 unsolved
Search for dead transitions found 0 dead transitions in 60166ms
Starting structural reductions in LTL mode, iteration 1 : 538/552 places, 541/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60692 ms. Remains : 538/552 places, 541/561 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-06
Product exploration explored 100000 steps with 369 reset in 179 ms.
Entered a terminal (fully accepting) state of product in 44296 steps with 160 reset in 92 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-06 finished in 61075 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)&&F(p1)))'
Support contains 1 out of 552 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Graph (trivial) has 460 edges and 552 vertex of which 6 / 552 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 852 edges and 547 vertex of which 511 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.4 ms
Discarding 36 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 271 transitions
Trivial Post-agglo rules discarded 271 transitions
Performed 271 trivial Post agglomeration. Transition count delta: 271
Iterating post reduction 0 with 271 rules applied. Total rules applied 273 place count 510 transition count 280
Reduce places removed 271 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 279 rules applied. Total rules applied 552 place count 239 transition count 272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 553 place count 238 transition count 272
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 553 place count 238 transition count 204
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 689 place count 170 transition count 204
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 720 place count 139 transition count 173
Iterating global reduction 3 with 31 rules applied. Total rules applied 751 place count 139 transition count 173
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 947 place count 41 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 948 place count 41 transition count 74
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 979 place count 10 transition count 13
Iterating global reduction 4 with 31 rules applied. Total rules applied 1010 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 1012 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 1013 place count 8 transition count 11
Applied a total of 1013 rules in 26 ms. Remains 8 /552 variables (removed 544) and now considering 11/561 (removed 550) transitions.
// Phase 1: matrix 11 rows 8 cols
[2024-05-24 01:09:34] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 01:09:34] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 01:09:34] [INFO ] Invariant cache hit.
[2024-05-24 01:09:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 01:09:34] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-24 01:09:34] [INFO ] Redundant transitions in 11 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-24 01:09:34] [INFO ] Invariant cache hit.
[2024-05-24 01:09:34] [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 53 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 59 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 119ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 119ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/552 places, 11/561 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 205 ms. Remains : 8/552 places, 11/561 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-07
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-07 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||X(F(p1)))))))'
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 544 transition count 553
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 544 transition count 553
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 544 transition count 552
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 539 transition count 547
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 539 transition count 547
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 32 place count 539 transition count 542
Applied a total of 32 rules in 31 ms. Remains 539 /552 variables (removed 13) and now considering 542/561 (removed 19) transitions.
// Phase 1: matrix 542 rows 539 cols
[2024-05-24 01:09:34] [INFO ] Computed 33 invariants in 5 ms
[2024-05-24 01:09:34] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-24 01:09:34] [INFO ] Invariant cache hit.
[2024-05-24 01:09:35] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Running 541 sub problems to find dead transitions.
[2024-05-24 01:09:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (OVERLAPS) 542/1080 variables, 538/571 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1080 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (OVERLAPS) 1/1081 variables, 1/572 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1081/1081 variables, and 572 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30011 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 539/539 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 541 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (OVERLAPS) 542/1080 variables, 538/571 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1080 variables, 541/1112 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1080 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 5 (OVERLAPS) 1/1081 variables, 1/1113 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1081/1081 variables, and 1113 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 539/539 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 0/0 constraints]
After SMT, in 60135ms problems are : Problem set: 0 solved, 541 unsolved
Search for dead transitions found 0 dead transitions in 60145ms
Starting structural reductions in LTL mode, iteration 1 : 539/552 places, 542/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60631 ms. Remains : 539/552 places, 542/561 transitions.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-09
Stuttering criterion allowed to conclude after 265 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-09 finished in 60818 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||F(p1)))&&(X(!p0) U ((!p1&&X(!p0))||X(G(!p0))))))'
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 543 transition count 552
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 543 transition count 552
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 543 transition count 551
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 538 transition count 546
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 538 transition count 546
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 34 place count 538 transition count 541
Applied a total of 34 rules in 27 ms. Remains 538 /552 variables (removed 14) and now considering 541/561 (removed 20) transitions.
// Phase 1: matrix 541 rows 538 cols
[2024-05-24 01:10:35] [INFO ] Computed 33 invariants in 4 ms
[2024-05-24 01:10:35] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-24 01:10:35] [INFO ] Invariant cache hit.
[2024-05-24 01:10:35] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Running 540 sub problems to find dead transitions.
[2024-05-24 01:10:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1078 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (OVERLAPS) 1/1079 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1079/1079 variables, and 571 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1078 variables, 540/1110 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1078 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 5 (OVERLAPS) 1/1079 variables, 1/1111 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1079/1079 variables, and 1111 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
After SMT, in 60134ms problems are : Problem set: 0 solved, 540 unsolved
Search for dead transitions found 0 dead transitions in 60142ms
Starting structural reductions in LTL mode, iteration 1 : 538/552 places, 541/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60624 ms. Remains : 538/552 places, 541/561 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p1) p0), (AND (NOT p1) (NOT p0)), p0, p0, (NOT p1), true]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-10
Product exploration explored 100000 steps with 1040 reset in 149 ms.
Product exploration explored 100000 steps with 1131 reset in 165 ms.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 838 edges and 538 vertex of which 502 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.14 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 92 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 694 steps (0 resets) in 6 ms. (99 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 10 factoid took 156 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-05-24 01:11:37] [INFO ] Invariant cache hit.
[2024-05-24 01:11:37] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 10 ms returned sat
[2024-05-24 01:11:37] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2024-05-24 01:11:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 01:11:37] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 11 ms returned sat
[2024-05-24 01:11:38] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2024-05-24 01:11:38] [INFO ] Computed and/alt/rep : 535/703/535 causal constraints (skipped 5 transitions) in 30 ms.
[2024-05-24 01:11:42] [INFO ] Added : 511 causal constraints over 103 iterations in 4303 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 538 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 541/541 transitions.
Applied a total of 0 rules in 8 ms. Remains 538 /538 variables (removed 0) and now considering 541/541 (removed 0) transitions.
[2024-05-24 01:11:42] [INFO ] Invariant cache hit.
[2024-05-24 01:11:42] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-24 01:11:42] [INFO ] Invariant cache hit.
[2024-05-24 01:11:43] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
Running 540 sub problems to find dead transitions.
[2024-05-24 01:11:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1078 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (OVERLAPS) 1/1079 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)timeout
(s160 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1079/1079 variables, and 571 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30011 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1078 variables, 540/1110 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1078 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 5 (OVERLAPS) 1/1079 variables, 1/1111 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1079/1079 variables, and 1111 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
After SMT, in 60140ms problems are : Problem set: 0 solved, 540 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
Finished structural reductions in LTL mode , in 1 iterations and 60812 ms. Remains : 538/538 places, 541/541 transitions.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 838 edges and 538 vertex of which 502 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.6 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 753 steps (0 resets) in 6 ms. (107 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 127 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2024-05-24 01:12:43] [INFO ] Invariant cache hit.
[2024-05-24 01:12:44] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 11 ms returned sat
[2024-05-24 01:12:44] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2024-05-24 01:12:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 01:12:44] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 11 ms returned sat
[2024-05-24 01:12:44] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2024-05-24 01:12:44] [INFO ] Computed and/alt/rep : 535/703/535 causal constraints (skipped 5 transitions) in 32 ms.
[2024-05-24 01:12:48] [INFO ] Added : 511 causal constraints over 103 iterations in 4149 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 549 reset in 140 ms.
Stack based approach found an accepted trace after 98969 steps with 544 reset with depth 111 and stack size 111 in 153 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-10 finished in 134042 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))||(F(!p0)&&X(F(!p1)))))'
Support contains 4 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 543 transition count 552
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 543 transition count 552
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 543 transition count 551
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 538 transition count 546
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 538 transition count 546
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 34 place count 538 transition count 541
Applied a total of 34 rules in 34 ms. Remains 538 /552 variables (removed 14) and now considering 541/561 (removed 20) transitions.
// Phase 1: matrix 541 rows 538 cols
[2024-05-24 01:12:49] [INFO ] Computed 33 invariants in 2 ms
[2024-05-24 01:12:49] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-24 01:12:49] [INFO ] Invariant cache hit.
[2024-05-24 01:12:49] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
Running 540 sub problems to find dead transitions.
[2024-05-24 01:12:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1078 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (OVERLAPS) 1/1079 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1079/1079 variables, and 571 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1078 variables, 540/1110 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1078 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 5 (OVERLAPS) 1/1079 variables, 1/1111 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1079/1079 variables, and 1111 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
After SMT, in 60147ms problems are : Problem set: 0 solved, 540 unsolved
Search for dead transitions found 0 dead transitions in 60152ms
Starting structural reductions in LTL mode, iteration 1 : 538/552 places, 541/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60687 ms. Remains : 538/552 places, 541/561 transitions.
Stuttering acceptance computed with spot in 139 ms :[p0, p0, (AND p1 p0), (AND p0 p1)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-11
Product exploration explored 100000 steps with 371 reset in 245 ms.
Product exploration explored 100000 steps with 373 reset in 307 ms.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 838 edges and 538 vertex of which 502 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.6 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 92 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 251 ms :[(AND p0 p1), (AND p1 p0), (AND p0 p1), false, false]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (147 resets) in 316 ms. (126 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (16 resets) in 220 ms. (181 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
[2024-05-24 01:13:51] [INFO ] Invariant cache hit.
Problem apf1 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 533/537 variables, 33/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1078 variables, 0/570 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/1079 variables, 1/571 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1079 variables, 0/571 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1079 variables, 0/571 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1079/1079 variables, and 571 constraints, problems are : Problem set: 1 solved, 1 unsolved in 245 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 533/537 variables, 33/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1078 variables, 1/571 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1078 variables, 0/571 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/1079 variables, 1/572 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1079 variables, 0/572 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1079 variables, 0/572 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1079/1079 variables, and 572 constraints, problems are : Problem set: 1 solved, 1 unsolved in 422 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 677ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 158 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=52 )
Parikh walk visited 1 properties in 2 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 223 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 211 ms :[p0, p0, p0, false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 224 ms :[p0, p0, p0, false, (AND (NOT p1) p0)]
Support contains 4 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 541/541 transitions.
Graph (trivial) has 436 edges and 538 vertex of which 6 / 538 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 832 edges and 533 vertex of which 497 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.4 ms
Discarding 36 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 257 transitions
Trivial Post-agglo rules discarded 257 transitions
Performed 257 trivial Post agglomeration. Transition count delta: 257
Iterating post reduction 0 with 257 rules applied. Total rules applied 259 place count 496 transition count 274
Reduce places removed 257 places and 0 transitions.
Iterating post reduction 1 with 257 rules applied. Total rules applied 516 place count 239 transition count 274
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 516 place count 239 transition count 209
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 646 place count 174 transition count 209
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 677 place count 143 transition count 178
Iterating global reduction 2 with 31 rules applied. Total rules applied 708 place count 143 transition count 178
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 196 rules applied. Total rules applied 904 place count 45 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 905 place count 45 transition count 79
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 935 place count 15 transition count 20
Iterating global reduction 3 with 30 rules applied. Total rules applied 965 place count 15 transition count 20
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 3 with 4 rules applied. Total rules applied 969 place count 13 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 970 place count 12 transition count 18
Applied a total of 970 rules in 24 ms. Remains 12 /538 variables (removed 526) and now considering 18/541 (removed 523) transitions.
[2024-05-24 01:13:52] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
// Phase 1: matrix 17 rows 12 cols
[2024-05-24 01:13:52] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 01:13:52] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-24 01:13:52] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-24 01:13:52] [INFO ] Invariant cache hit.
[2024-05-24 01:13:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 01:13:52] [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-24 01:13:52] [INFO ] Redundant transitions in 11 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-24 01:13:52] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-24 01:13:52] [INFO ] Invariant cache hit.
[2024-05-24 01:13:52] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 16/25 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 3/28 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 1/29 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/29 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/29 variables, and 13 constraints, problems are : Problem set: 0 solved, 15 unsolved in 107 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 16/25 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 3/28 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/29 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/29 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 29/29 variables, and 28 constraints, problems are : Problem set: 0 solved, 15 unsolved in 135 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 248ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 248ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/538 places, 18/541 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 336 ms. Remains : 12/538 places, 18/541 transitions.
Computed a total of 1 stabilizing places and 4 stable transitions
Computed a total of 1 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 105 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 191 ms :[p0, p0, p0, false, (AND (NOT p1) p0)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (3221 resets) in 335 ms. (119 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (1991 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
[2024-05-24 01:13:53] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-24 01:13:53] [INFO ] Invariant cache hit.
[2024-05-24 01:13:53] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 4/29 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 14 ms.
Refiners :[State Equation: 0/12 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 16ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0)]
Knowledge based reduction with 10 factoid took 212 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 198 ms :[p0, p0, p0, false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 228 ms :[p0, p0, p0, false, (AND (NOT p1) p0)]
Stuttering acceptance computed with spot in 199 ms :[p0, p0, p0, false, (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 12589 reset in 178 ms.
Product exploration explored 100000 steps with 12739 reset in 213 ms.
Built C files in :
/tmp/ltsmin10115517987068332973
[2024-05-24 01:13:54] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2024-05-24 01:13:54] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 01:13:54] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2024-05-24 01:13:54] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 01:13:54] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2024-05-24 01:13:54] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 01:13:54] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10115517987068332973
Running compilation step : cd /tmp/ltsmin10115517987068332973;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 233 ms.
Running link step : cd /tmp/ltsmin10115517987068332973;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin10115517987068332973;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11163592782729023114.hoa' '--buchi-type=spotba'
LTSmin run took 1390 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-11 finished in 67137 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) U (G(p1) U (p2||X(F((p2&&F(p3)))))))))'
Support contains 4 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 543 transition count 552
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 543 transition count 552
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 543 transition count 551
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 24 place count 538 transition count 546
Iterating global reduction 1 with 5 rules applied. Total rules applied 29 place count 538 transition count 546
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 34 place count 538 transition count 541
Applied a total of 34 rules in 29 ms. Remains 538 /552 variables (removed 14) and now considering 541/561 (removed 20) transitions.
// Phase 1: matrix 541 rows 538 cols
[2024-05-24 01:13:56] [INFO ] Computed 33 invariants in 7 ms
[2024-05-24 01:13:56] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-24 01:13:56] [INFO ] Invariant cache hit.
[2024-05-24 01:13:57] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
Running 540 sub problems to find dead transitions.
[2024-05-24 01:13:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1078 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (OVERLAPS) 1/1079 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1079/1079 variables, and 571 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 540 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/537 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1078 variables, 540/1110 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1078 variables, 0/1110 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 5 (OVERLAPS) 1/1079 variables, 1/1111 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1079/1079 variables, and 1111 constraints, problems are : Problem set: 0 solved, 540 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 540/540 constraints, Known Traps: 0/0 constraints]
After SMT, in 60154ms problems are : Problem set: 0 solved, 540 unsolved
Search for dead transitions found 0 dead transitions in 60160ms
Starting structural reductions in LTL mode, iteration 1 : 538/552 places, 541/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60646 ms. Remains : 538/552 places, 541/561 transitions.
Stuttering acceptance computed with spot in 394 ms :[(AND (NOT p0) (NOT p3) (NOT p1)), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p2), (AND (NOT p0) (NOT p3)), (OR (NOT p2) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-12
Product exploration explored 100000 steps with 858 reset in 148 ms.
Product exploration explored 100000 steps with 851 reset in 158 ms.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 838 edges and 538 vertex of which 502 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.3 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Detected a total of 99/538 stabilizing places and 99/541 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 (NOT p2)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 138 ms. Reduced automaton from 6 states, 15 edges and 4 AP (stutter sensitive) to 18 states, 51 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 734 ms :[(AND (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3) p2), false, (AND (NOT p0) p1 (NOT p3) p2), false, (AND p0 (NOT p1) (NOT p3) (NOT p2)), (AND p0 (NOT p1) p3 (NOT p2)), false, false, (AND p0 p1 (NOT p3) (NOT p2)), (AND p0 p1 p3 (NOT p2)), false, false]
RANDOM walk for 40000 steps (145 resets) in 977 ms. (40 steps per ms) remains 11/24 properties
BEST_FIRST walk for 40003 steps (15 resets) in 132 ms. (300 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (12 resets) in 185 ms. (215 steps per ms) remains 7/11 properties
BEST_FIRST walk for 40003 steps (15 resets) in 139 ms. (285 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (16 resets) in 157 ms. (253 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (13 resets) in 116 ms. (341 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (13 resets) in 136 ms. (291 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (12 resets) in 120 ms. (330 steps per ms) remains 7/7 properties
[2024-05-24 01:14:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 91/95 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 442/537 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1078 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/1079 variables, 1/571 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1079 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/1079 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1079/1079 variables, and 571 constraints, problems are : Problem set: 0 solved, 7 unsolved in 837 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 538/538 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 91/95 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 442/537 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 541/1078 variables, 537/570 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1078 variables, 7/577 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1078 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1/1079 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1079 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/1079 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1079/1079 variables, and 578 constraints, problems are : Problem set: 0 solved, 7 unsolved in 710 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 538/538 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 1570ms problems are : Problem set: 0 solved, 7 unsolved
Finished Parikh walk after 7782 steps, including 49 resets, run visited all 4 properties in 88 ms. (steps per millisecond=88 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 470 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p3 (NOT p2)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X p3)), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p0) (NOT p3))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1) p2 p3))), (F (NOT (OR p0 (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (OR p0 (NOT p2) p3))), (F p1), (F (NOT (OR p0 (NOT p1) p2))), (F p2), (F (NOT p3)), (F (NOT (OR (NOT p0) p1 (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) p1 (NOT p2) p3))), (F p0), (F (NOT (OR p0 p3))), (F (NOT (OR (NOT p0) (NOT p1) p2 (NOT p3)))), (F (NOT (OR p0 (NOT p1) (NOT p2) p3))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p1 p2 p3))), (F (NOT (OR p0 p1 (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1 p3))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) p3))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p0 (NOT p1) p3))), (F (NOT (OR (NOT p0) p1 p2 (NOT p3)))), (F (NOT (OR p0 p1 (NOT p2) p3)))]
Knowledge based reduction with 19 factoid took 1097 ms. Reduced automaton from 18 states, 51 edges and 4 AP (stutter insensitive) to 18 states, 51 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 839 ms :[(AND (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3) p2), false, (AND (NOT p0) p1 (NOT p3) p2), false, (AND p0 (NOT p1) (NOT p3) (NOT p2)), (AND p0 (NOT p1) p3 (NOT p2)), false, false, (AND p0 p1 (NOT p3) (NOT p2)), (AND p0 p1 p3 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 780 ms :[(AND (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3) p2), false, (AND (NOT p0) p1 (NOT p3) p2), false, (AND p0 (NOT p1) (NOT p3) (NOT p2)), (AND p0 (NOT p1) p3 (NOT p2)), false, false, (AND p0 p1 (NOT p3) (NOT p2)), (AND p0 p1 p3 (NOT p2)), false, false]
[2024-05-24 01:15:04] [INFO ] Invariant cache hit.
[2024-05-24 01:15:04] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 10 ms returned sat
[2024-05-24 01:15:04] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2024-05-24 01:15:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 01:15:04] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 10 ms returned sat
[2024-05-24 01:15:05] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2024-05-24 01:15:05] [INFO ] Computed and/alt/rep : 535/703/535 causal constraints (skipped 5 transitions) in 30 ms.
[2024-05-24 01:15:09] [INFO ] Added : 513 causal constraints over 103 iterations in 4007 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 4 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 541/541 transitions.
Graph (trivial) has 435 edges and 538 vertex of which 6 / 538 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 832 edges and 533 vertex of which 497 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.8 ms
Discarding 36 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 253 transitions
Trivial Post-agglo rules discarded 253 transitions
Performed 253 trivial Post agglomeration. Transition count delta: 253
Iterating post reduction 0 with 253 rules applied. Total rules applied 255 place count 496 transition count 278
Reduce places removed 253 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 255 rules applied. Total rules applied 510 place count 243 transition count 276
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 512 place count 241 transition count 276
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 512 place count 241 transition count 210
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 644 place count 175 transition count 210
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 675 place count 144 transition count 179
Iterating global reduction 3 with 31 rules applied. Total rules applied 706 place count 144 transition count 179
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: 96
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 192 rules applied. Total rules applied 898 place count 48 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 899 place count 48 transition count 82
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 928 place count 19 transition count 25
Iterating global reduction 4 with 29 rules applied. Total rules applied 957 place count 19 transition count 25
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 961 place count 17 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 962 place count 16 transition count 23
Applied a total of 962 rules in 41 ms. Remains 16 /538 variables (removed 522) and now considering 23/541 (removed 518) transitions.
[2024-05-24 01:15:09] [INFO ] Flow matrix only has 22 transitions (discarded 1 similar events)
// Phase 1: matrix 22 rows 16 cols
[2024-05-24 01:15:09] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 01:15:09] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-24 01:15:09] [INFO ] Flow matrix only has 22 transitions (discarded 1 similar events)
[2024-05-24 01:15:09] [INFO ] Invariant cache hit.
[2024-05-24 01:15:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 01:15:09] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-24 01:15:09] [INFO ] Redundant transitions in 14 ms returned []
Running 19 sub problems to find dead transitions.
[2024-05-24 01:15:09] [INFO ] Flow matrix only has 22 transitions (discarded 1 similar events)
[2024-05-24 01:15:09] [INFO ] Invariant cache hit.
[2024-05-24 01:15:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 21/35 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 2/37 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 1/38 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 17 constraints, problems are : Problem set: 0 solved, 19 unsolved in 146 ms.
Refiners :[State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 21/35 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 2/37 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 1/38 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/38 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 36 constraints, problems are : Problem set: 0 solved, 19 unsolved in 185 ms.
Refiners :[State Equation: 16/16 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 337ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 338ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/538 places, 23/541 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 455 ms. Remains : 16/538 places, 23/541 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Detected a total of 4/16 stabilizing places and 4/23 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p3 (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND p0 p1 (NOT p2) p3))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 33 factoid took 1104 ms. Reduced automaton from 18 states, 51 edges and 4 AP (stutter insensitive) to 18 states, 51 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 813 ms :[(AND (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3) p2), false, (AND (NOT p0) p1 (NOT p3) p2), false, (AND p0 (NOT p1) (NOT p3) (NOT p2)), (AND p0 (NOT p1) p3 (NOT p2)), false, false, (AND p0 p1 (NOT p3) (NOT p2)), (AND p0 p1 p3 (NOT p2)), false, false]
RANDOM walk for 7082 steps (488 resets) in 77 ms. (90 steps per ms) remains 0/24 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p3 (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT (AND (NOT p0) p1 p2 p3))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT (AND p0 p1 (NOT p2) p3))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) (NOT p2) p3))), (X (NOT (AND p0 p1 p2 p3))), (X (NOT (AND (NOT p0) (NOT p1) p2 p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT (AND (NOT p0) p1 p2 p3)))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND p0 p1 p2 p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) (NOT p1) p2 p3))), (F (NOT (OR p0 (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (OR p0 (NOT p2) p3))), (F p1), (F (NOT (OR p0 (NOT p1) p2))), (F p2), (F (NOT p3)), (F (NOT (OR (NOT p0) p1 (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) p1 (NOT p2) p3))), (F p0), (F (NOT (OR p0 p3))), (F (NOT (OR (NOT p0) (NOT p1) p2 (NOT p3)))), (F (NOT (OR p0 (NOT p1) (NOT p2) p3))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p1 p2 p3))), (F (NOT (OR p0 p1 (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 p1 p3))), (F (NOT (OR (NOT p0) (NOT p1) (NOT p2) p3))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p0 (NOT p1) p3))), (F (NOT (OR (NOT p0) p1 p2 (NOT p3)))), (F (NOT (OR p0 p1 (NOT p2) p3)))]
Knowledge based reduction with 33 factoid took 2096 ms. Reduced automaton from 18 states, 51 edges and 4 AP (stutter insensitive) to 18 states, 51 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 859 ms :[(AND (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3) p2), false, (AND (NOT p0) p1 (NOT p3) p2), false, (AND p0 (NOT p1) (NOT p3) (NOT p2)), (AND p0 (NOT p1) p3 (NOT p2)), false, false, (AND p0 p1 (NOT p3) (NOT p2)), (AND p0 p1 p3 (NOT p2)), false, false]
Stuttering acceptance computed with spot in 828 ms :[(AND (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3) p2), false, (AND (NOT p0) p1 (NOT p3) p2), false, (AND p0 (NOT p1) (NOT p3) (NOT p2)), (AND p0 (NOT p1) p3 (NOT p2)), false, false, (AND p0 p1 (NOT p3) (NOT p2)), (AND p0 p1 p3 (NOT p2)), false, false]
[2024-05-24 01:15:15] [INFO ] Flow matrix only has 22 transitions (discarded 1 similar events)
[2024-05-24 01:15:15] [INFO ] Invariant cache hit.
[2024-05-24 01:15:15] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-24 01:15:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 01:15:15] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 01:15:15] [INFO ] Computed and/alt/rep : 18/44/18 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 01:15:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 01:15:15] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-24 01:15:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-24 01:15:15] [INFO ] Computed and/alt/rep : 18/44/18 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 01:15:15] [INFO ] Added : 14 causal constraints over 4 iterations in 11 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 822 ms :[(AND (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (NOT p2), (OR (NOT p2) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p3)), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3) p2), false, (AND (NOT p0) p1 (NOT p3) p2), false, (AND p0 (NOT p1) (NOT p3) (NOT p2)), (AND p0 (NOT p1) p3 (NOT p2)), false, false, (AND p0 p1 (NOT p3) (NOT p2)), (AND p0 p1 p3 (NOT p2)), false, false]
Stuttering criterion allowed to conclude after 5 steps with 1 reset in 1 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-12 finished in 79868 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(p0)&&F(G(p1))))||G(p2))))'
Support contains 3 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 544 transition count 553
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 544 transition count 553
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 544 transition count 552
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 539 transition count 547
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 539 transition count 547
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 32 place count 539 transition count 542
Applied a total of 32 rules in 30 ms. Remains 539 /552 variables (removed 13) and now considering 542/561 (removed 19) transitions.
// Phase 1: matrix 542 rows 539 cols
[2024-05-24 01:15:16] [INFO ] Computed 33 invariants in 8 ms
[2024-05-24 01:15:16] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-24 01:15:16] [INFO ] Invariant cache hit.
[2024-05-24 01:15:16] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
Running 541 sub problems to find dead transitions.
[2024-05-24 01:15:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (OVERLAPS) 542/1080 variables, 538/571 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1080 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (OVERLAPS) 1/1081 variables, 1/572 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1081/1081 variables, and 572 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 539/539 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 541 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (OVERLAPS) 542/1080 variables, 538/571 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1080 variables, 541/1112 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1080 variables, 0/1112 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 5 (OVERLAPS) 1/1081 variables, 1/1113 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1081/1081 variables, and 1113 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 539/539 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 0/0 constraints]
After SMT, in 60167ms problems are : Problem set: 0 solved, 541 unsolved
Search for dead transitions found 0 dead transitions in 60175ms
Starting structural reductions in LTL mode, iteration 1 : 539/552 places, 542/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60644 ms. Remains : 539/552 places, 542/561 transitions.
Stuttering acceptance computed with spot in 201 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-14
Stuttering criterion allowed to conclude after 265 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-14 finished in 60874 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(X(G((G(p0)||X(F(p1)))))))))'
Support contains 2 out of 552 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 552/552 places, 561/561 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 542 transition count 551
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 542 transition count 551
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 542 transition count 550
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 536 transition count 544
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 536 transition count 544
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 39 place count 536 transition count 538
Applied a total of 39 rules in 32 ms. Remains 536 /552 variables (removed 16) and now considering 538/561 (removed 23) transitions.
// Phase 1: matrix 538 rows 536 cols
[2024-05-24 01:16:17] [INFO ] Computed 33 invariants in 6 ms
[2024-05-24 01:16:17] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-24 01:16:17] [INFO ] Invariant cache hit.
[2024-05-24 01:16:17] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Running 537 sub problems to find dead transitions.
[2024-05-24 01:16:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1073 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 4 (OVERLAPS) 1/1074 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1074/1074 variables, and 569 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 537 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1073 variables, 537/1105 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1073 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 5 (OVERLAPS) 1/1074 variables, 1/1106 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1074/1074 variables, and 1106 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints]
After SMT, in 60140ms problems are : Problem set: 0 solved, 537 unsolved
Search for dead transitions found 0 dead transitions in 60151ms
Starting structural reductions in LTL mode, iteration 1 : 536/552 places, 538/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60654 ms. Remains : 536/552 places, 538/561 transitions.
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-32b-LTLFireability-15
Product exploration explored 100000 steps with 490 reset in 150 ms.
Product exploration explored 100000 steps with 491 reset in 156 ms.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 835 edges and 536 vertex of which 500 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.3 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Detected a total of 99/536 stabilizing places and 99/538 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 768 steps (0 resets) in 12 ms. (59 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-24 01:17:19] [INFO ] Invariant cache hit.
[2024-05-24 01:17:19] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 11 ms returned sat
[2024-05-24 01:17:20] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2024-05-24 01:17:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 01:17:20] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 11 ms returned sat
[2024-05-24 01:17:20] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2024-05-24 01:17:20] [INFO ] Computed and/alt/rep : 532/698/532 causal constraints (skipped 5 transitions) in 42 ms.
[2024-05-24 01:17:24] [INFO ] Added : 445 causal constraints over 89 iterations in 3489 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 536 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 536/536 places, 538/538 transitions.
Applied a total of 0 rules in 14 ms. Remains 536 /536 variables (removed 0) and now considering 538/538 (removed 0) transitions.
[2024-05-24 01:17:24] [INFO ] Invariant cache hit.
[2024-05-24 01:17:24] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-24 01:17:24] [INFO ] Invariant cache hit.
[2024-05-24 01:17:24] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
Running 537 sub problems to find dead transitions.
[2024-05-24 01:17:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1073 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 4 (OVERLAPS) 1/1074 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1074/1074 variables, and 569 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 537 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/535 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/535 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 2 (OVERLAPS) 538/1073 variables, 535/568 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1073 variables, 537/1105 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1073 variables, 0/1105 constraints. Problems are: Problem set: 0 solved, 537 unsolved
At refinement iteration 5 (OVERLAPS) 1/1074 variables, 1/1106 constraints. Problems are: Problem set: 0 solved, 537 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1074/1074 variables, and 1106 constraints, problems are : Problem set: 0 solved, 537 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 33/33 constraints, State Equation: 536/536 constraints, PredecessorRefiner: 537/537 constraints, Known Traps: 0/0 constraints]
After SMT, in 60142ms problems are : Problem set: 0 solved, 537 unsolved
Search for dead transitions found 0 dead transitions in 60149ms
Finished structural reductions in LTL mode , in 1 iterations and 60644 ms. Remains : 536/536 places, 538/538 transitions.
Computed a total of 99 stabilizing places and 99 stable transitions
Graph (complete) has 835 edges and 536 vertex of which 500 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.3 ms
Computed a total of 99 stabilizing places and 99 stable transitions
Detected a total of 99/536 stabilizing places and 99/538 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 824 steps (0 resets) in 9 ms. (82 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 2 factoid took 159 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-24 01:18:25] [INFO ] Invariant cache hit.
[2024-05-24 01:18:26] [INFO ] [Real]Absence check using 0 positive and 33 generalized place invariants in 21 ms returned sat
[2024-05-24 01:18:26] [INFO ] [Real]Absence check using state equation in 475 ms returned sat
[2024-05-24 01:18:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 01:18:26] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 10 ms returned sat
[2024-05-24 01:18:26] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2024-05-24 01:18:26] [INFO ] Computed and/alt/rep : 532/698/532 causal constraints (skipped 5 transitions) in 31 ms.
[2024-05-24 01:18:30] [INFO ] Added : 445 causal constraints over 89 iterations in 3443 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 488 reset in 151 ms.
Stack based approach found an accepted trace after 78571 steps with 384 reset with depth 200 and stack size 200 in 127 ms.
FORMULA GPUForwardProgress-PT-32b-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property GPUForwardProgress-PT-32b-LTLFireability-15 finished in 133636 ms.
All properties solved by simple procedures.
Total runtime 850600 ms.
BK_STOP 1716513510981
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPUForwardProgress-PT-32b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-32b, 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 r180-tall-171640603800588"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-32b.tgz
mv GPUForwardProgress-PT-32b 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 ;