Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 22:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 11 22:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 22:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 11 22:28 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 141K 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-28b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-28b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717198527233

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-28b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:35:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 23:35:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:35:28] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2024-05-31 23:35:28] [INFO ] Transformed 568 places.
[2024-05-31 23:35:28] [INFO ] Transformed 597 transitions.
[2024-05-31 23:35:28] [INFO ] Found NUPN structural information;
[2024-05-31 23:35:28] [INFO ] Parsed PT model containing 568 places and 597 transitions and 1477 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-28b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-28b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-28b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 568 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 568/568 places, 597/597 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 567 transition count 597
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 57 place count 511 transition count 541
Iterating global reduction 1 with 56 rules applied. Total rules applied 113 place count 511 transition count 541
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 138 place count 486 transition count 516
Iterating global reduction 1 with 25 rules applied. Total rules applied 163 place count 486 transition count 516
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 186 place count 486 transition count 493
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 187 place count 485 transition count 492
Iterating global reduction 2 with 1 rules applied. Total rules applied 188 place count 485 transition count 492
Applied a total of 188 rules in 159 ms. Remains 485 /568 variables (removed 83) and now considering 492/597 (removed 105) transitions.
// Phase 1: matrix 492 rows 485 cols
[2024-05-31 23:35:29] [INFO ] Computed 29 invariants in 23 ms
[2024-05-31 23:35:29] [INFO ] Implicit Places using invariants in 326 ms returned []
[2024-05-31 23:35:29] [INFO ] Invariant cache hit.
[2024-05-31 23:35:29] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
Running 491 sub problems to find dead transitions.
[2024-05-31 23:35:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/484 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/484 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 2 (OVERLAPS) 492/976 variables, 484/513 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/976 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 4 (OVERLAPS) 1/977 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/977 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 491 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 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.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 1.0)
(s56 0.0)
(s57 0.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 1.0)
(s71 0.0)
(s72 0.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)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 1.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 1.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)timeout

(s364 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 977/977 variables, and 514 constraints, problems are : Problem set: 0 solved, 491 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 485/485 constraints, PredecessorRefiner: 491/491 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 491 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/484 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/484 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 2 (OVERLAPS) 492/976 variables, 484/513 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/976 variables, 491/1004 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/976 variables, 0/1004 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 5 (OVERLAPS) 1/977 variables, 1/1005 constraints. Problems are: Problem set: 0 solved, 491 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/977 variables, 0/1005 constraints. Problems are: Problem set: 0 solved, 491 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 977/977 variables, and 1005 constraints, problems are : Problem set: 0 solved, 491 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 485/485 constraints, PredecessorRefiner: 491/491 constraints, Known Traps: 0/0 constraints]
After SMT, in 60247ms problems are : Problem set: 0 solved, 491 unsolved
Search for dead transitions found 0 dead transitions in 60267ms
Starting structural reductions in LTL mode, iteration 1 : 485/568 places, 492/597 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61146 ms. Remains : 485/568 places, 492/597 transitions.
Support contains 27 out of 485 places after structural reductions.
[2024-05-31 23:36:30] [INFO ] Flatten gal took : 62 ms
[2024-05-31 23:36:30] [INFO ] Flatten gal took : 27 ms
[2024-05-31 23:36:30] [INFO ] Input system was already deterministic with 492 transitions.
RANDOM walk for 40000 steps (160 resets) in 1740 ms. (22 steps per ms) remains 4/25 properties
BEST_FIRST walk for 40003 steps (17 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (18 resets) in 37 ms. (1052 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
[2024-05-31 23:36:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 476/484 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/484 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 492/976 variables, 484/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/976 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1/977 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/977 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/977 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 977/977 variables, and 514 constraints, problems are : Problem set: 0 solved, 4 unsolved in 618 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 485/485 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 476/484 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/484 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 492/976 variables, 484/513 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/976 variables, 4/517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/976 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1/977 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/977 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/977 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 977/977 variables, and 518 constraints, problems are : Problem set: 0 solved, 4 unsolved in 546 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 485/485 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1176ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 342 steps, including 0 resets, run visited all 4 properties in 9 ms. (steps per millisecond=38 )
Parikh walk visited 4 properties in 23 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 89 stabilizing places and 89 stable transitions
Graph (complete) has 753 edges and 485 vertex of which 453 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.17 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((((p0||G(!p0)) U p1) U X(p2))&&F(p1)))'
Support contains 3 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 478 transition count 485
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 478 transition count 485
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 478 transition count 484
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 474 transition count 480
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 474 transition count 480
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 26 place count 474 transition count 477
Applied a total of 26 rules in 21 ms. Remains 474 /485 variables (removed 11) and now considering 477/492 (removed 15) transitions.
// Phase 1: matrix 477 rows 474 cols
[2024-05-31 23:36:32] [INFO ] Computed 29 invariants in 13 ms
[2024-05-31 23:36:32] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-31 23:36:32] [INFO ] Invariant cache hit.
[2024-05-31 23:36:33] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
Running 476 sub problems to find dead transitions.
[2024-05-31 23:36:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 2 (OVERLAPS) 477/950 variables, 473/502 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/950 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 4 (OVERLAPS) 1/951 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/951 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 476 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 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.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 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.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 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.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 0.0)
(s90 1.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 0.0)
(s105 1.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 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.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 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.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 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 951/951 variables, and 503 constraints, problems are : Problem set: 0 solved, 476 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 476/476 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 476 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 2 (OVERLAPS) 477/950 variables, 473/502 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/950 variables, 476/978 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/950 variables, 0/978 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 5 (OVERLAPS) 1/951 variables, 1/979 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/951 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 476 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 951/951 variables, and 979 constraints, problems are : Problem set: 0 solved, 476 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 476/476 constraints, Known Traps: 0/0 constraints]
After SMT, in 60167ms problems are : Problem set: 0 solved, 476 unsolved
Search for dead transitions found 0 dead transitions in 60173ms
Starting structural reductions in LTL mode, iteration 1 : 474/485 places, 477/492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60659 ms. Remains : 474/485 places, 477/492 transitions.
Stuttering acceptance computed with spot in 599 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, p0, (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-01
Product exploration explored 100000 steps with 910 reset in 245 ms.
Entered a terminal (fully accepting) state of product in 74376 steps with 626 reset in 147 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-01 finished in 61724 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(G(p1)))))'
Support contains 2 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 477 transition count 484
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 477 transition count 484
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 477 transition count 483
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 472 transition count 478
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 472 transition count 478
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 31 place count 472 transition count 474
Applied a total of 31 rules in 24 ms. Remains 472 /485 variables (removed 13) and now considering 474/492 (removed 18) transitions.
// Phase 1: matrix 474 rows 472 cols
[2024-05-31 23:37:34] [INFO ] Computed 29 invariants in 6 ms
[2024-05-31 23:37:34] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-31 23:37:34] [INFO ] Invariant cache hit.
[2024-05-31 23:37:34] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-05-31 23:37:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 1/946 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/946 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 946/946 variables, and 501 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 473/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/945 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (OVERLAPS) 1/946 variables, 1/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 473 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 946/946 variables, and 974 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
After SMT, in 60140ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60145ms
Starting structural reductions in LTL mode, iteration 1 : 472/485 places, 474/492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60592 ms. Remains : 472/485 places, 474/492 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-03
Product exploration explored 100000 steps with 1056 reset in 137 ms.
Product exploration explored 100000 steps with 1042 reset in 180 ms.
Computed a total of 87 stabilizing places and 87 stable transitions
Graph (complete) has 735 edges and 472 vertex of which 440 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.5 ms
Computed a total of 87 stabilizing places and 87 stable transitions
Detected a total of 87/472 stabilizing places and 87/474 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 104 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
RANDOM walk for 379 steps (0 resets) in 7 ms. (47 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 219 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
[2024-05-31 23:38:36] [INFO ] Invariant cache hit.
[2024-05-31 23:38:36] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 8 ms returned sat
[2024-05-31 23:38:36] [INFO ] [Real]Absence check using state equation in 201 ms returned sat
[2024-05-31 23:38:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:38:36] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 9 ms returned sat
[2024-05-31 23:38:36] [INFO ] [Nat]Absence check using state equation in 165 ms returned sat
[2024-05-31 23:38:37] [INFO ] Computed and/alt/rep : 468/614/468 causal constraints (skipped 5 transitions) in 32 ms.
[2024-05-31 23:38:37] [INFO ] Added : 77 causal constraints over 16 iterations in 511 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 472 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 474/474 transitions.
Applied a total of 0 rules in 9 ms. Remains 472 /472 variables (removed 0) and now considering 474/474 (removed 0) transitions.
[2024-05-31 23:38:37] [INFO ] Invariant cache hit.
[2024-05-31 23:38:37] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-31 23:38:37] [INFO ] Invariant cache hit.
[2024-05-31 23:38:37] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-05-31 23:38:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 1/946 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/946 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 946/946 variables, and 501 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 473/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/945 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (OVERLAPS) 1/946 variables, 1/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 473 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 946/946 variables, and 974 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
After SMT, in 60126ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60132ms
Finished structural reductions in LTL mode , in 1 iterations and 60565 ms. Remains : 472/472 places, 474/474 transitions.
Computed a total of 87 stabilizing places and 87 stable transitions
Graph (complete) has 735 edges and 472 vertex of which 440 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.6 ms
Computed a total of 87 stabilizing places and 87 stable transitions
Detected a total of 87/472 stabilizing places and 87/474 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 118 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
RANDOM walk for 337 steps (0 resets) in 4 ms. (67 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 238 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
[2024-05-31 23:39:38] [INFO ] Invariant cache hit.
[2024-05-31 23:39:39] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 9 ms returned sat
[2024-05-31 23:39:39] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2024-05-31 23:39:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:39:39] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 8 ms returned sat
[2024-05-31 23:39:39] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-05-31 23:39:39] [INFO ] Computed and/alt/rep : 468/614/468 causal constraints (skipped 5 transitions) in 25 ms.
[2024-05-31 23:39:40] [INFO ] Added : 77 causal constraints over 16 iterations in 470 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 1056 reset in 132 ms.
Product exploration explored 100000 steps with 1044 reset in 158 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 2 out of 472 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 472/472 places, 474/474 transitions.
Graph (trivial) has 385 edges and 472 vertex of which 6 / 472 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 729 edges and 467 vertex of which 435 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.3 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 224 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 224 rules applied. Total rules applied 226 place count 435 transition count 465
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 30 Pre rules applied. Total rules applied 226 place count 435 transition count 467
Deduced a syphon composed of 254 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 256 place count 435 transition count 467
Discarding 165 places :
Symmetric choice reduction at 1 with 165 rule applications. Total rules 421 place count 270 transition count 302
Deduced a syphon composed of 116 places in 1 ms
Iterating global reduction 1 with 165 rules applied. Total rules applied 586 place count 270 transition count 302
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 613 place count 243 transition count 275
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 640 place count 243 transition count 275
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 177 places in 0 ms
Iterating global reduction 1 with 88 rules applied. Total rules applied 728 place count 243 transition count 276
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 730 place count 243 transition count 274
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 793 place count 180 transition count 210
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 2 with 63 rules applied. Total rules applied 856 place count 180 transition count 210
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 115 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 857 place count 180 transition count 210
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 858 place count 179 transition count 209
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 859 place count 179 transition count 209
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -83
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 2 with 28 rules applied. Total rules applied 887 place count 179 transition count 292
Discarding 54 places :
Symmetric choice reduction at 2 with 54 rule applications. Total rules 941 place count 125 transition count 184
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 2 with 54 rules applied. Total rules applied 995 place count 125 transition count 184
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 1073 place count 47 transition count 54
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1151 place count 47 transition count 54
Deduced a syphon composed of 36 places in 0 ms
Applied a total of 1151 rules in 113 ms. Remains 47 /472 variables (removed 425) and now considering 54/474 (removed 420) transitions.
[2024-05-31 23:39:41] [INFO ] Redundant transitions in 12 ms returned []
Running 53 sub problems to find dead transitions.
// Phase 1: matrix 54 rows 47 cols
[2024-05-31 23:39:41] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 23:39:41] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
At refinement iteration 1 (OVERLAPS) 53/99 variables, 46/46 constraints. Problems are: Problem set: 40 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 8/54 constraints. Problems are: Problem set: 40 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/54 constraints. Problems are: Problem set: 40 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 1/100 variables, 1/55 constraints. Problems are: Problem set: 40 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 0/55 constraints. Problems are: Problem set: 40 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 1/101 variables, 1/56 constraints. Problems are: Problem set: 40 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/56 constraints. Problems are: Problem set: 40 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/101 variables, 0/56 constraints. Problems are: Problem set: 40 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 56 constraints, problems are : Problem set: 40 solved, 13 unsolved in 299 ms.
Refiners :[State Equation: 47/47 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 40 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 40 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 52/62 variables, 10/10 constraints. Problems are: Problem set: 40 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 8/18 constraints. Problems are: Problem set: 40 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 13/31 constraints. Problems are: Problem set: 40 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/31 constraints. Problems are: Problem set: 40 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 38/100 variables, 37/68 constraints. Problems are: Problem set: 40 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/68 constraints. Problems are: Problem set: 40 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/101 variables, 1/69 constraints. Problems are: Problem set: 40 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/69 constraints. Problems are: Problem set: 40 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/101 variables, 0/69 constraints. Problems are: Problem set: 40 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 69 constraints, problems are : Problem set: 40 solved, 13 unsolved in 235 ms.
Refiners :[State Equation: 47/47 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 13/53 constraints, Known Traps: 0/0 constraints]
After SMT, in 546ms problems are : Problem set: 40 solved, 13 unsolved
Search for dead transitions found 40 dead transitions in 548ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 47/472 places, 14/474 transitions.
Graph (complete) has 34 edges and 47 vertex of which 11 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.0 ms
Discarding 36 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 11 /47 variables (removed 36) and now considering 14/14 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/472 places, 14/474 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 688 ms. Remains : 11/472 places, 14/474 transitions.
Support contains 2 out of 472 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 474/474 transitions.
Applied a total of 0 rules in 9 ms. Remains 472 /472 variables (removed 0) and now considering 474/474 (removed 0) transitions.
// Phase 1: matrix 474 rows 472 cols
[2024-05-31 23:39:41] [INFO ] Computed 29 invariants in 7 ms
[2024-05-31 23:39:41] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-31 23:39:41] [INFO ] Invariant cache hit.
[2024-05-31 23:39:42] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-05-31 23:39:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 1/946 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/946 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 946/946 variables, and 501 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 473/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/945 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (OVERLAPS) 1/946 variables, 1/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 946/946 variables, and 974 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60159ms
Finished structural reductions in LTL mode , in 1 iterations and 60593 ms. Remains : 472/472 places, 474/474 transitions.
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-03 finished in 188053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(X(F(p1))))))'
Support contains 4 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 477 transition count 484
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 477 transition count 484
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 477 transition count 483
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 472 transition count 478
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 472 transition count 478
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 31 place count 472 transition count 474
Applied a total of 31 rules in 27 ms. Remains 472 /485 variables (removed 13) and now considering 474/492 (removed 18) transitions.
[2024-05-31 23:40:42] [INFO ] Invariant cache hit.
[2024-05-31 23:40:42] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-31 23:40:42] [INFO ] Invariant cache hit.
[2024-05-31 23:40:42] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-05-31 23:40:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 1/946 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/946 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 946/946 variables, and 501 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 473/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/945 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (OVERLAPS) 1/946 variables, 1/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 946/946 variables, and 974 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
After SMT, in 60128ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60133ms
Starting structural reductions in LTL mode, iteration 1 : 472/485 places, 474/492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60579 ms. Remains : 472/485 places, 474/492 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-07
Product exploration explored 100000 steps with 1114 reset in 239 ms.
Product exploration explored 100000 steps with 1124 reset in 233 ms.
Computed a total of 87 stabilizing places and 87 stable transitions
Graph (complete) has 735 edges and 472 vertex of which 440 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.8 ms
Computed a total of 87 stabilizing places and 87 stable transitions
Detected a total of 87/472 stabilizing places and 87/474 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 98 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 353 steps (0 resets) in 8 ms. (39 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p1), (F p0)]
Knowledge based reduction with 6 factoid took 225 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
[2024-05-31 23:41:44] [INFO ] Invariant cache hit.
[2024-05-31 23:41:44] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 11 ms returned sat
[2024-05-31 23:41:45] [INFO ] [Real]Absence check using state equation in 547 ms returned sat
[2024-05-31 23:41:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:41:45] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 11 ms returned sat
[2024-05-31 23:41:46] [INFO ] [Nat]Absence check using state equation in 1413 ms returned sat
[2024-05-31 23:41:46] [INFO ] Computed and/alt/rep : 468/614/468 causal constraints (skipped 5 transitions) in 27 ms.
[2024-05-31 23:41:50] [INFO ] Added : 417 causal constraints over 84 iterations in 4090 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 4 out of 472 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 474/474 transitions.
Applied a total of 0 rules in 13 ms. Remains 472 /472 variables (removed 0) and now considering 474/474 (removed 0) transitions.
[2024-05-31 23:41:50] [INFO ] Invariant cache hit.
[2024-05-31 23:41:50] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-31 23:41:50] [INFO ] Invariant cache hit.
[2024-05-31 23:41:51] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-05-31 23:41:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 1/946 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/946 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 473 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 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.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 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.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 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.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 1.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.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 0.0)
(s105 1.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 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.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 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 timeout
0.0)
(s140 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 946/946 variables, and 501 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 473/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/945 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (OVERLAPS) 1/946 variables, 1/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 946/946 variables, and 974 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
After SMT, in 60118ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Finished structural reductions in LTL mode , in 1 iterations and 60544 ms. Remains : 472/472 places, 474/474 transitions.
Computed a total of 87 stabilizing places and 87 stable transitions
Graph (complete) has 735 edges and 472 vertex of which 440 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.3 ms
Computed a total of 87 stabilizing places and 87 stable transitions
Detected a total of 87/472 stabilizing places and 87/474 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 (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 100 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 395 steps (0 resets) in 6 ms. (56 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 5 factoid took 157 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-31 23:42:51] [INFO ] Invariant cache hit.
[2024-05-31 23:42:52] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 11 ms returned sat
[2024-05-31 23:42:52] [INFO ] [Real]Absence check using state equation in 524 ms returned sat
[2024-05-31 23:42:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:42:52] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 9 ms returned sat
[2024-05-31 23:42:54] [INFO ] [Nat]Absence check using state equation in 1345 ms returned sat
[2024-05-31 23:42:54] [INFO ] Computed and/alt/rep : 468/614/468 causal constraints (skipped 5 transitions) in 29 ms.
[2024-05-31 23:42:58] [INFO ] Added : 417 causal constraints over 84 iterations in 4039 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1121 reset in 153 ms.
Product exploration explored 100000 steps with 1117 reset in 158 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 472 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 472/472 places, 474/474 transitions.
Graph (trivial) has 383 edges and 472 vertex of which 6 / 472 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 729 edges and 467 vertex of which 435 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.4 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 225 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 225 rules applied. Total rules applied 227 place count 435 transition count 465
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 30 Pre rules applied. Total rules applied 227 place count 435 transition count 467
Deduced a syphon composed of 255 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 257 place count 435 transition count 467
Discarding 166 places :
Symmetric choice reduction at 1 with 166 rule applications. Total rules 423 place count 269 transition count 301
Deduced a syphon composed of 116 places in 1 ms
Iterating global reduction 1 with 166 rules applied. Total rules applied 589 place count 269 transition count 301
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 616 place count 242 transition count 274
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 643 place count 242 transition count 274
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 175 places in 0 ms
Iterating global reduction 1 with 86 rules applied. Total rules applied 729 place count 242 transition count 275
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 731 place count 242 transition count 273
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 792 place count 181 transition count 211
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 2 with 61 rules applied. Total rules applied 853 place count 181 transition count 211
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 115 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 854 place count 181 transition count 211
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 855 place count 180 transition count 210
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 856 place count 180 transition count 210
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -83
Deduced a syphon composed of 142 places in 0 ms
Iterating global reduction 2 with 28 rules applied. Total rules applied 884 place count 180 transition count 293
Discarding 54 places :
Symmetric choice reduction at 2 with 54 rule applications. Total rules 938 place count 126 transition count 185
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 2 with 54 rules applied. Total rules applied 992 place count 126 transition count 185
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 1070 place count 48 transition count 55
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1148 place count 48 transition count 55
Deduced a syphon composed of 36 places in 0 ms
Applied a total of 1148 rules in 50 ms. Remains 48 /472 variables (removed 424) and now considering 55/474 (removed 419) transitions.
[2024-05-31 23:42:59] [INFO ] Redundant transitions in 13 ms returned []
Running 54 sub problems to find dead transitions.
// Phase 1: matrix 55 rows 48 cols
[2024-05-31 23:42:59] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 23:42:59] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
At refinement iteration 1 (OVERLAPS) 54/101 variables, 47/47 constraints. Problems are: Problem set: 40 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/48 constraints. Problems are: Problem set: 40 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/48 constraints. Problems are: Problem set: 40 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 1/102 variables, 1/49 constraints. Problems are: Problem set: 40 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/49 constraints. Problems are: Problem set: 40 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 1/103 variables, 1/50 constraints. Problems are: Problem set: 40 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/50 constraints. Problems are: Problem set: 40 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/103 variables, 0/50 constraints. Problems are: Problem set: 40 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 50 constraints, problems are : Problem set: 40 solved, 14 unsolved in 270 ms.
Refiners :[State Equation: 48/48 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 40 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 40 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 53/64 variables, 11/11 constraints. Problems are: Problem set: 40 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 1/12 constraints. Problems are: Problem set: 40 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 14/26 constraints. Problems are: Problem set: 40 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/26 constraints. Problems are: Problem set: 40 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 38/102 variables, 37/63 constraints. Problems are: Problem set: 40 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/63 constraints. Problems are: Problem set: 40 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/103 variables, 1/64 constraints. Problems are: Problem set: 40 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/64 constraints. Problems are: Problem set: 40 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/103 variables, 0/64 constraints. Problems are: Problem set: 40 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 64 constraints, problems are : Problem set: 40 solved, 14 unsolved in 245 ms.
Refiners :[State Equation: 48/48 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 14/54 constraints, Known Traps: 0/0 constraints]
After SMT, in 529ms problems are : Problem set: 40 solved, 14 unsolved
Search for dead transitions found 40 dead transitions in 530ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 48/472 places, 15/474 transitions.
Graph (complete) has 35 edges and 48 vertex of which 12 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.1 ms
Discarding 36 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 12 /48 variables (removed 36) and now considering 15/15 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/472 places, 15/474 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 605 ms. Remains : 12/472 places, 15/474 transitions.
Support contains 4 out of 472 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 474/474 transitions.
Applied a total of 0 rules in 9 ms. Remains 472 /472 variables (removed 0) and now considering 474/474 (removed 0) transitions.
// Phase 1: matrix 474 rows 472 cols
[2024-05-31 23:42:59] [INFO ] Computed 29 invariants in 6 ms
[2024-05-31 23:42:59] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-31 23:42:59] [INFO ] Invariant cache hit.
[2024-05-31 23:43:00] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-05-31 23:43:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 1/946 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/946 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 473 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 946/946 variables, and 501 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 473/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/945 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (OVERLAPS) 1/946 variables, 1/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 946/946 variables, and 974 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
After SMT, in 60132ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Finished structural reductions in LTL mode , in 1 iterations and 60559 ms. Remains : 472/472 places, 474/474 transitions.
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-07 finished in 197800 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||X(X(F(p1)))))))'
Support contains 2 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 478 transition count 485
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 478 transition count 485
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 478 transition count 484
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 19 place count 474 transition count 480
Iterating global reduction 1 with 4 rules applied. Total rules applied 23 place count 474 transition count 480
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 26 place count 474 transition count 477
Applied a total of 26 rules in 19 ms. Remains 474 /485 variables (removed 11) and now considering 477/492 (removed 15) transitions.
// Phase 1: matrix 477 rows 474 cols
[2024-05-31 23:44:00] [INFO ] Computed 29 invariants in 4 ms
[2024-05-31 23:44:00] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-31 23:44:00] [INFO ] Invariant cache hit.
[2024-05-31 23:44:00] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
Running 476 sub problems to find dead transitions.
[2024-05-31 23:44:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 2 (OVERLAPS) 477/950 variables, 473/502 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/950 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 4 (OVERLAPS) 1/951 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/951 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 476 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 951/951 variables, and 503 constraints, problems are : Problem set: 0 solved, 476 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 476/476 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 476 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 2 (OVERLAPS) 477/950 variables, 473/502 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/950 variables, 476/978 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/950 variables, 0/978 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 5 (OVERLAPS) 1/951 variables, 1/979 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/951 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 476 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 951/951 variables, and 979 constraints, problems are : Problem set: 0 solved, 476 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 476/476 constraints, Known Traps: 0/0 constraints]
After SMT, in 60117ms problems are : Problem set: 0 solved, 476 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Starting structural reductions in LTL mode, iteration 1 : 474/485 places, 477/492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60653 ms. Remains : 474/485 places, 477/492 transitions.
Stuttering acceptance computed with spot in 173 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-28b-LTLFireability-08
Product exploration explored 100000 steps with 1223 reset in 132 ms.
Product exploration explored 100000 steps with 1228 reset in 138 ms.
Computed a total of 87 stabilizing places and 87 stable transitions
Graph (complete) has 738 edges and 474 vertex of which 442 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.3 ms
Computed a total of 87 stabilizing places and 87 stable transitions
Detected a total of 87/474 stabilizing places and 87/477 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 33565 steps (138 resets) in 93 ms. (357 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 4 factoid took 168 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-31 23:45:02] [INFO ] Invariant cache hit.
[2024-05-31 23:45:02] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 9 ms returned sat
[2024-05-31 23:45:02] [INFO ] [Real]Absence check using state equation in 210 ms returned sat
[2024-05-31 23:45:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:45:02] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 9 ms returned sat
[2024-05-31 23:45:02] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2024-05-31 23:45:02] [INFO ] Computed and/alt/rep : 471/619/471 causal constraints (skipped 5 transitions) in 25 ms.
[2024-05-31 23:45:04] [INFO ] Added : 208 causal constraints over 42 iterations in 1226 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 477/477 transitions.
Applied a total of 0 rules in 8 ms. Remains 474 /474 variables (removed 0) and now considering 477/477 (removed 0) transitions.
[2024-05-31 23:45:04] [INFO ] Invariant cache hit.
[2024-05-31 23:45:04] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-31 23:45:04] [INFO ] Invariant cache hit.
[2024-05-31 23:45:04] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
Running 476 sub problems to find dead transitions.
[2024-05-31 23:45:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 2 (OVERLAPS) 477/950 variables, 473/502 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/950 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 4 (OVERLAPS) 1/951 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/951 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 476 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 951/951 variables, and 503 constraints, problems are : Problem set: 0 solved, 476 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 476/476 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 476 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 2 (OVERLAPS) 477/950 variables, 473/502 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/950 variables, 476/978 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/950 variables, 0/978 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 5 (OVERLAPS) 1/951 variables, 1/979 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/951 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 476 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 951/951 variables, and 979 constraints, problems are : Problem set: 0 solved, 476 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 476/476 constraints, Known Traps: 0/0 constraints]
After SMT, in 60137ms problems are : Problem set: 0 solved, 476 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Finished structural reductions in LTL mode , in 1 iterations and 60657 ms. Remains : 474/474 places, 477/477 transitions.
Computed a total of 87 stabilizing places and 87 stable transitions
Graph (complete) has 738 edges and 474 vertex of which 442 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Computed a total of 87 stabilizing places and 87 stable transitions
Detected a total of 87/474 stabilizing places and 87/477 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 p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (167 resets) in 116 ms. (341 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (16 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
[2024-05-31 23:46:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 433/473 variables, 28/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 477/950 variables, 473/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/950 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/951 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/951 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/951 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 951/951 variables, and 503 constraints, problems are : Problem set: 0 solved, 1 unsolved in 252 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 433/473 variables, 28/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 477/950 variables, 473/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/950 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/950 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/951 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/951 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/951 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 951/951 variables, and 504 constraints, problems are : Problem set: 0 solved, 1 unsolved in 221 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 478ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 68 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=34 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 2 factoid took 153 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-31 23:46:06] [INFO ] Invariant cache hit.
[2024-05-31 23:46:06] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 9 ms returned sat
[2024-05-31 23:46:06] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2024-05-31 23:46:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:46:06] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 10 ms returned sat
[2024-05-31 23:46:06] [INFO ] [Nat]Absence check using state equation in 203 ms returned sat
[2024-05-31 23:46:06] [INFO ] Computed and/alt/rep : 471/619/471 causal constraints (skipped 5 transitions) in 23 ms.
[2024-05-31 23:46:08] [INFO ] Added : 208 causal constraints over 42 iterations in 1256 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1229 reset in 149 ms.
Product exploration explored 100000 steps with 1230 reset in 149 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 474/474 places, 477/477 transitions.
Graph (trivial) has 387 edges and 474 vertex of which 6 / 474 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 732 edges and 469 vertex of which 437 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.3 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 226 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 226 rules applied. Total rules applied 228 place count 437 transition count 468
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 30 Pre rules applied. Total rules applied 228 place count 437 transition count 470
Deduced a syphon composed of 256 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 258 place count 437 transition count 470
Discarding 167 places :
Symmetric choice reduction at 1 with 167 rule applications. Total rules 425 place count 270 transition count 303
Deduced a syphon composed of 116 places in 1 ms
Iterating global reduction 1 with 167 rules applied. Total rules applied 592 place count 270 transition count 303
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 619 place count 243 transition count 276
Deduced a syphon composed of 89 places in 1 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 646 place count 243 transition count 276
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 176 places in 0 ms
Iterating global reduction 1 with 87 rules applied. Total rules applied 733 place count 243 transition count 277
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 735 place count 243 transition count 275
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 796 place count 182 transition count 213
Deduced a syphon composed of 115 places in 0 ms
Iterating global reduction 2 with 61 rules applied. Total rules applied 857 place count 182 transition count 213
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 116 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 858 place count 182 transition count 213
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 859 place count 181 transition count 212
Deduced a syphon composed of 115 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 860 place count 181 transition count 212
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -88
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 2 with 29 rules applied. Total rules applied 889 place count 181 transition count 300
Discarding 54 places :
Symmetric choice reduction at 2 with 54 rule applications. Total rules 943 place count 127 transition count 192
Deduced a syphon composed of 116 places in 0 ms
Iterating global reduction 2 with 54 rules applied. Total rules applied 997 place count 127 transition count 192
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 1075 place count 49 transition count 62
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 1153 place count 49 transition count 62
Deduced a syphon composed of 38 places in 0 ms
Applied a total of 1153 rules in 46 ms. Remains 49 /474 variables (removed 425) and now considering 62/477 (removed 415) transitions.
[2024-05-31 23:46:08] [INFO ] Redundant transitions in 11 ms returned []
Running 61 sub problems to find dead transitions.
[2024-05-31 23:46:08] [INFO ] Flow matrix only has 61 transitions (discarded 1 similar events)
// Phase 1: matrix 61 rows 49 cols
[2024-05-31 23:46:08] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 23:46:08] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
At refinement iteration 1 (OVERLAPS) 60/108 variables, 48/48 constraints. Problems are: Problem set: 46 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 11/59 constraints. Problems are: Problem set: 46 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/59 constraints. Problems are: Problem set: 46 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 1/109 variables, 1/60 constraints. Problems are: Problem set: 46 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/60 constraints. Problems are: Problem set: 46 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/110 variables, 1/61 constraints. Problems are: Problem set: 46 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/61 constraints. Problems are: Problem set: 46 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/110 variables, 0/61 constraints. Problems are: Problem set: 46 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/110 variables, and 61 constraints, problems are : Problem set: 46 solved, 15 unsolved in 324 ms.
Refiners :[State Equation: 49/49 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 46 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 46 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 59/69 variables, 10/10 constraints. Problems are: Problem set: 46 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 11/21 constraints. Problems are: Problem set: 46 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 15/36 constraints. Problems are: Problem set: 46 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/36 constraints. Problems are: Problem set: 46 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 40/109 variables, 39/75 constraints. Problems are: Problem set: 46 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/75 constraints. Problems are: Problem set: 46 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/110 variables, 1/76 constraints. Problems are: Problem set: 46 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/76 constraints. Problems are: Problem set: 46 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/110 variables, 0/76 constraints. Problems are: Problem set: 46 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/110 variables, and 76 constraints, problems are : Problem set: 46 solved, 15 unsolved in 279 ms.
Refiners :[State Equation: 49/49 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 15/61 constraints, Known Traps: 0/0 constraints]
After SMT, in 614ms problems are : Problem set: 46 solved, 15 unsolved
Search for dead transitions found 46 dead transitions in 615ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 49/474 places, 16/477 transitions.
Graph (complete) has 38 edges and 49 vertex of which 11 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.0 ms
Discarding 38 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 11 /49 variables (removed 38) and now considering 16/16 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/474 places, 16/477 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 686 ms. Remains : 11/474 places, 16/477 transitions.
Support contains 2 out of 474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 474/474 places, 477/477 transitions.
Applied a total of 0 rules in 6 ms. Remains 474 /474 variables (removed 0) and now considering 477/477 (removed 0) transitions.
// Phase 1: matrix 477 rows 474 cols
[2024-05-31 23:46:09] [INFO ] Computed 29 invariants in 6 ms
[2024-05-31 23:46:09] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-31 23:46:09] [INFO ] Invariant cache hit.
[2024-05-31 23:46:09] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
Running 476 sub problems to find dead transitions.
[2024-05-31 23:46:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 2 (OVERLAPS) 477/950 variables, 473/502 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/950 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 4 (OVERLAPS) 1/951 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/951 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 476 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 951/951 variables, and 503 constraints, problems are : Problem set: 0 solved, 476 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 476/476 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 476 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/473 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/473 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 2 (OVERLAPS) 477/950 variables, 473/502 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/950 variables, 476/978 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/950 variables, 0/978 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 5 (OVERLAPS) 1/951 variables, 1/979 constraints. Problems are: Problem set: 0 solved, 476 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/951 variables, 0/979 constraints. Problems are: Problem set: 0 solved, 476 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 951/951 variables, and 979 constraints, problems are : Problem set: 0 solved, 476 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 476/476 constraints, Known Traps: 0/0 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 476 unsolved
Search for dead transitions found 0 dead transitions in 60146ms
Finished structural reductions in LTL mode , in 1 iterations and 60665 ms. Remains : 474/474 places, 477/477 transitions.
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-08 finished in 189967 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 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Graph (trivial) has 403 edges and 485 vertex of which 6 / 485 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 747 edges and 480 vertex of which 448 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 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 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 235 rules applied. Total rules applied 237 place count 447 transition count 247
Reduce places removed 235 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 241 rules applied. Total rules applied 478 place count 212 transition count 241
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 480 place count 211 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 481 place count 210 transition count 240
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 59 Pre rules applied. Total rules applied 481 place count 210 transition count 181
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 599 place count 151 transition count 181
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 626 place count 124 transition count 154
Iterating global reduction 4 with 27 rules applied. Total rules applied 653 place count 124 transition count 154
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 827 place count 37 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 828 place count 37 transition count 66
Discarding 27 places :
Symmetric choice reduction at 5 with 27 rule applications. Total rules 855 place count 10 transition count 13
Iterating global reduction 5 with 27 rules applied. Total rules applied 882 place count 10 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 884 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 885 place count 8 transition count 11
Applied a total of 885 rules in 24 ms. Remains 8 /485 variables (removed 477) and now considering 11/492 (removed 481) transitions.
// Phase 1: matrix 11 rows 8 cols
[2024-05-31 23:47:10] [INFO ] Computed 0 invariants in 3 ms
[2024-05-31 23:47:10] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-31 23:47:10] [INFO ] Invariant cache hit.
[2024-05-31 23:47:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:47:10] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-05-31 23:47:10] [INFO ] Redundant transitions in 11 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-31 23:47:10] [INFO ] Invariant cache hit.
[2024-05-31 23:47:10] [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 62 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 68 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 146ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 146ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/485 places, 11/492 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 267 ms. Remains : 8/485 places, 11/492 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-09
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-09 finished in 323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(((p1&&X(!p2))||G(!p2))))))'
Support contains 5 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 477 transition count 484
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 477 transition count 484
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 477 transition count 483
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 472 transition count 478
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 472 transition count 478
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 31 place count 472 transition count 474
Applied a total of 31 rules in 28 ms. Remains 472 /485 variables (removed 13) and now considering 474/492 (removed 18) transitions.
// Phase 1: matrix 474 rows 472 cols
[2024-05-31 23:47:10] [INFO ] Computed 29 invariants in 1 ms
[2024-05-31 23:47:10] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-31 23:47:10] [INFO ] Invariant cache hit.
[2024-05-31 23:47:10] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-05-31 23:47:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 1/946 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/946 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 473 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 946/946 variables, and 501 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 473/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/945 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (OVERLAPS) 1/946 variables, 1/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 946/946 variables, and 974 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
After SMT, in 60126ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60131ms
Starting structural reductions in LTL mode, iteration 1 : 472/485 places, 474/492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60571 ms. Remains : 472/485 places, 474/492 transitions.
Stuttering acceptance computed with spot in 239 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2, p2]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-10
Product exploration explored 100000 steps with 413 reset in 161 ms.
Product exploration explored 100000 steps with 417 reset in 179 ms.
Computed a total of 87 stabilizing places and 87 stable transitions
Graph (complete) has 735 edges and 472 vertex of which 440 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.3 ms
Computed a total of 87 stabilizing places and 87 stable transitions
Detected a total of 87/472 stabilizing places and 87/474 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X p1), (X (NOT (AND p2 p1))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p2 p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 146 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[p2, p2, p2, p2]
RANDOM walk for 40000 steps (165 resets) in 179 ms. (222 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 1/1 properties
[2024-05-31 23:48:12] [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) 467/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/945 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/946 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/946 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 946/946 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 253 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 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) 467/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/945 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/945 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/946 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/946 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/946 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 946/946 variables, and 502 constraints, problems are : Problem set: 0 solved, 1 unsolved in 257 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 517ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 99 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=99 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X p1), (X (NOT (AND p2 p1))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p2 p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p1 p2))), (F (NOT p1)), (F p2), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 16 factoid took 386 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[p2, p2, p2, p2]
Stuttering acceptance computed with spot in 148 ms :[p2, p2, p2, p2]
Support contains 4 out of 472 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 474/474 transitions.
Applied a total of 0 rules in 11 ms. Remains 472 /472 variables (removed 0) and now considering 474/474 (removed 0) transitions.
[2024-05-31 23:48:13] [INFO ] Invariant cache hit.
[2024-05-31 23:48:13] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-31 23:48:13] [INFO ] Invariant cache hit.
[2024-05-31 23:48:13] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-05-31 23:48:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 1/946 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/946 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 946/946 variables, and 501 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 473/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/945 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (OVERLAPS) 1/946 variables, 1/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 946/946 variables, and 974 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
After SMT, in 60132ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Finished structural reductions in LTL mode , in 1 iterations and 60568 ms. Remains : 472/472 places, 474/474 transitions.
Computed a total of 87 stabilizing places and 87 stable transitions
Graph (complete) has 735 edges and 472 vertex of which 440 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Computed a total of 87 stabilizing places and 87 stable transitions
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X p1), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 109 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[p2, p2, p2, p2]
RANDOM walk for 40000 steps (159 resets) in 234 ms. (170 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
[2024-05-31 23:49:14] [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) 467/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/945 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/946 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/946 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 946/946 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 264 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 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) 467/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/945 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/945 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/946 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/946 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/946 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 946/946 variables, and 502 constraints, problems are : Problem set: 0 solved, 1 unsolved in 250 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 557ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 83 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=83 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X p1), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p2 p1))), (F (NOT (OR (NOT p2) (NOT p1)))), (F p2), (F (NOT (AND (NOT p2) p1))), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 11 factoid took 310 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[p2, p2, p2, p2]
Stuttering acceptance computed with spot in 145 ms :[p2, p2, p2, p2]
Stuttering acceptance computed with spot in 137 ms :[p2, p2, p2, p2]
Product exploration explored 100000 steps with 415 reset in 166 ms.
Product exploration explored 100000 steps with 413 reset in 161 ms.
Support contains 4 out of 472 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 472/472 places, 474/474 transitions.
Applied a total of 0 rules in 8 ms. Remains 472 /472 variables (removed 0) and now considering 474/474 (removed 0) transitions.
[2024-05-31 23:49:16] [INFO ] Invariant cache hit.
[2024-05-31 23:49:16] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-31 23:49:16] [INFO ] Invariant cache hit.
[2024-05-31 23:49:16] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-05-31 23:49:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 1/946 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/946 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 946/946 variables, and 501 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 473/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/945 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (OVERLAPS) 1/946 variables, 1/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 473 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 946/946 variables, and 974 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
After SMT, in 60124ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60129ms
Finished structural reductions in LTL mode , in 1 iterations and 60602 ms. Remains : 472/472 places, 474/474 transitions.
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-10 finished in 186178 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(p1)&&p0) U X(G((p2 U p3)))))'
Support contains 6 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 477 transition count 484
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 477 transition count 484
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 477 transition count 483
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 472 transition count 478
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 472 transition count 478
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 31 place count 472 transition count 474
Applied a total of 31 rules in 21 ms. Remains 472 /485 variables (removed 13) and now considering 474/492 (removed 18) transitions.
[2024-05-31 23:50:16] [INFO ] Invariant cache hit.
[2024-05-31 23:50:16] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-31 23:50:16] [INFO ] Invariant cache hit.
[2024-05-31 23:50:17] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-05-31 23:50:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 1/946 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/946 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 946/946 variables, and 501 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/471 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/471 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 474/945 variables, 471/500 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/945 variables, 473/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/945 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (OVERLAPS) 1/946 variables, 1/974 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/946 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 473 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 946/946 variables, and 974 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 472/472 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
Starting structural reductions in LTL mode, iteration 1 : 472/485 places, 474/492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60578 ms. Remains : 472/485 places, 474/492 transitions.
Stuttering acceptance computed with spot in 288 ms :[(NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (NOT p3), true, (NOT p3), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p3))), (NOT p3)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-11 finished in 60915 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Graph (trivial) has 403 edges and 485 vertex of which 6 / 485 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 747 edges and 480 vertex of which 448 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 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 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 235 rules applied. Total rules applied 237 place count 447 transition count 247
Reduce places removed 235 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 241 rules applied. Total rules applied 478 place count 212 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 479 place count 211 transition count 241
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 479 place count 211 transition count 180
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 601 place count 150 transition count 180
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 628 place count 123 transition count 153
Iterating global reduction 3 with 27 rules applied. Total rules applied 655 place count 123 transition count 153
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 827 place count 37 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 828 place count 37 transition count 66
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 856 place count 9 transition count 11
Iterating global reduction 4 with 28 rules applied. Total rules applied 884 place count 9 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 886 place count 8 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 887 place count 7 transition count 9
Applied a total of 887 rules in 17 ms. Remains 7 /485 variables (removed 478) and now considering 9/492 (removed 483) transitions.
// Phase 1: matrix 9 rows 7 cols
[2024-05-31 23:51:17] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 23:51:17] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-31 23:51:17] [INFO ] Invariant cache hit.
[2024-05-31 23:51:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:51:17] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2024-05-31 23:51:17] [INFO ] Redundant transitions in 11 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-31 23:51:17] [INFO ] Invariant cache hit.
[2024-05-31 23:51:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1/16 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 8 constraints, problems are : Problem set: 0 solved, 5 unsolved in 71 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 2/15 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 1/16 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 13 constraints, problems are : Problem set: 0 solved, 5 unsolved in 54 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 127ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 127ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/485 places, 9/492 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 421 ms. Remains : 7/485 places, 9/492 transitions.
Stuttering acceptance computed with spot in 295 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-12
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-12 finished in 726 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Graph (trivial) has 399 edges and 485 vertex of which 6 / 485 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 747 edges and 480 vertex of which 448 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 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 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 235 rules applied. Total rules applied 237 place count 447 transition count 247
Reduce places removed 235 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 239 rules applied. Total rules applied 476 place count 212 transition count 243
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 58 Pre rules applied. Total rules applied 476 place count 212 transition count 185
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 592 place count 154 transition count 185
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 618 place count 128 transition count 159
Iterating global reduction 2 with 26 rules applied. Total rules applied 644 place count 128 transition count 159
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 814 place count 43 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 815 place count 43 transition count 73
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 841 place count 17 transition count 22
Iterating global reduction 3 with 26 rules applied. Total rules applied 867 place count 17 transition count 22
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 873 place count 14 transition count 21
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 875 place count 14 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 876 place count 13 transition count 20
Applied a total of 876 rules in 15 ms. Remains 13 /485 variables (removed 472) and now considering 20/492 (removed 472) transitions.
[2024-05-31 23:51:18] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
// Phase 1: matrix 18 rows 13 cols
[2024-05-31 23:51:18] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 23:51:18] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-31 23:51:18] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2024-05-31 23:51:18] [INFO ] Invariant cache hit.
[2024-05-31 23:51:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:51:18] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-31 23:51:18] [INFO ] Redundant transitions in 11 ms returned []
Running 18 sub problems to find dead transitions.
[2024-05-31 23:51:18] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2024-05-31 23:51:18] [INFO ] Invariant cache hit.
[2024-05-31 23:51:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 17/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 1/31 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 14 constraints, problems are : Problem set: 0 solved, 18 unsolved in 124 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 17/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1/31 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/31 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 32 constraints, problems are : Problem set: 0 solved, 18 unsolved in 152 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 314ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 314ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/485 places, 20/492 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 420 ms. Remains : 13/485 places, 20/492 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-13
Product exploration explored 100000 steps with 7958 reset in 187 ms.
Product exploration explored 100000 steps with 7745 reset in 155 ms.
Computed a total of 4 stabilizing places and 8 stable transitions
Computed a total of 4 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 202 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 9619 steps (877 resets) in 32 ms. (291 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 13 /13 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-05-31 23:51:19] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2024-05-31 23:51:19] [INFO ] Invariant cache hit.
[2024-05-31 23:51:19] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-31 23:51:19] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2024-05-31 23:51:19] [INFO ] Invariant cache hit.
[2024-05-31 23:51:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:51:19] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-31 23:51:19] [INFO ] Redundant transitions in 10 ms returned []
Running 18 sub problems to find dead transitions.
[2024-05-31 23:51:19] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2024-05-31 23:51:19] [INFO ] Invariant cache hit.
[2024-05-31 23:51:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 17/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 1/31 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 14 constraints, problems are : Problem set: 0 solved, 18 unsolved in 127 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 17/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1/31 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/31 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 32 constraints, problems are : Problem set: 0 solved, 18 unsolved in 154 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 290ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 290ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 361 ms. Remains : 13/13 places, 20/20 transitions.
Computed a total of 4 stabilizing places and 8 stable transitions
Computed a total of 4 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 5131 steps (450 resets) in 16 ms. (301 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7892 reset in 104 ms.
Product exploration explored 100000 steps with 7958 reset in 90 ms.
Support contains 4 out of 13 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13/13 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-05-31 23:51:20] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2024-05-31 23:51:20] [INFO ] Invariant cache hit.
[2024-05-31 23:51:20] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-31 23:51:20] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2024-05-31 23:51:20] [INFO ] Invariant cache hit.
[2024-05-31 23:51:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:51:20] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-31 23:51:20] [INFO ] Redundant transitions in 14 ms returned []
Running 18 sub problems to find dead transitions.
[2024-05-31 23:51:20] [INFO ] Flow matrix only has 18 transitions (discarded 2 similar events)
[2024-05-31 23:51:20] [INFO ] Invariant cache hit.
[2024-05-31 23:51:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 17/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 1/31 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 14 constraints, problems are : Problem set: 0 solved, 18 unsolved in 124 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 17/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 16/31 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1/31 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/31 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 32 constraints, problems are : Problem set: 0 solved, 18 unsolved in 168 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 301ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 301ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 382 ms. Remains : 13/13 places, 20/20 transitions.
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-13 finished in 3019 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(p1))))'
Support contains 2 out of 485 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Graph (trivial) has 402 edges and 485 vertex of which 6 / 485 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 747 edges and 480 vertex of which 448 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.4 ms
Discarding 32 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 234 transitions
Trivial Post-agglo rules discarded 234 transitions
Performed 234 trivial Post agglomeration. Transition count delta: 234
Iterating post reduction 0 with 234 rules applied. Total rules applied 236 place count 447 transition count 248
Reduce places removed 234 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 239 rules applied. Total rules applied 475 place count 213 transition count 243
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 477 place count 212 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 478 place count 211 transition count 242
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 58 Pre rules applied. Total rules applied 478 place count 211 transition count 184
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 594 place count 153 transition count 184
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 621 place count 126 transition count 157
Iterating global reduction 4 with 27 rules applied. Total rules applied 648 place count 126 transition count 157
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 4 with 174 rules applied. Total rules applied 822 place count 39 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 823 place count 39 transition count 69
Discarding 26 places :
Symmetric choice reduction at 5 with 26 rule applications. Total rules 849 place count 13 transition count 18
Iterating global reduction 5 with 26 rules applied. Total rules applied 875 place count 13 transition count 18
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 5 with 4 rules applied. Total rules applied 879 place count 11 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 880 place count 10 transition count 16
Applied a total of 880 rules in 26 ms. Remains 10 /485 variables (removed 475) and now considering 16/492 (removed 476) transitions.
[2024-05-31 23:51:21] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
// Phase 1: matrix 15 rows 10 cols
[2024-05-31 23:51:21] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 23:51:21] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-31 23:51:21] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
[2024-05-31 23:51:21] [INFO ] Invariant cache hit.
[2024-05-31 23:51:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:51:21] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-31 23:51:21] [INFO ] Redundant transitions in 9 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-31 23:51:21] [INFO ] Flow matrix only has 15 transitions (discarded 1 similar events)
[2024-05-31 23:51:21] [INFO ] Invariant cache hit.
[2024-05-31 23:51:21] [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, 9 unsolved
At refinement iteration 1 (OVERLAPS) 14/21 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3/24 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1/25 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 11 constraints, problems are : Problem set: 0 solved, 9 unsolved in 67 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 14/21 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 3/24 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/25 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/25 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 20 constraints, problems are : Problem set: 0 solved, 9 unsolved in 76 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 147ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 148ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/485 places, 16/492 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 233 ms. Remains : 10/485 places, 16/492 transitions.
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-14
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-14 finished in 327 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||X(G(p1)))) U p2)))'
Support contains 3 out of 485 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 479 transition count 486
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 479 transition count 486
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 479 transition count 485
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 475 transition count 481
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 475 transition count 481
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 24 place count 475 transition count 478
Applied a total of 24 rules in 39 ms. Remains 475 /485 variables (removed 10) and now considering 478/492 (removed 14) transitions.
// Phase 1: matrix 478 rows 475 cols
[2024-05-31 23:51:21] [INFO ] Computed 29 invariants in 5 ms
[2024-05-31 23:51:21] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-31 23:51:21] [INFO ] Invariant cache hit.
[2024-05-31 23:51:22] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Running 477 sub problems to find dead transitions.
[2024-05-31 23:51:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (OVERLAPS) 478/952 variables, 474/503 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/952 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 4 (OVERLAPS) 1/953 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/953 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 477 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 Real declared 953/953 variables, and 504 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 477 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (OVERLAPS) 478/952 variables, 474/503 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/952 variables, 477/980 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/952 variables, 0/980 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 5 (OVERLAPS) 1/953 variables, 1/981 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/953 variables, 0/981 constraints. Problems are: Problem set: 0 solved, 477 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 953/953 variables, and 981 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 0/0 constraints]
After SMT, in 60132ms problems are : Problem set: 0 solved, 477 unsolved
Search for dead transitions found 0 dead transitions in 60138ms
Starting structural reductions in LTL mode, iteration 1 : 475/485 places, 478/492 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60571 ms. Remains : 475/485 places, 478/492 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-15
Product exploration explored 100000 steps with 463 reset in 225 ms.
Product exploration explored 100000 steps with 446 reset in 349 ms.
Computed a total of 88 stabilizing places and 88 stable transitions
Graph (complete) has 739 edges and 475 vertex of which 443 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.4 ms
Computed a total of 88 stabilizing places and 88 stable transitions
Detected a total of 88/475 stabilizing places and 88/478 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p2)), (X (AND (NOT p2) p0)), (X p0), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 224 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
RANDOM walk for 40000 steps (165 resets) in 91 ms. (434 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (17 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
[2024-05-31 23:52:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 439/474 variables, 28/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 478/952 variables, 474/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/953 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/953 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/953 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 953/953 variables, and 504 constraints, problems are : Problem set: 0 solved, 1 unsolved in 223 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 439/474 variables, 28/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/474 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 478/952 variables, 474/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/952 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/952 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/953 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/953 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/953 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 953/953 variables, and 505 constraints, problems are : Problem set: 0 solved, 1 unsolved in 238 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 494ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 197 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=98 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p2)), (X (AND (NOT p2) p0)), (X p0), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p2))), (X (X (AND (NOT p2) p0))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 11 factoid took 356 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 163 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
[2024-05-31 23:52:24] [INFO ] Invariant cache hit.
[2024-05-31 23:52:24] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 9 ms returned sat
[2024-05-31 23:52:25] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2024-05-31 23:52:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:52:25] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 9 ms returned sat
[2024-05-31 23:52:25] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-31 23:52:25] [INFO ] Computed and/alt/rep : 472/620/472 causal constraints (skipped 5 transitions) in 24 ms.
[2024-05-31 23:52:28] [INFO ] Added : 300 causal constraints over 62 iterations in 2626 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 3 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 478/478 transitions.
Applied a total of 0 rules in 6 ms. Remains 475 /475 variables (removed 0) and now considering 478/478 (removed 0) transitions.
[2024-05-31 23:52:28] [INFO ] Invariant cache hit.
[2024-05-31 23:52:28] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-31 23:52:28] [INFO ] Invariant cache hit.
[2024-05-31 23:52:28] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
Running 477 sub problems to find dead transitions.
[2024-05-31 23:52:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (OVERLAPS) 478/952 variables, 474/503 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/952 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 4 (OVERLAPS) 1/953 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/953 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 953/953 variables, and 504 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 477 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (OVERLAPS) 478/952 variables, 474/503 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/952 variables, 477/980 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/952 variables, 0/980 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 5 (OVERLAPS) 1/953 variables, 1/981 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/953 variables, 0/981 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 953/953 variables, and 981 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 0/0 constraints]
After SMT, in 60108ms problems are : Problem set: 0 solved, 477 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Finished structural reductions in LTL mode , in 1 iterations and 60536 ms. Remains : 475/475 places, 478/478 transitions.
Computed a total of 88 stabilizing places and 88 stable transitions
Graph (complete) has 739 edges and 475 vertex of which 443 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.12 ms
Computed a total of 88 stabilizing places and 88 stable transitions
Detected a total of 88/475 stabilizing places and 88/478 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 203 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
RANDOM walk for 40000 steps (164 resets) in 129 ms. (307 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) p0 p1), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X p1)), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 11 factoid took 352 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
[2024-05-31 23:53:29] [INFO ] Invariant cache hit.
[2024-05-31 23:53:30] [INFO ] [Real]Absence check using 0 positive and 29 generalized place invariants in 9 ms returned sat
[2024-05-31 23:53:30] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2024-05-31 23:53:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:53:30] [INFO ] [Nat]Absence check using 0 positive and 29 generalized place invariants in 9 ms returned sat
[2024-05-31 23:53:30] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-05-31 23:53:30] [INFO ] Computed and/alt/rep : 472/620/472 causal constraints (skipped 5 transitions) in 25 ms.
[2024-05-31 23:53:33] [INFO ] Added : 300 causal constraints over 62 iterations in 2846 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 150 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Product exploration explored 100000 steps with 454 reset in 136 ms.
Product exploration explored 100000 steps with 451 reset in 157 ms.
Applying partial POR strategy [false, false, true, false, true]
Stuttering acceptance computed with spot in 245 ms :[(NOT p2), (NOT p2), (NOT p1), (AND (NOT p0) (NOT p1)), true]
Support contains 3 out of 475 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 475/475 places, 478/478 transitions.
Graph (trivial) has 386 edges and 475 vertex of which 6 / 475 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 733 edges and 470 vertex of which 438 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.0 ms
Discarding 32 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 226 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 226 rules applied. Total rules applied 228 place count 438 transition count 469
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 30 Pre rules applied. Total rules applied 228 place count 438 transition count 471
Deduced a syphon composed of 256 places in 0 ms
Iterating global reduction 1 with 30 rules applied. Total rules applied 258 place count 438 transition count 471
Discarding 167 places :
Symmetric choice reduction at 1 with 167 rule applications. Total rules 425 place count 271 transition count 304
Deduced a syphon composed of 116 places in 0 ms
Iterating global reduction 1 with 167 rules applied. Total rules applied 592 place count 271 transition count 304
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 619 place count 244 transition count 277
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 646 place count 244 transition count 277
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 176 places in 0 ms
Iterating global reduction 1 with 87 rules applied. Total rules applied 733 place count 244 transition count 278
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 735 place count 244 transition count 276
Discarding 61 places :
Symmetric choice reduction at 2 with 61 rule applications. Total rules 796 place count 183 transition count 214
Deduced a syphon composed of 115 places in 0 ms
Iterating global reduction 2 with 61 rules applied. Total rules applied 857 place count 183 transition count 214
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 116 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 858 place count 183 transition count 214
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 859 place count 182 transition count 213
Deduced a syphon composed of 115 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 860 place count 182 transition count 213
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -85
Deduced a syphon composed of 143 places in 0 ms
Iterating global reduction 2 with 28 rules applied. Total rules applied 888 place count 182 transition count 298
Discarding 52 places :
Symmetric choice reduction at 2 with 52 rule applications. Total rules 940 place count 130 transition count 194
Deduced a syphon composed of 116 places in 0 ms
Iterating global reduction 2 with 52 rules applied. Total rules applied 992 place count 130 transition count 194
Discarding 75 places :
Symmetric choice reduction at 2 with 75 rule applications. Total rules 1067 place count 55 transition count 69
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 2 with 75 rules applied. Total rules applied 1142 place count 55 transition count 69
Deduced a syphon composed of 41 places in 0 ms
Applied a total of 1142 rules in 47 ms. Remains 55 /475 variables (removed 420) and now considering 69/478 (removed 409) transitions.
[2024-05-31 23:53:34] [INFO ] Redundant transitions in 32 ms returned []
Running 68 sub problems to find dead transitions.
[2024-05-31 23:53:34] [INFO ] Flow matrix only has 68 transitions (discarded 1 similar events)
// Phase 1: matrix 68 rows 55 cols
[2024-05-31 23:53:34] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 23:53:34] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
At refinement iteration 1 (OVERLAPS) 67/121 variables, 54/54 constraints. Problems are: Problem set: 49 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 13/67 constraints. Problems are: Problem set: 49 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/67 constraints. Problems are: Problem set: 49 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 1/122 variables, 1/68 constraints. Problems are: Problem set: 49 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/68 constraints. Problems are: Problem set: 49 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 1/123 variables, 1/69 constraints. Problems are: Problem set: 49 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/69 constraints. Problems are: Problem set: 49 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 0/123 variables, 0/69 constraints. Problems are: Problem set: 49 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 69 constraints, problems are : Problem set: 49 solved, 19 unsolved in 506 ms.
Refiners :[State Equation: 55/55 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 49 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 49 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 66/79 variables, 13/13 constraints. Problems are: Problem set: 49 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 13/26 constraints. Problems are: Problem set: 49 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 19/45 constraints. Problems are: Problem set: 49 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/45 constraints. Problems are: Problem set: 49 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 43/122 variables, 42/87 constraints. Problems are: Problem set: 49 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 0/87 constraints. Problems are: Problem set: 49 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 1/123 variables, 1/88 constraints. Problems are: Problem set: 49 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/88 constraints. Problems are: Problem set: 49 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/123 variables, 0/88 constraints. Problems are: Problem set: 49 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 88 constraints, problems are : Problem set: 49 solved, 19 unsolved in 393 ms.
Refiners :[State Equation: 55/55 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 19/68 constraints, Known Traps: 0/0 constraints]
After SMT, in 940ms problems are : Problem set: 49 solved, 19 unsolved
Search for dead transitions found 49 dead transitions in 942ms
Found 49 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 49 transitions
Dead transitions reduction (with SMT) removed 49 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 55/475 places, 20/478 transitions.
Graph (complete) has 46 edges and 55 vertex of which 14 are kept as prefixes of interest. Removing 41 places using SCC suffix rule.0 ms
Discarding 41 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 14 /55 variables (removed 41) and now considering 20/20 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/475 places, 20/478 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1047 ms. Remains : 14/475 places, 20/478 transitions.
Support contains 3 out of 475 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 478/478 transitions.
Applied a total of 0 rules in 5 ms. Remains 475 /475 variables (removed 0) and now considering 478/478 (removed 0) transitions.
// Phase 1: matrix 478 rows 475 cols
[2024-05-31 23:53:35] [INFO ] Computed 29 invariants in 4 ms
[2024-05-31 23:53:35] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-31 23:53:35] [INFO ] Invariant cache hit.
[2024-05-31 23:53:35] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Running 477 sub problems to find dead transitions.
[2024-05-31 23:53:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (OVERLAPS) 478/952 variables, 474/503 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/952 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 4 (OVERLAPS) 1/953 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/953 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 477 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 1.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.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 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.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 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 953/953 variables, and 504 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 477 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/474 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/474 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 2 (OVERLAPS) 478/952 variables, 474/503 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/952 variables, 477/980 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/952 variables, 0/980 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 5 (OVERLAPS) 1/953 variables, 1/981 constraints. Problems are: Problem set: 0 solved, 477 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/953 variables, 0/981 constraints. Problems are: Problem set: 0 solved, 477 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 953/953 variables, and 981 constraints, problems are : Problem set: 0 solved, 477 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 475/475 constraints, PredecessorRefiner: 477/477 constraints, Known Traps: 0/0 constraints]
After SMT, in 60144ms problems are : Problem set: 0 solved, 477 unsolved
Search for dead transitions found 0 dead transitions in 60150ms
Finished structural reductions in LTL mode , in 1 iterations and 60512 ms. Remains : 475/475 places, 478/478 transitions.
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-15 finished in 194441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(X(G(p1)))))'
Found a Lengthening insensitive property : GPUForwardProgress-PT-28b-LTLFireability-03
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 2 out of 485 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Graph (trivial) has 403 edges and 485 vertex of which 6 / 485 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 747 edges and 480 vertex of which 448 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.4 ms
Discarding 32 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 235 transitions
Trivial Post-agglo rules discarded 235 transitions
Performed 235 trivial Post agglomeration. Transition count delta: 235
Iterating post reduction 0 with 235 rules applied. Total rules applied 237 place count 447 transition count 247
Reduce places removed 235 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 241 rules applied. Total rules applied 478 place count 212 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 479 place count 211 transition count 241
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 479 place count 211 transition count 181
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 599 place count 151 transition count 181
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 626 place count 124 transition count 154
Iterating global reduction 3 with 27 rules applied. Total rules applied 653 place count 124 transition count 154
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 823 place count 39 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 824 place count 39 transition count 68
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 851 place count 12 transition count 15
Iterating global reduction 4 with 27 rules applied. Total rules applied 878 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 4 with 2 rules applied. Total rules applied 880 place count 11 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 881 place count 10 transition count 13
Applied a total of 881 rules in 19 ms. Remains 10 /485 variables (removed 475) and now considering 13/492 (removed 479) transitions.
// Phase 1: matrix 13 rows 10 cols
[2024-05-31 23:54:36] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 23:54:36] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-31 23:54:36] [INFO ] Invariant cache hit.
[2024-05-31 23:54:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:54:36] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-05-31 23:54:36] [INFO ] Invariant cache hit.
[2024-05-31 23:54:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/20 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 2/22 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1/23 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 11 constraints, problems are : Problem set: 0 solved, 9 unsolved in 68 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 12/20 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/22 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/23 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/23 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 20 constraints, problems are : Problem set: 0 solved, 9 unsolved in 79 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 153ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 153ms
Starting structural reductions in LI_LTL mode, iteration 1 : 10/485 places, 13/492 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 219 ms. Remains : 10/485 places, 13/492 transitions.
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-03 finished in 505 ms.
FORMULA GPUForwardProgress-PT-28b-LTLFireability-03 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(X(F(p1))))))'
Found a Shortening insensitive property : GPUForwardProgress-PT-28b-LTLFireability-07
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 485 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Graph (trivial) has 401 edges and 485 vertex of which 6 / 485 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 747 edges and 480 vertex of which 448 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.0 ms
Discarding 32 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 236 transitions
Trivial Post-agglo rules discarded 236 transitions
Performed 236 trivial Post agglomeration. Transition count delta: 236
Iterating post reduction 0 with 236 rules applied. Total rules applied 238 place count 447 transition count 246
Reduce places removed 236 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 242 rules applied. Total rules applied 480 place count 211 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 481 place count 210 transition count 240
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 58 Pre rules applied. Total rules applied 481 place count 210 transition count 182
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 3 with 116 rules applied. Total rules applied 597 place count 152 transition count 182
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 624 place count 125 transition count 155
Iterating global reduction 3 with 27 rules applied. Total rules applied 651 place count 125 transition count 155
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 821 place count 40 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 822 place count 40 transition count 69
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 849 place count 13 transition count 16
Iterating global reduction 4 with 27 rules applied. Total rules applied 876 place count 13 transition count 16
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 878 place count 12 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 879 place count 11 transition count 14
Applied a total of 879 rules in 13 ms. Remains 11 /485 variables (removed 474) and now considering 14/492 (removed 478) transitions.
// Phase 1: matrix 14 rows 11 cols
[2024-05-31 23:54:36] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 23:54:36] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-31 23:54:36] [INFO ] Invariant cache hit.
[2024-05-31 23:54:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:54:36] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Running 10 sub problems to find dead transitions.
[2024-05-31 23:54:36] [INFO ] Invariant cache hit.
[2024-05-31 23:54:36] [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, 10 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4/24 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1/25 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 12 constraints, problems are : Problem set: 0 solved, 10 unsolved in 70 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 4/24 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1/25 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/25 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 22 constraints, problems are : Problem set: 0 solved, 10 unsolved in 100 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 176ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 176ms
Starting structural reductions in LI_LTL mode, iteration 1 : 11/485 places, 14/492 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 237 ms. Remains : 11/485 places, 14/492 transitions.
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-07
Stuttering criterion allowed to conclude after 7 steps with 1 reset in 0 ms.
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-07 finished in 468 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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||X(X(F(p1)))))))'
Found a Shortening insensitive property : GPUForwardProgress-PT-28b-LTLFireability-08
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 485 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Graph (trivial) has 402 edges and 485 vertex of which 6 / 485 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 747 edges and 480 vertex of which 448 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.2 ms
Discarding 32 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 234 transitions
Trivial Post-agglo rules discarded 234 transitions
Performed 234 trivial Post agglomeration. Transition count delta: 234
Iterating post reduction 0 with 234 rules applied. Total rules applied 236 place count 447 transition count 248
Reduce places removed 234 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 239 rules applied. Total rules applied 475 place count 213 transition count 243
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 477 place count 212 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 478 place count 211 transition count 242
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 59 Pre rules applied. Total rules applied 478 place count 211 transition count 183
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 596 place count 152 transition count 183
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 623 place count 125 transition count 156
Iterating global reduction 4 with 27 rules applied. Total rules applied 650 place count 125 transition count 156
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 820 place count 40 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 821 place count 40 transition count 70
Discarding 27 places :
Symmetric choice reduction at 5 with 27 rule applications. Total rules 848 place count 13 transition count 17
Iterating global reduction 5 with 27 rules applied. Total rules applied 875 place count 13 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 879 place count 11 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 880 place count 10 transition count 15
Applied a total of 880 rules in 17 ms. Remains 10 /485 variables (removed 475) and now considering 15/492 (removed 477) transitions.
[2024-05-31 23:54:37] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
// Phase 1: matrix 14 rows 10 cols
[2024-05-31 23:54:37] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 23:54:37] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-31 23:54:37] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2024-05-31 23:54:37] [INFO ] Invariant cache hit.
[2024-05-31 23:54:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:54:37] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Running 8 sub problems to find dead transitions.
[2024-05-31 23:54:37] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2024-05-31 23:54:37] [INFO ] Invariant cache hit.
[2024-05-31 23:54:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 3/23 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/24 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 11 constraints, problems are : Problem set: 0 solved, 8 unsolved in 63 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 3/23 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/24 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 19 constraints, problems are : Problem set: 0 solved, 8 unsolved in 64 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 129ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 129ms
Starting structural reductions in LI_LTL mode, iteration 1 : 10/485 places, 15/492 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 183 ms. Remains : 10/485 places, 15/492 transitions.
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-08 finished in 469 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(((p1&&X(!p2))||G(!p2))))))'
Found a Shortening insensitive property : GPUForwardProgress-PT-28b-LTLFireability-10
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2, p2]
Support contains 5 out of 485 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 485/485 places, 492/492 transitions.
Graph (trivial) has 397 edges and 485 vertex of which 6 / 485 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 747 edges and 480 vertex of which 448 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.4 ms
Discarding 32 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 233 transitions
Trivial Post-agglo rules discarded 233 transitions
Performed 233 trivial Post agglomeration. Transition count delta: 233
Iterating post reduction 0 with 233 rules applied. Total rules applied 235 place count 447 transition count 249
Reduce places removed 233 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 239 rules applied. Total rules applied 474 place count 214 transition count 243
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 477 place count 213 transition count 241
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 479 place count 211 transition count 241
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 58 Pre rules applied. Total rules applied 479 place count 211 transition count 183
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 595 place count 153 transition count 183
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 621 place count 127 transition count 157
Iterating global reduction 4 with 26 rules applied. Total rules applied 647 place count 127 transition count 157
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 4 with 166 rules applied. Total rules applied 813 place count 44 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 814 place count 44 transition count 73
Discarding 26 places :
Symmetric choice reduction at 5 with 26 rule applications. Total rules 840 place count 18 transition count 22
Iterating global reduction 5 with 26 rules applied. Total rules applied 866 place count 18 transition count 22
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 5 with 4 rules applied. Total rules applied 870 place count 16 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 871 place count 15 transition count 20
Applied a total of 871 rules in 19 ms. Remains 15 /485 variables (removed 470) and now considering 20/492 (removed 472) transitions.
[2024-05-31 23:54:37] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
// Phase 1: matrix 19 rows 15 cols
[2024-05-31 23:54:37] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 23:54:37] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-31 23:54:37] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2024-05-31 23:54:37] [INFO ] Invariant cache hit.
[2024-05-31 23:54:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:54:37] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-31 23:54:37] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2024-05-31 23:54:37] [INFO ] Invariant cache hit.
[2024-05-31 23:54:37] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 18/30 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 3/33 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/34 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/34 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/34 variables, and 17 constraints, problems are : Problem set: 0 solved, 17 unsolved in 132 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 18/30 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 3/33 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/34 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/34 variables, and 34 constraints, problems are : Problem set: 0 solved, 17 unsolved in 174 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 315ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 315ms
Starting structural reductions in LI_LTL mode, iteration 1 : 15/485 places, 20/492 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 389 ms. Remains : 15/485 places, 20/492 transitions.
Running random walk in product with property : GPUForwardProgress-PT-28b-LTLFireability-10
Product exploration explored 100000 steps with 8307 reset in 82 ms.
Product exploration explored 100000 steps with 8266 reset in 86 ms.
Computed a total of 6 stabilizing places and 7 stable transitions
Computed a total of 6 stabilizing places and 7 stable transitions
Detected a total of 6/15 stabilizing places and 7/20 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (NOT (AND p2 p1))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p2 p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 14 factoid took 342 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[p2, p2, p2, p2]
RANDOM walk for 5966 steps (505 resets) in 21 ms. (271 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (NOT (AND p2 p1))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p2 p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p1 p2))), (F (NOT p1)), (F p2), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 14 factoid took 609 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[p2, p2, p2, p2]
Stuttering acceptance computed with spot in 167 ms :[p2, p2, p2, p2]
Support contains 4 out of 15 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-05-31 23:54:39] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2024-05-31 23:54:39] [INFO ] Invariant cache hit.
[2024-05-31 23:54:39] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-31 23:54:39] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2024-05-31 23:54:39] [INFO ] Invariant cache hit.
[2024-05-31 23:54:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:54:39] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2024-05-31 23:54:39] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2024-05-31 23:54:39] [INFO ] Invariant cache hit.
[2024-05-31 23:54:39] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 18/30 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 3/33 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/34 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/34 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/34 variables, and 17 constraints, problems are : Problem set: 0 solved, 17 unsolved in 130 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 18/30 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 3/33 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/34 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/34 variables, and 34 constraints, problems are : Problem set: 0 solved, 17 unsolved in 173 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 308ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 308ms
Finished structural reductions in LTL mode , in 1 iterations and 355 ms. Remains : 15/15 places, 20/20 transitions.
Computed a total of 6 stabilizing places and 7 stable transitions
Computed a total of 6 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X p1), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 106 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[p2, p2, p2, p2]
RANDOM walk for 16239 steps (1370 resets) in 25 ms. (624 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X p1), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p2 p1))), (F (NOT (OR (NOT p2) (NOT p1)))), (F p2), (F (NOT (AND (NOT p2) p1))), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 11 factoid took 272 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[p2, p2, p2, p2]
Stuttering acceptance computed with spot in 161 ms :[p2, p2, p2, p2]
Stuttering acceptance computed with spot in 143 ms :[p2, p2, p2, p2]
Product exploration explored 100000 steps with 8326 reset in 81 ms.
Product exploration explored 100000 steps with 8317 reset in 84 ms.
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-05-31 23:54:41] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2024-05-31 23:54:41] [INFO ] Invariant cache hit.
[2024-05-31 23:54:41] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-31 23:54:41] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2024-05-31 23:54:41] [INFO ] Invariant cache hit.
[2024-05-31 23:54:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 23:54:41] [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.
Running 17 sub problems to find dead transitions.
[2024-05-31 23:54:41] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2024-05-31 23:54:41] [INFO ] Invariant cache hit.
[2024-05-31 23:54:41] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 18/30 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 3/33 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/34 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/34 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 34/34 variables, and 17 constraints, problems are : Problem set: 0 solved, 17 unsolved in 126 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 18/30 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 3/33 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 1/34 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 34/34 variables, and 34 constraints, problems are : Problem set: 0 solved, 17 unsolved in 158 ms.
Refiners :[State Equation: 15/15 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 320ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 320ms
Finished structural reductions in LTL mode , in 1 iterations and 375 ms. Remains : 15/15 places, 20/20 transitions.
Treatment of property GPUForwardProgress-PT-28b-LTLFireability-10 finished in 4471 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)))'
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||X(G(p1)))) U p2)))'
[2024-05-31 23:54:42] [INFO ] Flatten gal took : 30 ms
[2024-05-31 23:54:42] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-31 23:54:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 485 places, 492 transitions and 1265 arcs took 9 ms.
Total runtime 1153855 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA GPUForwardProgress-PT-28b-LTLFireability-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA GPUForwardProgress-PT-28b-LTLFireability-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA GPUForwardProgress-PT-28b-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA GPUForwardProgress-PT-28b-LTLFireability-10 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : GPUForwardProgress-PT-28b-LTLFireability-13
FORMULA GPUForwardProgress-PT-28b-LTLFireability-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717200697883

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name GPUForwardProgress-PT-28b-LTLFireability-03
ltl formula formula --ltl=/tmp/2527/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 485 places, 492 transitions and 1265 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.000 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2527/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2527/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2527/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2527/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 486 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 486, there are 510 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~115!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 23
pnml2lts-mc( 0/ 4): unique states count: 388
pnml2lts-mc( 0/ 4): unique transitions count: 3016
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 394
pnml2lts-mc( 0/ 4): - cum. max stack depth: 371
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 394 states 3032 transitions, fanout: 7.695
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.020 sec minimum, 0.025 sec on average)
pnml2lts-mc( 0/ 4): States per second: 13133, Transitions per second: 101067
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 24.3 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 504 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name GPUForwardProgress-PT-28b-LTLFireability-07
ltl formula formula --ltl=/tmp/2527/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 485 places, 492 transitions and 1265 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.120 real 0.010 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2527/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2527/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2527/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2527/ltl_1_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 487 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 486, there are 508 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~134!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 51
pnml2lts-mc( 0/ 4): unique states count: 369
pnml2lts-mc( 0/ 4): unique transitions count: 4729
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 54
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 378
pnml2lts-mc( 0/ 4): - cum. max stack depth: 327
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 378 states 4760 transitions, fanout: 12.593
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.010 sec minimum, 0.017 sec on average)
pnml2lts-mc( 0/ 4): States per second: 18900, Transitions per second: 238000
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 26.6 B/state, compr.: 1.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 504 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name GPUForwardProgress-PT-28b-LTLFireability-08
ltl formula formula --ltl=/tmp/2527/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 485 places, 492 transitions and 1265 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.020 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2527/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2527/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2527/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2527/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 487 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 486, there are 501 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~131!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 443
pnml2lts-mc( 0/ 4): unique states count: 956
pnml2lts-mc( 0/ 4): unique transitions count: 4548
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 282
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 970
pnml2lts-mc( 0/ 4): - cum. max stack depth: 531
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 970 states 4577 transitions, fanout: 4.719
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.030 sec minimum, 0.040 sec on average)
pnml2lts-mc( 0/ 4): States per second: 19400, Transitions per second: 91540
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 24.9 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 504 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name GPUForwardProgress-PT-28b-LTLFireability-10
ltl formula formula --ltl=/tmp/2527/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 485 places, 492 transitions and 1265 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.020 user 0.040 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2527/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2527/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2527/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2527/ltl_3_
pnml2lts-mc( 0/ 4): There are 486 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 486, there are 525 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~234 levels ~10000 states ~44100 transitions
pnml2lts-mc( 3/ 4): ~233 levels ~20000 states ~84408 transitions
pnml2lts-mc( 3/ 4): ~233 levels ~40000 states ~181228 transitions
pnml2lts-mc( 3/ 4): ~233 levels ~80000 states ~382428 transitions
pnml2lts-mc( 3/ 4): ~233 levels ~160000 states ~787664 transitions
pnml2lts-mc( 3/ 4): ~233 levels ~320000 states ~1640668 transitions
pnml2lts-mc( 3/ 4): ~233 levels ~640000 states ~3551176 transitions
pnml2lts-mc( 3/ 4): ~233 levels ~1280000 states ~7376520 transitions
pnml2lts-mc( 3/ 4): ~233 levels ~2560000 states ~16027876 transitions
pnml2lts-mc( 3/ 4): ~233 levels ~5120000 states ~33212896 transitions
pnml2lts-mc( 3/ 4): ~233 levels ~10240000 states ~69686292 transitions
pnml2lts-mc( 3/ 4): ~233 levels ~20480000 states ~147590616 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33545439
pnml2lts-mc( 0/ 4): unique states count: 33546410
pnml2lts-mc( 0/ 4): unique transitions count: 240166238
pnml2lts-mc( 0/ 4): - self-loop count: 49
pnml2lts-mc( 0/ 4): - claim dead count: 206611848
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33546418
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1065
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33546418 states 240166255 transitions, fanout: 7.159
pnml2lts-mc( 0/ 4): Total exploration time 364.220 sec (364.200 sec minimum, 364.212 sec on average)
pnml2lts-mc( 0/ 4): States per second: 92105, Transitions per second: 659399
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 294.6MB, 9.2 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/60.0%
pnml2lts-mc( 0/ 4): Stored 504 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 294.6MB (~256.0MB paged-in)
ltl formula name GPUForwardProgress-PT-28b-LTLFireability-13
ltl formula formula --ltl=/tmp/2527/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 485 places, 492 transitions and 1265 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2527/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2527/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2527/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2527/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 487 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 486, there are 495 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~234 levels ~10000 states ~41844 transitions
pnml2lts-mc( 1/ 4): ~234 levels ~20000 states ~83540 transitions
pnml2lts-mc( 2/ 4): ~233 levels ~40000 states ~182720 transitions
pnml2lts-mc( 2/ 4): ~233 levels ~80000 states ~389052 transitions
pnml2lts-mc( 2/ 4): ~233 levels ~160000 states ~822824 transitions
pnml2lts-mc( 2/ 4): ~233 levels ~320000 states ~1698788 transitions
pnml2lts-mc( 2/ 4): ~233 levels ~640000 states ~3637344 transitions
pnml2lts-mc( 2/ 4): ~233 levels ~1280000 states ~7672640 transitions
pnml2lts-mc( 2/ 4): ~233 levels ~2560000 states ~15800188 transitions
pnml2lts-mc( 2/ 4): ~233 levels ~5120000 states ~33552764 transitions
pnml2lts-mc( 2/ 4): ~233 levels ~10240000 states ~70313324 transitions
pnml2lts-mc( 2/ 4): ~233 levels ~20480000 states ~148701628 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 26468954
pnml2lts-mc( 0/ 4): unique states count: 32386999
pnml2lts-mc( 0/ 4): unique transitions count: 234082390
pnml2lts-mc( 0/ 4): - self-loop count: 357
pnml2lts-mc( 0/ 4): - claim dead count: 177349573
pnml2lts-mc( 0/ 4): - claim found count: 23257491
pnml2lts-mc( 0/ 4): - claim success count: 32387016
pnml2lts-mc( 0/ 4): - cum. max stack depth: 631858
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 32387016 states 234082423 transitions, fanout: 7.228
pnml2lts-mc( 0/ 4): Total exploration time 353.180 sec (353.170 sec minimum, 353.173 sec on average)
pnml2lts-mc( 0/ 4): States per second: 91701, Transitions per second: 662785
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 317.4MB, 10.0 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 98.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 504 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 317.4MB (~256.0MB paged-in)
ltl formula name GPUForwardProgress-PT-28b-LTLFireability-15
ltl formula formula --ltl=/tmp/2527/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 485 places, 492 transitions and 1265 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.020 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2527/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2527/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2527/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2527/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 487 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 486, there are 522 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~234 levels ~10000 states ~42876 transitions
pnml2lts-mc( 0/ 4): ~234 levels ~20000 states ~89760 transitions
pnml2lts-mc( 0/ 4): ~234 levels ~40000 states ~186380 transitions
pnml2lts-mc( 0/ 4): ~234 levels ~80000 states ~384700 transitions
pnml2lts-mc( 1/ 4): ~312 levels ~160000 states ~797892 transitions
pnml2lts-mc( 1/ 4): ~312 levels ~320000 states ~1675000 transitions
pnml2lts-mc( 0/ 4): ~234 levels ~640000 states ~3826656 transitions
pnml2lts-mc( 0/ 4): ~234 levels ~1280000 states ~7958768 transitions
pnml2lts-mc( 0/ 4): ~234 levels ~2560000 states ~16310308 transitions
pnml2lts-mc( 1/ 4): ~312 levels ~5120000 states ~32404560 transitions
pnml2lts-mc( 1/ 4): ~312 levels ~10240000 states ~69334692 transitions
pnml2lts-mc( 1/ 4): ~312 levels ~20480000 states ~144604960 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 22807762
pnml2lts-mc( 0/ 4): unique states count: 28284694
pnml2lts-mc( 0/ 4): unique transitions count: 207267068
pnml2lts-mc( 0/ 4): - self-loop count: 379
pnml2lts-mc( 0/ 4): - claim dead count: 149005069
pnml2lts-mc( 0/ 4): - claim found count: 24116923
pnml2lts-mc( 0/ 4): - claim success count: 28284705
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2304027
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 28284705 states 207267090 transitions, fanout: 7.328
pnml2lts-mc( 0/ 4): Total exploration time 295.390 sec (295.360 sec minimum, 295.383 sec on average)
pnml2lts-mc( 0/ 4): States per second: 95754, Transitions per second: 701673
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 272.0MB, 8.5 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/24.0%
pnml2lts-mc( 0/ 4): Stored 504 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 272.0MB (~256.0MB paged-in)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is GPUForwardProgress-PT-28b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r496-tall-171640603700572"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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