MCC'2024- Execution of r092-tall-171624189800691

About the Execution of ITS-Tools for DES-PT-20b

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
4246.819	2288434.00	5334934.00	3333.80	FFTFFFFFFTTFTTTF	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 08:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 08:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 12 08:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 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 91K 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 DES-PT-20b-LTLCardinality-00
FORMULA_NAME DES-PT-20b-LTLCardinality-01
FORMULA_NAME DES-PT-20b-LTLCardinality-02
FORMULA_NAME DES-PT-20b-LTLCardinality-03
FORMULA_NAME DES-PT-20b-LTLCardinality-04
FORMULA_NAME DES-PT-20b-LTLCardinality-05
FORMULA_NAME DES-PT-20b-LTLCardinality-06
FORMULA_NAME DES-PT-20b-LTLCardinality-07
FORMULA_NAME DES-PT-20b-LTLCardinality-08
FORMULA_NAME DES-PT-20b-LTLCardinality-09
FORMULA_NAME DES-PT-20b-LTLCardinality-10
FORMULA_NAME DES-PT-20b-LTLCardinality-11
FORMULA_NAME DES-PT-20b-LTLCardinality-12
FORMULA_NAME DES-PT-20b-LTLCardinality-13
FORMULA_NAME DES-PT-20b-LTLCardinality-14
FORMULA_NAME DES-PT-20b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716347536208

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-20b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-22 03:12:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 03:12:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 03:12:17] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2024-05-22 03:12:17] [INFO ] Transformed 360 places.
[2024-05-22 03:12:17] [INFO ] Transformed 311 transitions.
[2024-05-22 03:12:17] [INFO ] Found NUPN structural information;
[2024-05-22 03:12:17] [INFO ] Parsed PT model containing 360 places and 311 transitions and 987 arcs in 244 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DES-PT-20b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-20b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 311/311 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 358 transition count 311
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 21 place count 339 transition count 292
Iterating global reduction 1 with 19 rules applied. Total rules applied 40 place count 339 transition count 292
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 51 place count 328 transition count 281
Iterating global reduction 1 with 11 rules applied. Total rules applied 62 place count 328 transition count 281
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 70 place count 328 transition count 273
Applied a total of 70 rules in 169 ms. Remains 328 /360 variables (removed 32) and now considering 273/311 (removed 38) transitions.
// Phase 1: matrix 273 rows 328 cols
[2024-05-22 03:12:18] [INFO ] Computed 63 invariants in 33 ms
[2024-05-22 03:12:18] [INFO ] Implicit Places using invariants in 458 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 494 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 327/360 places, 273/311 transitions.
Applied a total of 0 rules in 10 ms. Remains 327 /327 variables (removed 0) and now considering 273/273 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 696 ms. Remains : 327/360 places, 273/311 transitions.
Support contains 40 out of 327 places after structural reductions.
[2024-05-22 03:12:18] [INFO ] Flatten gal took : 45 ms
[2024-05-22 03:12:18] [INFO ] Flatten gal took : 21 ms
[2024-05-22 03:12:18] [INFO ] Input system was already deterministic with 273 transitions.
Reduction of identical properties reduced properties to check from 23 to 21
RANDOM walk for 40000 steps (346 resets) in 1327 ms. (30 steps per ms) remains 3/21 properties
BEST_FIRST walk for 40004 steps (51 resets) in 191 ms. (208 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (49 resets) in 166 ms. (239 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (50 resets) in 123 ms. (322 steps per ms) remains 3/3 properties
// Phase 1: matrix 273 rows 327 cols
[2024-05-22 03:12:19] [INFO ] Computed 62 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 90/98 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 140/238 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 71/309 variables, 25/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 3/312 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/312 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 260/572 variables, 312/374 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 18/590 variables, 10/384 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/590 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 6/596 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/596 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/598 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/598 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/600 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/600 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/600 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 600/600 variables, and 389 constraints, problems are : Problem set: 0 solved, 3 unsolved in 948 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 327/327 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 90/98 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 140/238 variables, 25/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 71/309 variables, 25/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 03:12:20] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 13 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/309 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3/312 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 260/572 variables, 312/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/572 variables, 2/377 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 03:12:21] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/572 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/572 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 18/590 variables, 10/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/590 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 03:12:21] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/590 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 03:12:21] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/590 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/590 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 6/596 variables, 3/394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/596 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 2/598 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/598 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 2/600 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/600 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 0/600 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 600/600 variables, and 396 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1683 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 327/327 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 2675ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 4488 ms.
Support contains 8 out of 327 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 327/327 places, 273/273 transitions.
Graph (complete) has 681 edges and 327 vertex of which 321 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 321 transition count 253
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 33 place count 306 transition count 253
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 33 place count 306 transition count 243
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 53 place count 296 transition count 243
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 59 place count 290 transition count 237
Iterating global reduction 2 with 6 rules applied. Total rules applied 65 place count 290 transition count 237
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 71 place count 284 transition count 231
Iterating global reduction 2 with 6 rules applied. Total rules applied 77 place count 284 transition count 231
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 2 with 6 rules applied. Total rules applied 83 place count 284 transition count 225
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 85 place count 283 transition count 224
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 85 place count 283 transition count 221
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 91 place count 280 transition count 221
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 237 place count 207 transition count 148
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 241 place count 205 transition count 150
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 243 place count 205 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 245 place count 203 transition count 148
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 247 place count 203 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 249 place count 201 transition count 146
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 251 place count 201 transition count 146
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 252 place count 200 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 253 place count 199 transition count 145
Applied a total of 253 rules in 111 ms. Remains 199 /327 variables (removed 128) and now considering 145/273 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 199/327 places, 145/273 transitions.
RANDOM walk for 40000 steps (1563 resets) in 553 ms. (72 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (339 resets) in 103 ms. (384 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (291 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (286 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1277328 steps, run timeout after 3001 ms. (steps per millisecond=425 ) properties seen :0 out of 3
Probabilistic random walk after 1277328 steps, saw 172573 distinct states, run finished after 3004 ms. (steps per millisecond=425 ) properties seen :0
// Phase 1: matrix 145 rows 199 cols
[2024-05-22 03:12:30] [INFO ] Computed 60 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 33/41 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4/45 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 105/150 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 22/172 variables, 19/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/173 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/173 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 126/299 variables, 173/230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/299 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 26/325 variables, 7/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/325 variables, 3/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/325 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 19/344 variables, 19/259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/344 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/344 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/344 variables, and 259 constraints, problems are : Problem set: 0 solved, 3 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 33/41 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 4/45 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 105/150 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 22/172 variables, 19/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/173 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/173 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 126/299 variables, 173/230 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/299 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 03:12:30] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-22 03:12:30] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/299 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/299 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 26/325 variables, 7/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/325 variables, 3/245 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 03:12:31] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/325 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/325 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 19/344 variables, 19/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 03:12:31] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/344 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/344 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/344 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 344/344 variables, and 266 constraints, problems are : Problem set: 0 solved, 3 unsolved in 864 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 1127ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1278 ms.
Support contains 8 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 145/145 transitions.
Applied a total of 0 rules in 8 ms. Remains 199 /199 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 199/199 places, 145/145 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 145/145 transitions.
Applied a total of 0 rules in 6 ms. Remains 199 /199 variables (removed 0) and now considering 145/145 (removed 0) transitions.
[2024-05-22 03:12:32] [INFO ] Invariant cache hit.
[2024-05-22 03:12:32] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-22 03:12:32] [INFO ] Invariant cache hit.
[2024-05-22 03:12:32] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2024-05-22 03:12:32] [INFO ] Redundant transitions in 3 ms returned []
Running 140 sub problems to find dead transitions.
[2024-05-22 03:12:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (OVERLAPS) 2/196 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (OVERLAPS) 2/198 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 140 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 145/343 variables, 198/258 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-22 03:12:36] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-22 03:12:37] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 2 ms to minimize.
[2024-05-22 03:12:37] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-05-22 03:12:37] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-22 03:12:38] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 4/263 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/343 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 11 (OVERLAPS) 1/344 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-22 03:12:39] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-22 03:12:39] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-22 03:12:39] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/344 variables, 3/267 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-22 03:12:40] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/344 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-22 03:12:41] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
[2024-05-22 03:12:41] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/344 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-22 03:12:42] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/344 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/344 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-22 03:12:44] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-22 03:12:44] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/344 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-22 03:12:45] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/344 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/344 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 20 (OVERLAPS) 0/344 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/344 variables, and 274 constraints, problems are : Problem set: 0 solved, 140 unsolved in 14924 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/194 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 2/196 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (OVERLAPS) 2/198 variables, 7/70 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (OVERLAPS) 145/343 variables, 198/272 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/343 variables, 140/412 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-05-22 03:12:54] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/343 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/343 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 14 (OVERLAPS) 1/344 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/344 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/344 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 140 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 344/344 variables, and 415 constraints, problems are : Problem set: 0 solved, 140 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 16/16 constraints]
After SMT, in 45032ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 45035ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45408 ms. Remains : 199/199 places, 145/145 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 199 transition count 145
Applied a total of 1 rules in 12 ms. Remains 199 /199 variables (removed 0) and now considering 145/145 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 145 rows 199 cols
[2024-05-22 03:13:18] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 03:13:18] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 03:13:18] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 03:13:18] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 36 ms returned sat
[2024-05-22 03:13:18] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-22 03:13:18] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-22 03:13:18] [INFO ] After 359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 618 ms.
FORMULA DES-PT-20b-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DES-PT-20b-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 139 stabilizing places and 131 stable transitions
Graph (complete) has 681 edges and 327 vertex of which 321 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.13 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 6 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 273/273 transitions.
Graph (complete) has 681 edges and 327 vertex of which 321 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 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 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 320 transition count 257
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 308 transition count 256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 307 transition count 256
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 27 place count 307 transition count 247
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 45 place count 298 transition count 247
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 50 place count 293 transition count 242
Iterating global reduction 3 with 5 rules applied. Total rules applied 55 place count 293 transition count 242
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 60 place count 288 transition count 237
Iterating global reduction 3 with 5 rules applied. Total rules applied 65 place count 288 transition count 237
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 3 with 5 rules applied. Total rules applied 70 place count 288 transition count 232
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 72 place count 287 transition count 231
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 72 place count 287 transition count 229
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 76 place count 285 transition count 229
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 5 with 150 rules applied. Total rules applied 226 place count 210 transition count 154
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
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 230 place count 208 transition count 156
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 232 place count 206 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 233 place count 205 transition count 154
Applied a total of 233 rules in 89 ms. Remains 205 /327 variables (removed 122) and now considering 154/273 (removed 119) transitions.
// Phase 1: matrix 154 rows 205 cols
[2024-05-22 03:13:19] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 03:13:19] [INFO ] Implicit Places using invariants in 247 ms returned []
[2024-05-22 03:13:19] [INFO ] Invariant cache hit.
[2024-05-22 03:13:19] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2024-05-22 03:13:19] [INFO ] Redundant transitions in 4 ms returned []
Running 150 sub problems to find dead transitions.
[2024-05-22 03:13:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 1/202 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (OVERLAPS) 2/204 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 150 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 154/358 variables, 204/262 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-22 03:13:23] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-22 03:13:24] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-22 03:13:24] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-22 03:13:24] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-22 03:13:25] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-22 03:13:26] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-22 03:13:26] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 13 (OVERLAPS) 1/359 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-22 03:13:28] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/359 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/359 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-22 03:13:30] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/359 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/359 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 18 (OVERLAPS) 0/359 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 359/359 variables, and 272 constraints, problems are : Problem set: 0 solved, 150 unsolved in 14117 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 1/202 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 2/204 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 154/358 variables, 204/271 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 150/421 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-22 03:13:38] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 13 (OVERLAPS) 1/359 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/359 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 359/359 variables, and 423 constraints, problems are : Problem set: 0 solved, 150 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 10/10 constraints]
After SMT, in 44204ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 44206ms
Starting structural reductions in SI_LTL mode, iteration 1 : 205/327 places, 154/273 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44797 ms. Remains : 205/327 places, 154/273 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-20b-LTLCardinality-00
Product exploration explored 100000 steps with 4516 reset in 374 ms.
Product exploration explored 100000 steps with 4558 reset in 266 ms.
Computed a total of 97 stabilizing places and 92 stable transitions
Computed a total of 97 stabilizing places and 92 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 95 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (1846 resets) in 244 ms. (163 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (375 resets) in 195 ms. (204 steps per ms) remains 1/1 properties
[2024-05-22 03:14:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 99/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/140 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/166 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/173 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 130/303 variables, 173/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/316 variables, 9/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/316 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/316 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 23/339 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/339 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/339 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 20/359 variables, 20/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/359 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/359 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 359/359 variables, and 263 constraints, problems are : Problem set: 0 solved, 1 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 205/205 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) 99/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/140 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 03:14:05] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/166 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/173 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 130/303 variables, 173/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/303 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/316 variables, 9/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/316 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/316 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/316 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 23/339 variables, 3/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/339 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/339 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 20/359 variables, 20/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/359 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/359 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 359/359 variables, and 265 constraints, problems are : Problem set: 0 solved, 1 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 408ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 48 ms.
Support contains 4 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 154/154 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 205 transition count 153
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 5 place count 203 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 202 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 202 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 202 transition count 149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 202 transition count 148
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 201 transition count 148
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 201 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 199 transition count 146
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 199 transition count 146
Applied a total of 15 rules in 32 ms. Remains 199 /205 variables (removed 6) and now considering 146/154 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 199/205 places, 146/154 transitions.
RANDOM walk for 40000 steps (1846 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (386 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1988548 steps, run timeout after 3001 ms. (steps per millisecond=662 ) properties seen :0 out of 1
Probabilistic random walk after 1988548 steps, saw 278377 distinct states, run finished after 3003 ms. (steps per millisecond=662 ) properties seen :0
// Phase 1: matrix 146 rows 199 cols
[2024-05-22 03:14:08] [INFO ] Computed 59 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/107 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 32/139 variables, 21/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 23/162 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/169 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/169 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 122/291 variables, 169/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/303 variables, 7/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/303 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/303 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 23/326 variables, 4/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/326 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/326 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 19/345 variables, 19/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/345 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/345 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 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) 7/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/107 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 32/139 variables, 21/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 23/162 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/169 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/169 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 122/291 variables, 169/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/303 variables, 7/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/303 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/303 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/303 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 23/326 variables, 4/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/326 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/326 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 19/345 variables, 19/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/345 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/345 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 379ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 49 ms.
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 146/146 transitions.
Applied a total of 0 rules in 6 ms. Remains 199 /199 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 199/199 places, 146/146 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 146/146 transitions.
Applied a total of 0 rules in 5 ms. Remains 199 /199 variables (removed 0) and now considering 146/146 (removed 0) transitions.
[2024-05-22 03:14:09] [INFO ] Invariant cache hit.
[2024-05-22 03:14:09] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-22 03:14:09] [INFO ] Invariant cache hit.
[2024-05-22 03:14:09] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
[2024-05-22 03:14:09] [INFO ] Redundant transitions in 3 ms returned []
Running 142 sub problems to find dead transitions.
[2024-05-22 03:14:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 1/196 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 2/198 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 142 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 146/344 variables, 198/257 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-22 03:14:12] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-22 03:14:13] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-22 03:14:13] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/344 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (OVERLAPS) 1/345 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-22 03:14:14] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-22 03:14:14] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 2 ms to minimize.
[2024-05-22 03:14:15] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 3/264 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-22 03:14:15] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-05-22 03:14:15] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/345 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 14 (OVERLAPS) 0/345 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 266 constraints, problems are : Problem set: 0 solved, 142 unsolved in 9096 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 1/196 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 2/198 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (OVERLAPS) 146/344 variables, 198/265 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/344 variables, 142/407 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/344 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 13 (OVERLAPS) 1/345 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-22 03:14:31] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/345 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-22 03:14:40] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/345 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 345/345 variables, and 410 constraints, problems are : Problem set: 0 solved, 142 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 10/10 constraints]
After SMT, in 39171ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 39176ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39714 ms. Remains : 199/199 places, 146/146 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 199 transition count 146
Applied a total of 1 rules in 30 ms. Remains 199 /199 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 146 rows 199 cols
[2024-05-22 03:14:48] [INFO ] Computed 59 invariants in 1 ms
[2024-05-22 03:14:48] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 03:14:48] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 03:14:48] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 8 ms returned sat
[2024-05-22 03:14:49] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 03:14:49] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 03:14:49] [INFO ] After 202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 298 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 199 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 6 out of 205 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 205/205 places, 154/154 transitions.
Applied a total of 0 rules in 5 ms. Remains 205 /205 variables (removed 0) and now considering 154/154 (removed 0) transitions.
// Phase 1: matrix 154 rows 205 cols
[2024-05-22 03:14:49] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 03:14:49] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-22 03:14:49] [INFO ] Invariant cache hit.
[2024-05-22 03:14:49] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2024-05-22 03:14:49] [INFO ] Redundant transitions in 1 ms returned []
Running 150 sub problems to find dead transitions.
[2024-05-22 03:14:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 1/202 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (OVERLAPS) 2/204 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 150 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (OVERLAPS) 154/358 variables, 204/262 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-22 03:14:54] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-22 03:14:54] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-22 03:14:54] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-22 03:14:54] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/358 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-22 03:14:56] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-22 03:14:56] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 2 ms to minimize.
[2024-05-22 03:14:57] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 13 (OVERLAPS) 1/359 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-22 03:14:58] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/359 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/359 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-22 03:15:00] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/359 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/359 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 18 (OVERLAPS) 0/359 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 359/359 variables, and 272 constraints, problems are : Problem set: 0 solved, 150 unsolved in 13749 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/201 variables, 18/49 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 1/202 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 2/204 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 154/358 variables, 204/271 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/358 variables, 150/421 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-22 03:15:08] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/358 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/358 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 13 (OVERLAPS) 1/359 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/359 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 150 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 359/359 variables, and 423 constraints, problems are : Problem set: 0 solved, 150 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 10/10 constraints]
After SMT, in 43814ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 43819ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44208 ms. Remains : 205/205 places, 154/154 transitions.
Computed a total of 97 stabilizing places and 92 stable transitions
Computed a total of 97 stabilizing places and 92 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 77 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (1820 resets) in 141 ms. (281 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (398 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
[2024-05-22 03:15:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 99/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/140 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 26/166 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/173 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 130/303 variables, 173/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 13/316 variables, 9/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/316 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/316 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 23/339 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/339 variables, 1/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/339 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 20/359 variables, 20/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/359 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/359 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 359/359 variables, and 263 constraints, problems are : Problem set: 0 solved, 1 unsolved in 721 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 205/205 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) 99/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/140 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 03:15:34] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 12 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/166 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/173 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 130/303 variables, 173/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/303 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 13/316 variables, 9/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/316 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/316 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/316 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 23/339 variables, 3/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/339 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/339 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 20/359 variables, 20/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/359 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/359 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 359/359 variables, and 265 constraints, problems are : Problem set: 0 solved, 1 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 971ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 4 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 154/154 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 205 transition count 153
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 5 place count 203 transition count 151
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 202 transition count 150
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 202 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 202 transition count 149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 202 transition count 148
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 201 transition count 148
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 201 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 199 transition count 146
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 199 transition count 146
Applied a total of 15 rules in 17 ms. Remains 199 /205 variables (removed 6) and now considering 146/154 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 199/205 places, 146/154 transitions.
RANDOM walk for 40000 steps (1903 resets) in 191 ms. (208 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (387 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1897578 steps, run timeout after 3001 ms. (steps per millisecond=632 ) properties seen :0 out of 1
Probabilistic random walk after 1897578 steps, saw 266506 distinct states, run finished after 3001 ms. (steps per millisecond=632 ) properties seen :0
// Phase 1: matrix 146 rows 199 cols
[2024-05-22 03:15:38] [INFO ] Computed 59 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/107 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 32/139 variables, 21/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 23/162 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/169 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/169 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 122/291 variables, 169/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/303 variables, 7/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/303 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/303 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 23/326 variables, 4/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/326 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/326 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 19/345 variables, 19/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/345 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/345 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 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) 7/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/15 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/107 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 32/139 variables, 21/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 23/162 variables, 16/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/169 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/169 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 122/291 variables, 169/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/303 variables, 7/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/303 variables, 2/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/303 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/303 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 23/326 variables, 4/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/326 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/326 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 19/345 variables, 19/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/345 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/345 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 345/345 variables, and 259 constraints, problems are : Problem set: 0 solved, 1 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 405ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 48 ms.
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 146/146 transitions.
Applied a total of 0 rules in 11 ms. Remains 199 /199 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 199/199 places, 146/146 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 146/146 transitions.
Applied a total of 0 rules in 6 ms. Remains 199 /199 variables (removed 0) and now considering 146/146 (removed 0) transitions.
[2024-05-22 03:15:38] [INFO ] Invariant cache hit.
[2024-05-22 03:15:38] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-22 03:15:38] [INFO ] Invariant cache hit.
[2024-05-22 03:15:38] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2024-05-22 03:15:38] [INFO ] Redundant transitions in 3 ms returned []
Running 142 sub problems to find dead transitions.
[2024-05-22 03:15:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 1/196 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 2/198 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 142 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 146/344 variables, 198/257 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-22 03:15:42] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-22 03:15:42] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-22 03:15:42] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/344 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/344 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (OVERLAPS) 1/345 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-22 03:15:44] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-22 03:15:44] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-22 03:15:44] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 3/264 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-22 03:15:45] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-05-22 03:15:45] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/345 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 14 (OVERLAPS) 0/345 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 345/345 variables, and 266 constraints, problems are : Problem set: 0 solved, 142 unsolved in 8991 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 1/196 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 2/198 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 10 (OVERLAPS) 146/344 variables, 198/265 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/344 variables, 142/407 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/344 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 13 (OVERLAPS) 1/345 variables, 1/408 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-22 03:16:00] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/345 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-22 03:16:09] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/345 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 142 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 345/345 variables, and 410 constraints, problems are : Problem set: 0 solved, 142 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 10/10 constraints]
After SMT, in 39053ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 39055ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39370 ms. Remains : 199/199 places, 146/146 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 199 transition count 146
Applied a total of 1 rules in 13 ms. Remains 199 /199 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 146 rows 199 cols
[2024-05-22 03:16:18] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 03:16:18] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 03:16:18] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 03:16:18] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 8 ms returned sat
[2024-05-22 03:16:18] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 03:16:18] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 03:16:18] [INFO ] After 158ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 248 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 115 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 4611 reset in 192 ms.
Product exploration explored 100000 steps with 4548 reset in 210 ms.
Built C files in :
/tmp/ltsmin5823651249228076826
[2024-05-22 03:16:19] [INFO ] Computing symmetric may disable matrix : 154 transitions.
[2024-05-22 03:16:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 03:16:19] [INFO ] Computing symmetric may enable matrix : 154 transitions.
[2024-05-22 03:16:19] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 03:16:19] [INFO ] Computing Do-Not-Accords matrix : 154 transitions.
[2024-05-22 03:16:19] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 03:16:19] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5823651249228076826
Running compilation step : cd /tmp/ltsmin5823651249228076826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 490 ms.
Running link step : cd /tmp/ltsmin5823651249228076826;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5823651249228076826;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17924112432040593794.hoa' '--buchi-type=spotba'
LTSmin run took 1344 ms.
FORMULA DES-PT-20b-LTLCardinality-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-20b-LTLCardinality-00 finished in 182127 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 2 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 273/273 transitions.
Graph (complete) has 681 edges and 327 vertex of which 321 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 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 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 320 transition count 255
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 306 transition count 255
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 306 transition count 245
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 296 transition count 245
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 55 place count 290 transition count 239
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 290 transition count 239
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 67 place count 284 transition count 233
Iterating global reduction 2 with 6 rules applied. Total rules applied 73 place count 284 transition count 233
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 2 with 6 rules applied. Total rules applied 79 place count 284 transition count 227
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 81 place count 283 transition count 226
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 81 place count 283 transition count 223
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 87 place count 280 transition count 223
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 237 place count 205 transition count 148
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 241 place count 203 transition count 150
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 243 place count 201 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 244 place count 200 transition count 148
Applied a total of 244 rules in 47 ms. Remains 200 /327 variables (removed 127) and now considering 148/273 (removed 125) transitions.
// Phase 1: matrix 148 rows 200 cols
[2024-05-22 03:16:21] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 03:16:21] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-22 03:16:21] [INFO ] Invariant cache hit.
[2024-05-22 03:16:21] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
[2024-05-22 03:16:21] [INFO ] Redundant transitions in 1 ms returned []
Running 145 sub problems to find dead transitions.
[2024-05-22 03:16:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 145 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/199 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (OVERLAPS) 148/347 variables, 199/257 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 03:16:23] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 03:16:24] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 03:16:25] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-22 03:16:25] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-22 03:16:25] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (OVERLAPS) 1/348 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 03:16:27] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-22 03:16:27] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-22 03:16:27] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/348 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/348 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 03:16:29] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/348 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/348 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 15 (OVERLAPS) 0/348 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 267 constraints, problems are : Problem set: 0 solved, 145 unsolved in 10691 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 2/199 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 148/347 variables, 199/266 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 145/411 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 03:16:39] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 11 (OVERLAPS) 1/348 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 348/348 variables, and 413 constraints, problems are : Problem set: 0 solved, 145 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 10/10 constraints]
After SMT, in 40753ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 40754ms
Starting structural reductions in SI_LTL mode, iteration 1 : 200/327 places, 148/273 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41225 ms. Remains : 200/327 places, 148/273 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-20b-LTLCardinality-01
Product exploration explored 100000 steps with 5478 reset in 185 ms.
Product exploration explored 100000 steps with 5409 reset in 216 ms.
Computed a total of 95 stabilizing places and 90 stable transitions
Computed a total of 95 stabilizing places and 90 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 3116 steps (177 resets) in 17 ms. (173 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 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Support contains 2 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 148/148 transitions.
Applied a total of 0 rules in 14 ms. Remains 200 /200 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-05-22 03:17:03] [INFO ] Invariant cache hit.
[2024-05-22 03:17:03] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-22 03:17:03] [INFO ] Invariant cache hit.
[2024-05-22 03:17:03] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2024-05-22 03:17:03] [INFO ] Redundant transitions in 0 ms returned []
Running 145 sub problems to find dead transitions.
[2024-05-22 03:17:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 145 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/199 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (OVERLAPS) 148/347 variables, 199/257 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 03:17:05] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 03:17:06] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 03:17:07] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-22 03:17:07] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-22 03:17:07] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (OVERLAPS) 1/348 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 03:17:09] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-22 03:17:09] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 0 ms to minimize.
[2024-05-22 03:17:09] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/348 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/348 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 03:17:11] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/348 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/348 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 15 (OVERLAPS) 0/348 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 267 constraints, problems are : Problem set: 0 solved, 145 unsolved in 10813 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/197 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 2/199 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 148/347 variables, 199/266 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 145/411 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 03:17:21] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 1/412 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 11 (OVERLAPS) 1/348 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 348/348 variables, and 413 constraints, problems are : Problem set: 0 solved, 145 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 10/10 constraints]
After SMT, in 40883ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 40885ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 41260 ms. Remains : 200/200 places, 148/148 transitions.
Computed a total of 95 stabilizing places and 90 stable transitions
Computed a total of 95 stabilizing places and 90 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
RANDOM walk for 2676 steps (146 resets) in 18 ms. (140 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 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5381 reset in 197 ms.
Product exploration explored 100000 steps with 5358 reset in 213 ms.
Built C files in :
/tmp/ltsmin12611451975985797779
[2024-05-22 03:17:45] [INFO ] Computing symmetric may disable matrix : 148 transitions.
[2024-05-22 03:17:45] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 03:17:45] [INFO ] Computing symmetric may enable matrix : 148 transitions.
[2024-05-22 03:17:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 03:17:45] [INFO ] Computing Do-Not-Accords matrix : 148 transitions.
[2024-05-22 03:17:45] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 03:17:45] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12611451975985797779
Running compilation step : cd /tmp/ltsmin12611451975985797779;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 385 ms.
Running link step : cd /tmp/ltsmin12611451975985797779;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin12611451975985797779;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3272893216652700552.hoa' '--buchi-type=spotba'
LTSmin run took 643 ms.
FORMULA DES-PT-20b-LTLCardinality-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-20b-LTLCardinality-01 finished in 85127 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U G(p0)))'
Support contains 2 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 273/273 transitions.
Graph (complete) has 681 edges and 327 vertex of which 325 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 324 transition count 256
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 310 transition count 256
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 29 place count 310 transition count 247
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 47 place count 301 transition count 247
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 53 place count 295 transition count 241
Iterating global reduction 2 with 6 rules applied. Total rules applied 59 place count 295 transition count 241
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 65 place count 289 transition count 235
Iterating global reduction 2 with 6 rules applied. Total rules applied 71 place count 289 transition count 235
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 2 with 6 rules applied. Total rules applied 77 place count 289 transition count 229
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 79 place count 288 transition count 228
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 79 place count 288 transition count 225
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 85 place count 285 transition count 225
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 239 place count 208 transition count 148
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 243 place count 206 transition count 150
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 245 place count 204 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 246 place count 203 transition count 148
Applied a total of 246 rules in 38 ms. Remains 203 /327 variables (removed 124) and now considering 148/273 (removed 125) transitions.
// Phase 1: matrix 148 rows 203 cols
[2024-05-22 03:17:46] [INFO ] Computed 61 invariants in 5 ms
[2024-05-22 03:17:46] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-22 03:17:46] [INFO ] Invariant cache hit.
[2024-05-22 03:17:46] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2024-05-22 03:17:46] [INFO ] Redundant transitions in 0 ms returned []
Running 145 sub problems to find dead transitions.
[2024-05-22 03:17:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 3/202 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (OVERLAPS) 1/203 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 148/351 variables, 203/264 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (OVERLAPS) 0/351 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/351 variables, and 264 constraints, problems are : Problem set: 0 solved, 145 unsolved in 5920 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (OVERLAPS) 3/202 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (OVERLAPS) 1/203 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 03:17:53] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-22 03:17:53] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 8 (OVERLAPS) 148/351 variables, 203/266 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/351 variables, 145/411 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 03:17:57] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-22 03:18:00] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 2/413 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/351 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-22 03:18:15] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/351 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 145 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 351/351 variables, and 414 constraints, problems are : Problem set: 0 solved, 145 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 5/5 constraints]
After SMT, in 35986ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 35987ms
Starting structural reductions in SI_LTL mode, iteration 1 : 203/327 places, 148/273 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36333 ms. Remains : 203/327 places, 148/273 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), true, (NOT p0)]
Running random walk in product with property : DES-PT-20b-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 0 ms.
FORMULA DES-PT-20b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLCardinality-03 finished in 36444 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||G(p1))))))'
Support contains 2 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 273/273 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 326 transition count 273
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 320 transition count 267
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 320 transition count 267
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 19 place count 314 transition count 261
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 314 transition count 261
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 30 place count 314 transition count 256
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 313 transition count 255
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 313 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 313 transition count 254
Applied a total of 33 rules in 17 ms. Remains 313 /327 variables (removed 14) and now considering 254/273 (removed 19) transitions.
// Phase 1: matrix 254 rows 313 cols
[2024-05-22 03:18:22] [INFO ] Computed 61 invariants in 7 ms
[2024-05-22 03:18:22] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-22 03:18:22] [INFO ] Invariant cache hit.
[2024-05-22 03:18:23] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2024-05-22 03:18:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:18:26] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-05-22 03:18:26] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-22 03:18:26] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-22 03:18:26] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 2 ms to minimize.
[2024-05-22 03:18:26] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-22 03:18:26] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-22 03:18:26] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-22 03:18:27] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 254/567 variables, 313/382 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:18:31] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 3 ms to minimize.
[2024-05-22 03:18:31] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-05-22 03:18:31] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 2 ms to minimize.
[2024-05-22 03:18:31] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-05-22 03:18:32] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-05-22 03:18:32] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-22 03:18:32] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-22 03:18:32] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/567 variables, 8/390 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:18:34] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2024-05-22 03:18:34] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-22 03:18:35] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-22 03:18:35] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 4/394 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:18:37] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-22 03:18:37] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-22 03:18:37] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-22 03:18:37] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-22 03:18:37] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-22 03:18:37] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-22 03:18:37] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-22 03:18:37] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-22 03:18:38] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 1 ms to minimize.
[2024-05-22 03:18:38] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-22 03:18:38] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-22 03:18:38] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-22 03:18:38] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-22 03:18:39] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 14/408 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:18:42] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-22 03:18:44] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 2/410 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:18:45] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/567 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:18:48] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-22 03:18:48] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/567 variables, 2/413 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 567/567 variables, and 413 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 39/100 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:18:54] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 0 ms to minimize.
[2024-05-22 03:18:54] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-22 03:18:55] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-22 03:18:55] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-05-22 03:18:55] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 2 ms to minimize.
[2024-05-22 03:18:55] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-22 03:18:55] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-22 03:18:55] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-22 03:18:55] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-22 03:18:55] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-22 03:18:55] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-22 03:18:56] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-22 03:18:56] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 13/113 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:18:57] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-22 03:18:57] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-22 03:18:57] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-22 03:18:57] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-22 03:18:57] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-22 03:18:58] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-22 03:18:58] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 7/120 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:18:59] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-05-22 03:18:59] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-05-22 03:18:59] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-05-22 03:18:59] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-22 03:18:59] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:19:02] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 10 (OVERLAPS) 254/567 variables, 313/439 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/567 variables, 253/692 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:19:13] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-05-22 03:19:13] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-22 03:19:14] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 1 ms to minimize.
[2024-05-22 03:19:19] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-22 03:19:19] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-22 03:19:20] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-22 03:19:20] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-22 03:19:20] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 0 ms to minimize.
[2024-05-22 03:19:21] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 567/567 variables, and 701 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 74/74 constraints]
After SMT, in 60079ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 60083ms
Starting structural reductions in LTL mode, iteration 1 : 313/327 places, 254/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60563 ms. Remains : 313/327 places, 254/273 transitions.
Stuttering acceptance computed with spot in 204 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-20b-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 281 steps with 2 reset in 1 ms.
FORMULA DES-PT-20b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLCardinality-04 finished in 60792 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 273/273 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 326 transition count 273
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 320 transition count 267
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 320 transition count 267
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 19 place count 314 transition count 261
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 314 transition count 261
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 30 place count 314 transition count 256
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 313 transition count 255
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 313 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 313 transition count 254
Applied a total of 33 rules in 22 ms. Remains 313 /327 variables (removed 14) and now considering 254/273 (removed 19) transitions.
[2024-05-22 03:19:23] [INFO ] Invariant cache hit.
[2024-05-22 03:19:23] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-22 03:19:23] [INFO ] Invariant cache hit.
[2024-05-22 03:19:23] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2024-05-22 03:19:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:19:27] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-22 03:19:27] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 2 ms to minimize.
[2024-05-22 03:19:27] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-22 03:19:27] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 2 ms to minimize.
[2024-05-22 03:19:27] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-22 03:19:27] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-22 03:19:27] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-22 03:19:27] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 254/567 variables, 313/382 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:19:31] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 2 ms to minimize.
[2024-05-22 03:19:32] [INFO ] Deduced a trap composed of 7 places in 60 ms of which 1 ms to minimize.
[2024-05-22 03:19:32] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-05-22 03:19:32] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-22 03:19:32] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-22 03:19:32] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-22 03:19:32] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-22 03:19:33] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/567 variables, 8/390 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:19:34] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-22 03:19:34] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-22 03:19:35] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-22 03:19:35] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 4/394 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:19:37] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-22 03:19:37] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-22 03:19:37] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-22 03:19:37] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 2 ms to minimize.
[2024-05-22 03:19:37] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 2 ms to minimize.
[2024-05-22 03:19:37] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-22 03:19:38] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-22 03:19:38] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-22 03:19:38] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
[2024-05-22 03:19:38] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2024-05-22 03:19:39] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-05-22 03:19:39] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-22 03:19:39] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-05-22 03:19:39] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 14/408 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:19:43] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-22 03:19:44] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 2/410 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:19:45] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/567 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:19:48] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 1 ms to minimize.
[2024-05-22 03:19:48] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/567 variables, 2/413 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:19:53] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 567/567 variables, and 414 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 40/101 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:19:55] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 2 ms to minimize.
[2024-05-22 03:19:55] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 03:19:56] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-22 03:19:56] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-22 03:19:56] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-22 03:19:57] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 6/107 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:19:57] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:19:59] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (OVERLAPS) 254/567 variables, 313/422 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 253/675 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:20:10] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 2 ms to minimize.
[2024-05-22 03:20:10] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-05-22 03:20:10] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2024-05-22 03:20:10] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-05-22 03:20:11] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-22 03:20:11] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-05-22 03:20:12] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-05-22 03:20:21] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 3 ms to minimize.
[2024-05-22 03:20:21] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 1 ms to minimize.
[2024-05-22 03:20:23] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 567/567 variables, and 685 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 58/58 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Starting structural reductions in LTL mode, iteration 1 : 313/327 places, 254/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60544 ms. Remains : 313/327 places, 254/273 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-20b-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-20b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLCardinality-07 finished in 60648 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((G(p0)||X(p1))))'
Support contains 5 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 273/273 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 326 transition count 273
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 321 transition count 268
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 321 transition count 268
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 16 place count 316 transition count 263
Iterating global reduction 1 with 5 rules applied. Total rules applied 21 place count 316 transition count 263
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 25 place count 316 transition count 259
Applied a total of 25 rules in 12 ms. Remains 316 /327 variables (removed 11) and now considering 259/273 (removed 14) transitions.
// Phase 1: matrix 259 rows 316 cols
[2024-05-22 03:20:24] [INFO ] Computed 61 invariants in 2 ms
[2024-05-22 03:20:24] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-22 03:20:24] [INFO ] Invariant cache hit.
[2024-05-22 03:20:24] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2024-05-22 03:20:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 1/316 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (OVERLAPS) 259/575 variables, 316/377 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-22 03:20:29] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-22 03:20:29] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 2 ms to minimize.
[2024-05-22 03:20:29] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 2 ms to minimize.
[2024-05-22 03:20:30] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-22 03:20:30] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-05-22 03:20:30] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-22 03:20:30] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-22 03:20:30] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-22 03:20:30] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 2 ms to minimize.
[2024-05-22 03:20:30] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-22 03:20:30] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-22 03:20:30] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-22 03:20:31] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-22 03:20:31] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-22 03:20:31] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-05-22 03:20:31] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-05-22 03:20:31] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-05-22 03:20:32] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2024-05-22 03:20:32] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 2 ms to minimize.
[2024-05-22 03:20:32] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/575 variables, 20/397 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-22 03:20:33] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2024-05-22 03:20:33] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-22 03:20:33] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-05-22 03:20:33] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 2 ms to minimize.
[2024-05-22 03:20:33] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-22 03:20:34] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 2 ms to minimize.
[2024-05-22 03:20:34] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 0 ms to minimize.
[2024-05-22 03:20:34] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-22 03:20:34] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-22 03:20:34] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-22 03:20:34] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 2 ms to minimize.
[2024-05-22 03:20:34] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 2 ms to minimize.
[2024-05-22 03:20:34] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 4 ms to minimize.
[2024-05-22 03:20:35] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-22 03:20:35] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/575 variables, 15/412 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-22 03:20:37] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-22 03:20:38] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-22 03:20:38] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 2 ms to minimize.
[2024-05-22 03:20:38] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-22 03:20:38] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-22 03:20:38] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-22 03:20:38] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-22 03:20:38] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-22 03:20:39] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/575 variables, 9/421 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-22 03:20:40] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-05-22 03:20:41] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-22 03:20:42] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2024-05-22 03:20:43] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/575 variables, 4/425 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-22 03:20:46] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 2 ms to minimize.
[2024-05-22 03:20:46] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/575 variables, 2/427 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/575 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 12 (OVERLAPS) 0/575 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 575/575 variables, and 427 constraints, problems are : Problem set: 0 solved, 258 unsolved in 28390 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/315 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 1/316 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 13/61 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 50/111 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-22 03:20:54] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-05-22 03:20:54] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-22 03:20:55] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-05-22 03:20:55] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 4/115 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-22 03:20:56] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-22 03:20:57] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-22 03:20:57] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-22 03:20:57] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-22 03:20:57] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-22 03:20:57] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-22 03:20:57] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 1 ms to minimize.
[2024-05-22 03:20:57] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-22 03:20:57] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 1 ms to minimize.
[2024-05-22 03:20:57] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 0 ms to minimize.
[2024-05-22 03:20:58] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-22 03:20:58] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-22 03:20:58] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-05-22 03:20:58] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 14/129 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-22 03:20:59] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 9 (OVERLAPS) 259/575 variables, 316/446 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/575 variables, 258/704 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-22 03:21:10] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
[2024-05-22 03:21:11] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-05-22 03:21:11] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 575/575 variables, and 707 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 72/72 constraints]
After SMT, in 58466ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 58470ms
Starting structural reductions in LTL mode, iteration 1 : 316/327 places, 259/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59106 ms. Remains : 316/327 places, 259/273 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DES-PT-20b-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 2868 steps with 26 reset in 19 ms.
FORMULA DES-PT-20b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20b-LTLCardinality-08 finished in 59285 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((X(p1)||p0))))'
Support contains 3 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 273/273 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 326 transition count 273
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 320 transition count 267
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 320 transition count 267
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 19 place count 314 transition count 261
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 314 transition count 261
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 30 place count 314 transition count 256
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 313 transition count 255
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 313 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 313 transition count 254
Applied a total of 33 rules in 12 ms. Remains 313 /327 variables (removed 14) and now considering 254/273 (removed 19) transitions.
// Phase 1: matrix 254 rows 313 cols
[2024-05-22 03:21:23] [INFO ] Computed 61 invariants in 2 ms
[2024-05-22 03:21:23] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-22 03:21:23] [INFO ] Invariant cache hit.
[2024-05-22 03:21:23] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2024-05-22 03:21:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:21:27] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2024-05-22 03:21:27] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-05-22 03:21:27] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-22 03:21:27] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2024-05-22 03:21:27] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-22 03:21:27] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 0 ms to minimize.
[2024-05-22 03:21:27] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-22 03:21:27] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 254/567 variables, 313/382 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:21:32] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 2 ms to minimize.
[2024-05-22 03:21:32] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-05-22 03:21:32] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-05-22 03:21:32] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 2 ms to minimize.
[2024-05-22 03:21:32] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 2 ms to minimize.
[2024-05-22 03:21:32] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-22 03:21:32] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2024-05-22 03:21:33] [INFO ] Deduced a trap composed of 44 places in 81 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/567 variables, 8/390 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:21:34] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-22 03:21:35] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-22 03:21:35] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-22 03:21:35] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 4/394 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:21:37] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-22 03:21:37] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-22 03:21:38] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2024-05-22 03:21:38] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-05-22 03:21:38] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-22 03:21:38] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-22 03:21:38] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-22 03:21:38] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-22 03:21:38] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-05-22 03:21:39] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-05-22 03:21:39] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-22 03:21:39] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-22 03:21:39] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-22 03:21:39] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 14/408 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:21:43] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-22 03:21:44] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 2/410 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:21:45] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/567 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:21:48] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-22 03:21:49] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/567 variables, 2/413 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:21:53] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 567/567 variables, and 414 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 40/101 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:21:55] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-22 03:21:56] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-22 03:21:56] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-22 03:21:56] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-22 03:21:56] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-22 03:21:57] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 6/107 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:21:57] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:21:59] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (OVERLAPS) 254/567 variables, 313/422 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 253/675 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:22:10] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-05-22 03:22:10] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 1 ms to minimize.
[2024-05-22 03:22:10] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-22 03:22:10] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 2 ms to minimize.
[2024-05-22 03:22:11] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-22 03:22:11] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-22 03:22:12] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-22 03:22:21] [INFO ] Deduced a trap composed of 41 places in 68 ms of which 1 ms to minimize.
[2024-05-22 03:22:22] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2024-05-22 03:22:23] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 567/567 variables, and 685 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 58/58 constraints]
After SMT, in 60072ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 60075ms
Starting structural reductions in LTL mode, iteration 1 : 313/327 places, 254/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60724 ms. Remains : 313/327 places, 254/273 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-20b-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 139 ms.
Product exploration explored 100000 steps with 50000 reset in 137 ms.
Computed a total of 136 stabilizing places and 129 stable transitions
Graph (complete) has 647 edges and 313 vertex of which 308 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 136 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 41 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-20b-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-20b-LTLCardinality-10 finished in 61161 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G((X(p2)||p1)))))'
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 273/273 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 326 transition count 273
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 320 transition count 267
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 320 transition count 267
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 19 place count 314 transition count 261
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 314 transition count 261
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 30 place count 314 transition count 256
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 313 transition count 255
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 313 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 313 transition count 254
Applied a total of 33 rules in 13 ms. Remains 313 /327 variables (removed 14) and now considering 254/273 (removed 19) transitions.
[2024-05-22 03:22:24] [INFO ] Invariant cache hit.
[2024-05-22 03:22:24] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-22 03:22:24] [INFO ] Invariant cache hit.
[2024-05-22 03:22:25] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2024-05-22 03:22:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:22:28] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-22 03:22:28] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-22 03:22:28] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-22 03:22:28] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-05-22 03:22:28] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-22 03:22:28] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-22 03:22:29] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2024-05-22 03:22:29] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 254/567 variables, 313/382 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:22:33] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 2 ms to minimize.
[2024-05-22 03:22:33] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 2 ms to minimize.
[2024-05-22 03:22:33] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 2 ms to minimize.
[2024-05-22 03:22:33] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-22 03:22:33] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2024-05-22 03:22:33] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-22 03:22:34] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-05-22 03:22:34] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/567 variables, 8/390 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:22:36] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-22 03:22:36] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-22 03:22:37] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-22 03:22:37] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 13 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 4/394 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:22:39] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-22 03:22:39] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2024-05-22 03:22:39] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2024-05-22 03:22:39] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 1 ms to minimize.
[2024-05-22 03:22:39] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-05-22 03:22:39] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2024-05-22 03:22:39] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-22 03:22:39] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-22 03:22:40] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-22 03:22:40] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 2 ms to minimize.
[2024-05-22 03:22:40] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-22 03:22:40] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-22 03:22:40] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-22 03:22:41] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 14/408 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:22:45] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-22 03:22:46] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 2/410 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:22:47] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/567 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:22:50] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2024-05-22 03:22:50] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/567 variables, 2/413 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 1.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 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.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 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.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 0.0)
(s148 1.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 1.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 1.0)
(s171 0.0)
(s172 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 567/567 variables, and 413 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 39/100 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:22:56] [INFO ] Deduced a trap composed of 35 places in 29 ms of which 0 ms to minimize.
[2024-05-22 03:22:57] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-22 03:22:57] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2024-05-22 03:22:57] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 15 ms to minimize.
[2024-05-22 03:22:57] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 2 ms to minimize.
[2024-05-22 03:22:57] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-22 03:22:57] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-22 03:22:57] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-22 03:22:58] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-22 03:22:58] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-22 03:22:58] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2024-05-22 03:22:58] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-22 03:22:58] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 13/113 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:22:59] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
[2024-05-22 03:22:59] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-22 03:22:59] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-22 03:23:00] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-22 03:23:00] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 3 ms to minimize.
[2024-05-22 03:23:01] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-22 03:23:01] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 7/120 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:23:01] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-22 03:23:01] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-22 03:23:01] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-22 03:23:02] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-22 03:23:02] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:23:05] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 10 (OVERLAPS) 254/567 variables, 313/439 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/567 variables, 253/692 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:23:15] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-22 03:23:16] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-22 03:23:16] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-22 03:23:22] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-22 03:23:22] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 0 ms to minimize.
[2024-05-22 03:23:22] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-22 03:23:23] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-22 03:23:23] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 0 ms to minimize.
[2024-05-22 03:23:23] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 567/567 variables, and 701 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 74/74 constraints]
After SMT, in 60076ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 60081ms
Starting structural reductions in LTL mode, iteration 1 : 313/327 places, 254/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60736 ms. Remains : 313/327 places, 254/273 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-20b-LTLCardinality-11
Product exploration explored 100000 steps with 1199 reset in 166 ms.
Product exploration explored 100000 steps with 1192 reset in 178 ms.
Computed a total of 136 stabilizing places and 129 stable transitions
Graph (complete) has 647 edges and 313 vertex of which 308 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 136 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X p1), (X p2), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1)), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 174 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 3 to 1
RANDOM walk for 223 steps (0 resets) in 4 ms. (44 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X p1), (X p2), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X p1)), (X (X p2))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 140 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 313 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 254/254 transitions.
Applied a total of 0 rules in 2 ms. Remains 313 /313 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2024-05-22 03:23:26] [INFO ] Invariant cache hit.
[2024-05-22 03:23:26] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-22 03:23:26] [INFO ] Invariant cache hit.
[2024-05-22 03:23:26] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2024-05-22 03:23:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:23:30] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-22 03:23:30] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-22 03:23:30] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-22 03:23:30] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-05-22 03:23:30] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-22 03:23:30] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2024-05-22 03:23:30] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2024-05-22 03:23:30] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 254/567 variables, 313/382 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:23:34] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 2 ms to minimize.
[2024-05-22 03:23:35] [INFO ] Deduced a trap composed of 7 places in 87 ms of which 1 ms to minimize.
[2024-05-22 03:23:35] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2024-05-22 03:23:35] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-05-22 03:23:35] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 2 ms to minimize.
[2024-05-22 03:23:35] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-22 03:23:35] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-22 03:23:36] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/567 variables, 8/390 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:23:37] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 0 ms to minimize.
[2024-05-22 03:23:37] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-22 03:23:38] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-22 03:23:38] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 4/394 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:23:40] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-05-22 03:23:40] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-22 03:23:40] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-22 03:23:40] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2024-05-22 03:23:40] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-22 03:23:41] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-22 03:23:41] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-22 03:23:41] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2024-05-22 03:23:41] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 2 ms to minimize.
[2024-05-22 03:23:42] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-05-22 03:23:42] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-05-22 03:23:42] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-22 03:23:42] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-05-22 03:23:42] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 14/408 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:23:46] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-22 03:23:47] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 2/410 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:23:48] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/567 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:23:51] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 1 ms to minimize.
[2024-05-22 03:23:52] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/567 variables, 2/413 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 567/567 variables, and 413 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 39/100 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:23:58] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 0 ms to minimize.
[2024-05-22 03:23:58] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-22 03:23:58] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-22 03:23:58] [INFO ] Deduced a trap composed of 34 places in 66 ms of which 1 ms to minimize.
[2024-05-22 03:23:59] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-05-22 03:23:59] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-22 03:23:59] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 0 ms to minimize.
[2024-05-22 03:23:59] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-22 03:23:59] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-22 03:23:59] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-22 03:23:59] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-22 03:24:00] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-22 03:24:00] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 13/113 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:24:00] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-22 03:24:01] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-22 03:24:01] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-05-22 03:24:01] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-05-22 03:24:01] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-22 03:24:02] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-22 03:24:02] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 7/120 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:24:02] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 1 ms to minimize.
[2024-05-22 03:24:03] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2024-05-22 03:24:03] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-22 03:24:03] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-22 03:24:03] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 5/125 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:24:06] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 10 (OVERLAPS) 254/567 variables, 313/439 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/567 variables, 253/692 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:24:16] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-05-22 03:24:17] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-05-22 03:24:17] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 3 ms to minimize.
[2024-05-22 03:24:23] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-22 03:24:23] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-22 03:24:23] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-22 03:24:24] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
[2024-05-22 03:24:24] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-22 03:24:24] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 567/567 variables, and 701 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 74/74 constraints]
After SMT, in 60085ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 60088ms
Finished structural reductions in LTL mode , in 1 iterations and 60546 ms. Remains : 313/313 places, 254/254 transitions.
Computed a total of 136 stabilizing places and 129 stable transitions
Graph (complete) has 647 edges and 313 vertex of which 308 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Computed a total of 136 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p2), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 143 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 3 to 1
RANDOM walk for 194 steps (0 resets) in 4 ms. (38 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p2), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X p2))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 160 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 1191 reset in 178 ms.
Product exploration explored 100000 steps with 1184 reset in 191 ms.
Built C files in :
/tmp/ltsmin10083281589034759195
[2024-05-22 03:24:28] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10083281589034759195
Running compilation step : cd /tmp/ltsmin10083281589034759195;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 472 ms.
Running link step : cd /tmp/ltsmin10083281589034759195;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10083281589034759195;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5085685080235708590.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 313/313 places, 254/254 transitions.
Applied a total of 0 rules in 6 ms. Remains 313 /313 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2024-05-22 03:24:43] [INFO ] Invariant cache hit.
[2024-05-22 03:24:43] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-22 03:24:43] [INFO ] Invariant cache hit.
[2024-05-22 03:24:43] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2024-05-22 03:24:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:24:46] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-22 03:24:46] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-22 03:24:46] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-22 03:24:47] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-22 03:24:47] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-22 03:24:47] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-22 03:24:47] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-22 03:24:47] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 254/567 variables, 313/382 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:24:51] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
[2024-05-22 03:24:51] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-05-22 03:24:51] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 6 ms to minimize.
[2024-05-22 03:24:51] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-05-22 03:24:51] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 2 ms to minimize.
[2024-05-22 03:24:51] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-22 03:24:52] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-22 03:24:52] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/567 variables, 8/390 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:24:54] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-22 03:24:54] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-22 03:24:54] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-22 03:24:55] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 4/394 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:24:56] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-22 03:24:57] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-22 03:24:57] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-22 03:24:57] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-22 03:24:57] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-22 03:24:57] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-22 03:24:57] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-22 03:24:57] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-22 03:24:57] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-22 03:24:58] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-22 03:24:58] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-22 03:24:58] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-22 03:24:58] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-22 03:24:58] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 14/408 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:25:02] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-22 03:25:03] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 2/410 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:25:04] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/567 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:25:08] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-22 03:25:08] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/567 variables, 2/413 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:25:13] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
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 567/567 variables, and 414 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/312 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/312 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/313 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 14/61 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 40/101 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:25:15] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-22 03:25:15] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-22 03:25:15] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-22 03:25:16] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2024-05-22 03:25:16] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-22 03:25:16] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/313 variables, 6/107 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:25:17] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:25:19] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/313 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 9 (OVERLAPS) 254/567 variables, 313/422 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 253/675 constraints. Problems are: Problem set: 0 solved, 253 unsolved
[2024-05-22 03:25:30] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 2 ms to minimize.
[2024-05-22 03:25:30] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
[2024-05-22 03:25:30] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-05-22 03:25:30] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
[2024-05-22 03:25:31] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2024-05-22 03:25:31] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-22 03:25:32] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-22 03:25:41] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2024-05-22 03:25:41] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2024-05-22 03:25:43] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 567/567 variables, and 685 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 313/313 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 58/58 constraints]
After SMT, in 60088ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Finished structural reductions in LTL mode , in 1 iterations and 60529 ms. Remains : 313/313 places, 254/254 transitions.
Built C files in :
/tmp/ltsmin3198889839234360194
[2024-05-22 03:25:43] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3198889839234360194
Running compilation step : cd /tmp/ltsmin3198889839234360194;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 455 ms.
Running link step : cd /tmp/ltsmin3198889839234360194;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin3198889839234360194;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3418621510425401512.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 03:25:58] [INFO ] Flatten gal took : 15 ms
[2024-05-22 03:25:58] [INFO ] Flatten gal took : 15 ms
[2024-05-22 03:25:58] [INFO ] Time to serialize gal into /tmp/LTL10531092378886408449.gal : 4 ms
[2024-05-22 03:25:58] [INFO ] Time to serialize properties into /tmp/LTL14389355164029734229.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10531092378886408449.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1316676280508948258.hoa' '-atoms' '/tmp/LTL14389355164029734229.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14389355164029734229.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1316676280508948258.hoa
Detected timeout of ITS tools.
[2024-05-22 03:26:13] [INFO ] Flatten gal took : 15 ms
[2024-05-22 03:26:13] [INFO ] Flatten gal took : 13 ms
[2024-05-22 03:26:14] [INFO ] Time to serialize gal into /tmp/LTL18059552401056538300.gal : 83 ms
[2024-05-22 03:26:14] [INFO ] Time to serialize properties into /tmp/LTL15160657644424270547.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18059552401056538300.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15160657644424270547.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((F("((p358==0)||(p165==1))"))&&(F(G(("((p330==0)||(p84==1))")||(X("((p330==0)||(p84==1))")))))))
Formula 0 simplified : G!"((p358==0)||(p165==1))" | GF(!"((p330==0)||(p84==1))" & X!"((p330==0)||(p84==1))")
Detected timeout of ITS tools.
[2024-05-22 03:26:29] [INFO ] Flatten gal took : 13 ms
[2024-05-22 03:26:29] [INFO ] Applying decomposition
[2024-05-22 03:26:29] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15672509896186515136.txt' '-o' '/tmp/graph15672509896186515136.bin' '-w' '/tmp/graph15672509896186515136.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15672509896186515136.bin' '-l' '-1' '-v' '-w' '/tmp/graph15672509896186515136.weights' '-q' '0' '-e' '0.001'
[2024-05-22 03:26:29] [INFO ] Decomposing Gal with order
[2024-05-22 03:26:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 03:26:29] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-22 03:26:29] [INFO ] Flatten gal took : 60 ms
[2024-05-22 03:26:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 10 ms.
[2024-05-22 03:26:29] [INFO ] Time to serialize gal into /tmp/LTL10193849305051101337.gal : 6 ms
[2024-05-22 03:26:29] [INFO ] Time to serialize properties into /tmp/LTL5682331030643130165.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10193849305051101337.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5682331030643130165.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F("((i10.u76.p358==0)||(i5.i0.u24.p165==1))"))&&(F(G(("((i8.i1.u69.p330==0)||(i3.u10.p84==1))")||(X("((i8.i1.u69.p330==0)||(i3.u10...172
Formula 0 simplified : G!"((i10.u76.p358==0)||(i5.i0.u24.p165==1))" | GF(!"((i8.i1.u69.p330==0)||(i3.u10.p84==1))" & X!"((i8.i1.u69.p330==0)||(i3.u10.p84==...160
Detected timeout of ITS tools.
Treatment of property DES-PT-20b-LTLCardinality-11 finished in 260022 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)||p0))))'
Support contains 2 out of 327 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 327/327 places, 273/273 transitions.
Graph (complete) has 681 edges and 327 vertex of which 321 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 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 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 320 transition count 255
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 306 transition count 255
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 306 transition count 245
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 296 transition count 245
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 55 place count 290 transition count 239
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 290 transition count 239
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 67 place count 284 transition count 233
Iterating global reduction 2 with 6 rules applied. Total rules applied 73 place count 284 transition count 233
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 2 with 6 rules applied. Total rules applied 79 place count 284 transition count 227
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 81 place count 283 transition count 226
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 81 place count 283 transition count 223
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 87 place count 280 transition count 223
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 237 place count 205 transition count 148
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 241 place count 203 transition count 150
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 243 place count 201 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 244 place count 200 transition count 148
Applied a total of 244 rules in 39 ms. Remains 200 /327 variables (removed 127) and now considering 148/273 (removed 125) transitions.
// Phase 1: matrix 148 rows 200 cols
[2024-05-22 03:26:44] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 03:26:44] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-05-22 03:26:44] [INFO ] Invariant cache hit.
[2024-05-22 03:26:45] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
[2024-05-22 03:26:45] [INFO ] Redundant transitions in 0 ms returned []
Running 144 sub problems to find dead transitions.
[2024-05-22 03:26:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 18/43 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 1/197 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 2/199 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 144 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 148/347 variables, 199/257 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-22 03:26:48] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 5 ms to minimize.
[2024-05-22 03:26:48] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-22 03:26:48] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-22 03:26:49] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-22 03:26:49] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2024-05-22 03:26:49] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 6/263 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-22 03:26:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-22 03:26:50] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-22 03:26:50] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-22 03:26:50] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-22 03:26:50] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 12 (OVERLAPS) 1/348 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/348 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 14 (OVERLAPS) 0/348 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 269 constraints, problems are : Problem set: 0 solved, 144 unsolved in 9653 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 18/43 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 1/197 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 2/199 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (OVERLAPS) 148/347 variables, 199/268 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 144/412 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 12 (OVERLAPS) 1/348 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-22 03:27:12] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/348 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/348 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 348/348 variables, and 414 constraints, problems are : Problem set: 0 solved, 144 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 12/12 constraints]
After SMT, in 39720ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 39721ms
Starting structural reductions in SI_LTL mode, iteration 1 : 200/327 places, 148/273 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40420 ms. Remains : 200/327 places, 148/273 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-20b-LTLCardinality-14
Product exploration explored 100000 steps with 8264 reset in 188 ms.
Product exploration explored 100000 steps with 8311 reset in 209 ms.
Computed a total of 97 stabilizing places and 92 stable transitions
Computed a total of 97 stabilizing places and 92 stable transitions
Detected a total of 97/200 stabilizing places and 92/148 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 569 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 2
RANDOM walk for 40000 steps (1991 resets) in 235 ms. (169 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (349 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
[2024-05-22 03:27:26] [INFO ] Invariant cache hit.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 2/348 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 0/33 constraints, Generalized P Invariants (flows): 0/25 constraints, State Equation: 0/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 42ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 660 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 148/148 transitions.
Applied a total of 0 rules in 5 ms. Remains 200 /200 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-05-22 03:27:27] [INFO ] Invariant cache hit.
[2024-05-22 03:27:27] [INFO ] Implicit Places using invariants in 373 ms returned []
[2024-05-22 03:27:27] [INFO ] Invariant cache hit.
[2024-05-22 03:27:27] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
[2024-05-22 03:27:27] [INFO ] Redundant transitions in 0 ms returned []
Running 144 sub problems to find dead transitions.
[2024-05-22 03:27:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 18/43 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 1/197 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 2/199 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 144 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 148/347 variables, 199/257 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-22 03:27:30] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-22 03:27:30] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-22 03:27:31] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-22 03:27:31] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 0 ms to minimize.
[2024-05-22 03:27:31] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-22 03:27:31] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 6/263 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-22 03:27:32] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-22 03:27:32] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-22 03:27:32] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-22 03:27:33] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-22 03:27:33] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 12 (OVERLAPS) 1/348 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/348 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 14 (OVERLAPS) 0/348 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 269 constraints, problems are : Problem set: 0 solved, 144 unsolved in 9343 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 18/43 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 1/197 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 2/199 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (OVERLAPS) 148/347 variables, 199/268 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 144/412 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 12 (OVERLAPS) 1/348 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-22 03:27:54] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/348 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/348 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 348/348 variables, and 414 constraints, problems are : Problem set: 0 solved, 144 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 12/12 constraints]
After SMT, in 39410ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 39412ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40035 ms. Remains : 200/200 places, 148/148 transitions.
Computed a total of 97 stabilizing places and 92 stable transitions
Computed a total of 97 stabilizing places and 92 stable transitions
Detected a total of 97/200 stabilizing places and 92/148 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 164 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 64 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 18 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 155 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 58 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 8069 reset in 187 ms.
Product exploration explored 100000 steps with 8117 reset in 205 ms.
Built C files in :
/tmp/ltsmin6172037786303731369
[2024-05-22 03:28:08] [INFO ] Computing symmetric may disable matrix : 148 transitions.
[2024-05-22 03:28:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 03:28:08] [INFO ] Computing symmetric may enable matrix : 148 transitions.
[2024-05-22 03:28:08] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 03:28:08] [INFO ] Computing Do-Not-Accords matrix : 148 transitions.
[2024-05-22 03:28:08] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 03:28:08] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6172037786303731369
Running compilation step : cd /tmp/ltsmin6172037786303731369;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 355 ms.
Running link step : cd /tmp/ltsmin6172037786303731369;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin6172037786303731369;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8290483527233195507.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 200 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 200/200 places, 148/148 transitions.
Applied a total of 0 rules in 9 ms. Remains 200 /200 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-05-22 03:28:23] [INFO ] Invariant cache hit.
[2024-05-22 03:28:23] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-22 03:28:23] [INFO ] Invariant cache hit.
[2024-05-22 03:28:23] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2024-05-22 03:28:23] [INFO ] Redundant transitions in 1 ms returned []
Running 144 sub problems to find dead transitions.
[2024-05-22 03:28:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 18/43 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (OVERLAPS) 1/197 variables, 8/51 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (OVERLAPS) 2/199 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 144 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (OVERLAPS) 148/347 variables, 199/257 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-22 03:28:26] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-22 03:28:26] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-22 03:28:27] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-22 03:28:27] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-22 03:28:27] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-22 03:28:27] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 6/263 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-22 03:28:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-22 03:28:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-22 03:28:28] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 3/266 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-22 03:28:29] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-22 03:28:29] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 12 (OVERLAPS) 1/348 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/348 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 14 (OVERLAPS) 0/348 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 348/348 variables, and 269 constraints, problems are : Problem set: 0 solved, 144 unsolved in 9266 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 18/43 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 10/53 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 1/197 variables, 8/61 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 2/199 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (OVERLAPS) 148/347 variables, 199/268 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/347 variables, 144/412 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/347 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 12 (OVERLAPS) 1/348 variables, 1/413 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-22 03:28:50] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/348 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/348 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 348/348 variables, and 414 constraints, problems are : Problem set: 0 solved, 144 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 200/200 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 12/12 constraints]
After SMT, in 39328ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 39330ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39730 ms. Remains : 200/200 places, 148/148 transitions.
Built C files in :
/tmp/ltsmin17951069299250001733
[2024-05-22 03:29:02] [INFO ] Computing symmetric may disable matrix : 148 transitions.
[2024-05-22 03:29:02] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 03:29:02] [INFO ] Computing symmetric may enable matrix : 148 transitions.
[2024-05-22 03:29:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 03:29:02] [INFO ] Computing Do-Not-Accords matrix : 148 transitions.
[2024-05-22 03:29:02] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 03:29:02] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17951069299250001733
Running compilation step : cd /tmp/ltsmin17951069299250001733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 358 ms.
Running link step : cd /tmp/ltsmin17951069299250001733;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin17951069299250001733;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased161919285239570918.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 03:29:18] [INFO ] Flatten gal took : 11 ms
[2024-05-22 03:29:18] [INFO ] Flatten gal took : 10 ms
[2024-05-22 03:29:18] [INFO ] Time to serialize gal into /tmp/LTL12323352556572674482.gal : 2 ms
[2024-05-22 03:29:18] [INFO ] Time to serialize properties into /tmp/LTL13776864223054726334.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12323352556572674482.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12806962252287289584.hoa' '-atoms' '/tmp/LTL13776864223054726334.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL13776864223054726334.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12806962252287289584.hoa
Detected timeout of ITS tools.
[2024-05-22 03:29:33] [INFO ] Flatten gal took : 10 ms
[2024-05-22 03:29:33] [INFO ] Flatten gal took : 9 ms
[2024-05-22 03:29:33] [INFO ] Time to serialize gal into /tmp/LTL14641337595612114382.gal : 4 ms
[2024-05-22 03:29:33] [INFO ] Time to serialize properties into /tmp/LTL13633618181648413611.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14641337595612114382.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13633618181648413611.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G(("((p255==0)||(p52==1))")||(F("((p255==0)||(p52==1))"))))))
Formula 0 simplified : FG!"((p255==0)||(p52==1))"
Detected timeout of ITS tools.
[2024-05-22 03:29:48] [INFO ] Flatten gal took : 9 ms
[2024-05-22 03:29:48] [INFO ] Applying decomposition
[2024-05-22 03:29:48] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10287668925236505687.txt' '-o' '/tmp/graph10287668925236505687.bin' '-w' '/tmp/graph10287668925236505687.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10287668925236505687.bin' '-l' '-1' '-v' '-w' '/tmp/graph10287668925236505687.weights' '-q' '0' '-e' '0.001'
[2024-05-22 03:29:48] [INFO ] Decomposing Gal with order
[2024-05-22 03:29:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 03:29:48] [INFO ] Removed a total of 62 redundant transitions.
[2024-05-22 03:29:48] [INFO ] Flatten gal took : 33 ms
[2024-05-22 03:29:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 4 ms.
[2024-05-22 03:29:48] [INFO ] Time to serialize gal into /tmp/LTL14972168984050191859.gal : 5 ms
[2024-05-22 03:29:48] [INFO ] Time to serialize properties into /tmp/LTL5676791495504949215.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14972168984050191859.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5676791495504949215.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i8.i1.u22.p255==0)||(u9.p52==1))")||(F("((i8.i1.u22.p255==0)||(u9.p52==1))"))))))
Formula 0 simplified : FG!"((i8.i1.u22.p255==0)||(u9.p52==1))"
Detected timeout of ITS tools.
Treatment of property DES-PT-20b-LTLCardinality-14 finished in 198847 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X((G(p2)||p1)))))'
Support contains 5 out of 327 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 327/327 places, 273/273 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 326 transition count 273
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 321 transition count 268
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 321 transition count 268
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 16 place count 316 transition count 263
Iterating global reduction 1 with 5 rules applied. Total rules applied 21 place count 316 transition count 263
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 25 place count 316 transition count 259
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 26 place count 315 transition count 258
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 315 transition count 258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 315 transition count 257
Applied a total of 28 rules in 16 ms. Remains 315 /327 variables (removed 12) and now considering 257/273 (removed 16) transitions.
// Phase 1: matrix 257 rows 315 cols
[2024-05-22 03:30:03] [INFO ] Computed 61 invariants in 6 ms
[2024-05-22 03:30:03] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-22 03:30:03] [INFO ] Invariant cache hit.
[2024-05-22 03:30:03] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-05-22 03:30:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 1/315 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 256 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 257/572 variables, 315/376 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-22 03:30:08] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-22 03:30:09] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 2 ms to minimize.
[2024-05-22 03:30:09] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-22 03:30:09] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-22 03:30:09] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-22 03:30:10] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 6/382 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-22 03:30:11] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-05-22 03:30:11] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-22 03:30:11] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-22 03:30:11] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-22 03:30:12] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-22 03:30:12] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-22 03:30:12] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-22 03:30:12] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-22 03:30:12] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 2 ms to minimize.
[2024-05-22 03:30:13] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 10/392 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-22 03:30:14] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-22 03:30:17] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 0 ms to minimize.
[2024-05-22 03:30:17] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2024-05-22 03:30:17] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 2 ms to minimize.
[2024-05-22 03:30:17] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-05-22 03:30:18] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-22 03:30:18] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-22 03:30:18] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-22 03:30:19] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-05-22 03:30:19] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 9/402 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-22 03:30:20] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-22 03:30:20] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-22 03:30:21] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 3/405 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-22 03:30:23] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/572 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-22 03:30:26] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/572 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-22 03:30:29] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-22 03:30:29] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2024-05-22 03:30:29] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/572 variables, 3/410 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-22 03:30:31] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-22 03:30:32] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-22 03:30:32] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/572 variables, and 413 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 315/315 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 1/315 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 37/98 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-22 03:30:35] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-22 03:30:35] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 2 ms to minimize.
[2024-05-22 03:30:35] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-22 03:30:35] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-22 03:30:35] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-22 03:30:35] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-22 03:30:35] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-22 03:30:36] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-22 03:30:37] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-22 03:30:37] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 10/108 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-22 03:30:37] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-22 03:30:37] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-22 03:30:38] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-22 03:30:39] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (OVERLAPS) 257/572 variables, 315/427 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 256/683 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-22 03:30:48] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-22 03:30:49] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 2 ms to minimize.
[2024-05-22 03:30:49] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 2 ms to minimize.
[2024-05-22 03:30:50] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 2 ms to minimize.
[2024-05-22 03:30:55] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 688 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 315/315 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 56/56 constraints]
After SMT, in 60074ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60078ms
Starting structural reductions in LTL mode, iteration 1 : 315/327 places, 257/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60539 ms. Remains : 315/327 places, 257/273 transitions.
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : DES-PT-20b-LTLCardinality-15
Product exploration explored 100000 steps with 33357 reset in 120 ms.
Product exploration explored 100000 steps with 33282 reset in 114 ms.
Computed a total of 136 stabilizing places and 129 stable transitions
Graph (complete) has 652 edges and 315 vertex of which 310 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Computed a total of 136 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p2)), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 149 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
RANDOM walk for 26834 steps (230 resets) in 104 ms. (255 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p2)), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p1))), (F (NOT (OR p2 p1))), (F p0), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT p2)), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT p1))]
Knowledge based reduction with 17 factoid took 417 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Support contains 5 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 257/257 transitions.
Applied a total of 0 rules in 3 ms. Remains 315 /315 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2024-05-22 03:31:05] [INFO ] Invariant cache hit.
[2024-05-22 03:31:05] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-05-22 03:31:05] [INFO ] Invariant cache hit.
[2024-05-22 03:31:06] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-05-22 03:31:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 1/315 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 256 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (OVERLAPS) 257/572 variables, 315/376 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-22 03:31:10] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 2 ms to minimize.
[2024-05-22 03:31:11] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-05-22 03:31:12] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2024-05-22 03:31:12] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-22 03:31:12] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2024-05-22 03:31:12] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 6/382 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-22 03:31:14] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-22 03:31:14] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-22 03:31:14] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-22 03:31:14] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-22 03:31:14] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-05-22 03:31:14] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-22 03:31:14] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-22 03:31:14] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-22 03:31:14] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 1 ms to minimize.
[2024-05-22 03:31:15] [INFO ] Deduced a trap composed of 45 places in 78 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 10/392 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-22 03:31:17] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-22 03:31:20] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-22 03:31:20] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 0 ms to minimize.
[2024-05-22 03:31:20] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 2 ms to minimize.
[2024-05-22 03:31:20] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-05-22 03:31:20] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-05-22 03:31:20] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-22 03:31:20] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-22 03:31:21] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2024-05-22 03:31:21] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 9/402 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-22 03:31:22] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-22 03:31:22] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
[2024-05-22 03:31:23] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 3/405 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-22 03:31:26] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/572 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-22 03:31:28] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/572 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-22 03:31:31] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-05-22 03:31:31] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-22 03:31:32] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/572 variables, 3/410 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-22 03:31:34] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-22 03:31:34] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-22 03:31:35] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/572 variables, and 413 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 315/315 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/314 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/314 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (OVERLAPS) 1/315 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 16/61 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 37/98 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-22 03:31:37] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-22 03:31:37] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-22 03:31:37] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-22 03:31:37] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-22 03:31:37] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-22 03:31:38] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-22 03:31:38] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-22 03:31:38] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-22 03:31:39] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-22 03:31:39] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 10/108 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-22 03:31:40] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-22 03:31:40] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-22 03:31:40] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-22 03:31:41] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 4/112 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (OVERLAPS) 257/572 variables, 315/427 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 256/683 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-22 03:31:51] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-22 03:31:51] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 2 ms to minimize.
[2024-05-22 03:31:51] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-05-22 03:31:53] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-22 03:31:57] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/572 variables, and 688 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 315/315 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 56/56 constraints]
After SMT, in 60079ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60084ms
Finished structural reductions in LTL mode , in 1 iterations and 60506 ms. Remains : 315/315 places, 257/257 transitions.
Computed a total of 136 stabilizing places and 129 stable transitions
Graph (complete) has 652 edges and 315 vertex of which 310 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 136 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p2)), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 131 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
RANDOM walk for 33966 steps (296 resets) in 186 ms. (181 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p0) p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X p2)), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p1))), (F (NOT (OR p2 p1))), (F p0), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT p2)), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT p1))]
Knowledge based reduction with 17 factoid took 426 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Product exploration explored 100000 steps with 33314 reset in 113 ms.
Product exploration explored 100000 steps with 33240 reset in 118 ms.
Applying partial POR strategy [false, true, false, true, true]
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Support contains 5 out of 315 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 315/315 places, 257/257 transitions.
Graph (complete) has 652 edges and 315 vertex of which 310 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 310 transition count 254
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 13 place count 310 transition count 256
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 20 place count 310 transition count 256
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 25 place count 305 transition count 251
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 30 place count 305 transition count 251
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 76 rules applied. Total rules applied 106 place count 305 transition count 254
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 115 place count 296 transition count 245
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 124 place count 296 transition count 245
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 130 place count 296 transition count 273
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 132 place count 294 transition count 267
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 134 place count 294 transition count 267
Deduced a syphon composed of 85 places in 0 ms
Applied a total of 134 rules in 68 ms. Remains 294 /315 variables (removed 21) and now considering 267/257 (removed -10) transitions.
[2024-05-22 03:32:08] [INFO ] Redundant transitions in 0 ms returned []
Running 266 sub problems to find dead transitions.
// Phase 1: matrix 267 rows 294 cols
[2024-05-22 03:32:08] [INFO ] Computed 59 invariants in 3 ms
[2024-05-22 03:32:08] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/293 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (OVERLAPS) 1/294 variables, 32/45 constraints. Problems are: Problem set: 0 solved, 266 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 14/59 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 266 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem 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 TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
At refinement iteration 5 (OVERLAPS) 267/561 variables, 294/353 constraints. Problems are: Problem set: 108 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 12/365 constraints. Problems are: Problem set: 108 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/561 variables, 0/365 constraints. Problems are: Problem set: 108 solved, 158 unsolved
At refinement iteration 8 (OVERLAPS) 0/561 variables, 0/365 constraints. Problems are: Problem set: 108 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 561/561 variables, and 365 constraints, problems are : Problem set: 108 solved, 158 unsolved in 8093 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 294/294 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 108 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 13/13 constraints. Problems are: Problem set: 108 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/13 constraints. Problems are: Problem set: 108 solved, 158 unsolved
At refinement iteration 2 (OVERLAPS) 65/273 variables, 32/45 constraints. Problems are: Problem set: 108 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 1/46 constraints. Problems are: Problem set: 108 solved, 158 unsolved
[2024-05-22 03:32:17] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 1/47 constraints. Problems are: Problem set: 108 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/47 constraints. Problems are: Problem set: 108 solved, 158 unsolved
At refinement iteration 6 (OVERLAPS) 13/286 variables, 13/60 constraints. Problems are: Problem set: 108 solved, 158 unsolved
[2024-05-22 03:32:18] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-22 03:32:18] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-22 03:32:19] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-22 03:32:19] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-22 03:32:19] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-22 03:32:19] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-22 03:32:19] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-22 03:32:19] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-22 03:32:19] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-22 03:32:19] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 10/70 constraints. Problems are: Problem set: 108 solved, 158 unsolved
[2024-05-22 03:32:19] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2024-05-22 03:32:20] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 2/72 constraints. Problems are: Problem set: 108 solved, 158 unsolved
[2024-05-22 03:32:21] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 3 ms to minimize.
[2024-05-22 03:32:21] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-22 03:32:21] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-22 03:32:21] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 4/76 constraints. Problems are: Problem set: 108 solved, 158 unsolved
[2024-05-22 03:32:22] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2024-05-22 03:32:22] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 2/78 constraints. Problems are: Problem set: 108 solved, 158 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 0/78 constraints. Problems are: Problem set: 108 solved, 158 unsolved
At refinement iteration 12 (OVERLAPS) 263/549 variables, 286/364 constraints. Problems are: Problem set: 108 solved, 158 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/549 variables, 12/376 constraints. Problems are: Problem set: 108 solved, 158 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/549 variables, 158/534 constraints. Problems are: Problem set: 108 solved, 158 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/549 variables, 0/534 constraints. Problems are: Problem set: 108 solved, 158 unsolved
At refinement iteration 16 (OVERLAPS) 12/561 variables, 8/542 constraints. Problems are: Problem set: 108 solved, 158 unsolved
[2024-05-22 03:32:37] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/561 variables, 1/543 constraints. Problems are: Problem set: 108 solved, 158 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 561/561 variables, and 543 constraints, problems are : Problem set: 108 solved, 158 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 294/294 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 158/266 constraints, Known Traps: 20/20 constraints]
After SMT, in 38210ms problems are : Problem set: 108 solved, 158 unsolved
Search for dead transitions found 108 dead transitions in 38216ms
Found 108 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 108 transitions
Dead transitions reduction (with SMT) removed 108 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 294/315 places, 159/257 transitions.
Graph (complete) has 653 edges and 294 vertex of which 209 are kept as prefixes of interest. Removing 85 places using SCC suffix rule.0 ms
Discarding 85 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 167
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 2 rules in 9 ms. Remains 209 /294 variables (removed 85) and now considering 167/159 (removed -8) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 209/315 places, 167/257 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 38304 ms. Remains : 209/315 places, 167/257 transitions.
Built C files in :
/tmp/ltsmin5210426847956420683
[2024-05-22 03:32:46] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5210426847956420683
Running compilation step : cd /tmp/ltsmin5210426847956420683;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 493 ms.
Running link step : cd /tmp/ltsmin5210426847956420683;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin5210426847956420683;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16163798792866345926.hoa' '--buchi-type=spotba'
LTSmin run took 6159 ms.
FORMULA DES-PT-20b-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-20b-LTLCardinality-15 finished in 169778 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G((X(p2)||p1)))))'
Found a Lengthening insensitive property : DES-PT-20b-LTLCardinality-11
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 327 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 327/327 places, 273/273 transitions.
Graph (complete) has 681 edges and 327 vertex of which 321 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 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 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 320 transition count 257
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 308 transition count 256
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 307 transition count 256
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 27 place count 307 transition count 246
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 47 place count 297 transition count 246
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 53 place count 291 transition count 240
Iterating global reduction 3 with 6 rules applied. Total rules applied 59 place count 291 transition count 240
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 65 place count 285 transition count 234
Iterating global reduction 3 with 6 rules applied. Total rules applied 71 place count 285 transition count 234
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 3 with 6 rules applied. Total rules applied 77 place count 285 transition count 228
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 79 place count 284 transition count 227
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 79 place count 284 transition count 224
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 85 place count 281 transition count 224
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 5 with 150 rules applied. Total rules applied 235 place count 206 transition count 149
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
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 239 place count 204 transition count 151
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 241 place count 204 transition count 151
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 243 place count 202 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 244 place count 201 transition count 149
Applied a total of 244 rules in 33 ms. Remains 201 /327 variables (removed 126) and now considering 149/273 (removed 124) transitions.
// Phase 1: matrix 149 rows 201 cols
[2024-05-22 03:32:53] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 03:32:53] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-22 03:32:53] [INFO ] Invariant cache hit.
[2024-05-22 03:32:53] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-05-22 03:32:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 146 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/200 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 149/349 variables, 200/258 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 1/350 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-22 03:32:56] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-22 03:32:56] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-22 03:32:57] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-22 03:32:57] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-22 03:32:58] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 12 (OVERLAPS) 0/350 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 264 constraints, problems are : Problem set: 0 solved, 146 unsolved in 7853 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 2/200 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 149/349 variables, 200/263 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 146/409 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-22 03:33:07] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 1/350 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/350 variables, and 411 constraints, problems are : Problem set: 0 solved, 146 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 6/6 constraints]
After SMT, in 37914ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 37917ms
Starting structural reductions in LI_LTL mode, iteration 1 : 201/327 places, 149/273 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 38265 ms. Remains : 201/327 places, 149/273 transitions.
Running random walk in product with property : DES-PT-20b-LTLCardinality-11
Product exploration explored 100000 steps with 6548 reset in 189 ms.
Product exploration explored 100000 steps with 6628 reset in 205 ms.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X p1), (X p2), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X p2))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 8 factoid took 177 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 3 to 1
RANDOM walk for 29 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X p1), (X p2), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X p2))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (OR p1 p2))), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 8 factoid took 234 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 201 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 149/149 transitions.
Applied a total of 0 rules in 4 ms. Remains 201 /201 variables (removed 0) and now considering 149/149 (removed 0) transitions.
[2024-05-22 03:33:32] [INFO ] Invariant cache hit.
[2024-05-22 03:33:32] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-22 03:33:32] [INFO ] Invariant cache hit.
[2024-05-22 03:33:33] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-05-22 03:33:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 146 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/200 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 149/349 variables, 200/258 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 1/350 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-22 03:33:35] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-22 03:33:36] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-22 03:33:36] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-22 03:33:37] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-22 03:33:38] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 12 (OVERLAPS) 0/350 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 264 constraints, problems are : Problem set: 0 solved, 146 unsolved in 7818 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 2/200 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 149/349 variables, 200/263 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 146/409 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-22 03:33:47] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 1/350 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/350 variables, and 411 constraints, problems are : Problem set: 0 solved, 146 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 6/6 constraints]
After SMT, in 37880ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 37882ms
Finished structural reductions in LTL mode , in 1 iterations and 38187 ms. Remains : 201/201 places, 149/149 transitions.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p2), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 90 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 3 to 1
RANDOM walk for 25 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p2), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X p2))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 188 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 6558 reset in 191 ms.
Product exploration explored 100000 steps with 6577 reset in 210 ms.
Built C files in :
/tmp/ltsmin18020261603903162627
[2024-05-22 03:34:12] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18020261603903162627
Running compilation step : cd /tmp/ltsmin18020261603903162627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 338 ms.
Running link step : cd /tmp/ltsmin18020261603903162627;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin18020261603903162627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14307313513100535494.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 201 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 201/201 places, 149/149 transitions.
Applied a total of 0 rules in 3 ms. Remains 201 /201 variables (removed 0) and now considering 149/149 (removed 0) transitions.
[2024-05-22 03:34:27] [INFO ] Invariant cache hit.
[2024-05-22 03:34:27] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-22 03:34:27] [INFO ] Invariant cache hit.
[2024-05-22 03:34:27] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-05-22 03:34:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 146 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/200 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (OVERLAPS) 149/349 variables, 200/258 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/349 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 1/350 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-22 03:34:30] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-22 03:34:30] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-22 03:34:31] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-22 03:34:31] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-22 03:34:32] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 12 (OVERLAPS) 0/350 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 350/350 variables, and 264 constraints, problems are : Problem set: 0 solved, 146 unsolved in 8073 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 2/200 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 149/349 variables, 200/263 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/349 variables, 146/409 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-22 03:34:41] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 1/350 variables, 1/411 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 146 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/350 variables, and 411 constraints, problems are : Problem set: 0 solved, 146 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 201/201 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 6/6 constraints]
After SMT, in 38124ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 38127ms
Finished structural reductions in LTL mode , in 1 iterations and 38481 ms. Remains : 201/201 places, 149/149 transitions.
Built C files in :
/tmp/ltsmin10259851591446557593
[2024-05-22 03:35:05] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10259851591446557593
Running compilation step : cd /tmp/ltsmin10259851591446557593;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 342 ms.
Running link step : cd /tmp/ltsmin10259851591446557593;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin10259851591446557593;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18086002116286814373.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 03:35:20] [INFO ] Flatten gal took : 19 ms
[2024-05-22 03:35:20] [INFO ] Flatten gal took : 17 ms
[2024-05-22 03:35:20] [INFO ] Time to serialize gal into /tmp/LTL4026925160087657358.gal : 2 ms
[2024-05-22 03:35:20] [INFO ] Time to serialize properties into /tmp/LTL9805909370069993377.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4026925160087657358.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14273412101863826543.hoa' '-atoms' '/tmp/LTL9805909370069993377.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9805909370069993377.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14273412101863826543.hoa
Detected timeout of ITS tools.
[2024-05-22 03:35:35] [INFO ] Flatten gal took : 8 ms
[2024-05-22 03:35:35] [INFO ] Flatten gal took : 7 ms
[2024-05-22 03:35:35] [INFO ] Time to serialize gal into /tmp/LTL12940626026031967881.gal : 1 ms
[2024-05-22 03:35:35] [INFO ] Time to serialize properties into /tmp/LTL5950590357373134503.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12940626026031967881.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5950590357373134503.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("((p358==0)||(p165==1))"))&&(F(G(("((p330==0)||(p84==1))")||(X("((p330==0)||(p84==1))")))))))
Formula 0 simplified : G!"((p358==0)||(p165==1))" | GF(!"((p330==0)||(p84==1))" & X!"((p330==0)||(p84==1))")
Detected timeout of ITS tools.
[2024-05-22 03:35:50] [INFO ] Flatten gal took : 7 ms
[2024-05-22 03:35:50] [INFO ] Applying decomposition
[2024-05-22 03:35:50] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2717852379264355881.txt' '-o' '/tmp/graph2717852379264355881.bin' '-w' '/tmp/graph2717852379264355881.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2717852379264355881.bin' '-l' '-1' '-v' '-w' '/tmp/graph2717852379264355881.weights' '-q' '0' '-e' '0.001'
[2024-05-22 03:35:50] [INFO ] Decomposing Gal with order
[2024-05-22 03:35:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 03:35:51] [INFO ] Removed a total of 44 redundant transitions.
[2024-05-22 03:35:51] [INFO ] Flatten gal took : 10 ms
[2024-05-22 03:35:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3 ms.
[2024-05-22 03:35:51] [INFO ] Time to serialize gal into /tmp/LTL10183905929424553901.gal : 2 ms
[2024-05-22 03:35:51] [INFO ] Time to serialize properties into /tmp/LTL1221710802564846795.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10183905929424553901.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1221710802564846795.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((F("((u47.p358==0)||(i0.u6.p165==1))"))&&(F(G(("((i5.i1.u41.p330==0)||(i1.u2.p84==1))")||(X("((i5.i1.u41.p330==0)||(i1.u2.p84==1))"...162
Formula 0 simplified : G!"((u47.p358==0)||(i0.u6.p165==1))" | GF(!"((i5.i1.u41.p330==0)||(i1.u2.p84==1))" & X!"((i5.i1.u41.p330==0)||(i1.u2.p84==1))")
Reverse transition relation is NOT exact ! Due to transitions t266_t80, t7_t49_t40, t233_t35, t232_t26, t108_t109_t131_t272_t137_t138_t134_t135_t123_t124, ...671
Computing Next relation with stutter on 2.94147e+07 deadlock states
65 unique states visited
64 strongly connected components in search stack
67 transitions explored
65 items max in DFS search stack
1197 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,12.0087,389952,1,0,1.01886e+06,32826,1883,857139,2156,181077,1582594
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property DES-PT-20b-LTLCardinality-11 finished in 192575 ms.
FORMULA DES-PT-20b-LTLCardinality-11 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(G((F(p1)||p0))))'
[2024-05-22 03:36:05] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12523097403133636456
[2024-05-22 03:36:05] [INFO ] Applying decomposition
[2024-05-22 03:36:05] [INFO ] Computing symmetric may disable matrix : 273 transitions.
[2024-05-22 03:36:05] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 03:36:05] [INFO ] Computing symmetric may enable matrix : 273 transitions.
[2024-05-22 03:36:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 03:36:05] [INFO ] Flatten gal took : 7 ms
[2024-05-22 03:36:05] [INFO ] Computing Do-Not-Accords matrix : 273 transitions.
[2024-05-22 03:36:05] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12878205695392133598.txt' '-o' '/tmp/graph12878205695392133598.bin' '-w' '/tmp/graph12878205695392133598.weights'
[2024-05-22 03:36:05] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12523097403133636456
Running compilation step : cd /tmp/ltsmin12523097403133636456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12878205695392133598.bin' '-l' '-1' '-v' '-w' '/tmp/graph12878205695392133598.weights' '-q' '0' '-e' '0.001'
[2024-05-22 03:36:05] [INFO ] Decomposing Gal with order
[2024-05-22 03:36:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 03:36:05] [INFO ] Removed a total of 20 redundant transitions.
[2024-05-22 03:36:05] [INFO ] Flatten gal took : 14 ms
[2024-05-22 03:36:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 03:36:05] [INFO ] Time to serialize gal into /tmp/LTLCardinality16549886136960589363.gal : 3 ms
[2024-05-22 03:36:05] [INFO ] Time to serialize properties into /tmp/LTLCardinality3646072803370015589.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16549886136960589363.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3646072803370015589.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i7.u43.p255==0)||(u34.p52==1))")||(F("((i7.u43.p255==0)||(u34.p52==1))"))))))
Formula 0 simplified : FG!"((i7.u43.p255==0)||(u34.p52==1))"
Compilation finished in 634 ms.
Running link step : cd /tmp/ltsmin12523097403133636456;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12523097403133636456;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((<>((LTLAPp4==true))||(LTLAPp3==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t53, t55, t201, t232, t233, t266, u34.t80, i0.t124, i0.u8.t186, i0.u8.t187, i0.u8.t188, i0.u8...983
Computing Next relation with stutter on 1.769e+08 deadlock states
502 unique states visited
0 strongly connected components in search stack
513 transitions explored
267 items max in DFS search stack
37027 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,370.315,2211184,1,0,4.99478e+06,33395,2159,8.04427e+06,802,250723,2014763
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DES-PT-20b-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2287197 ms.

BK_STOP 1716349824642

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-20b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DES-PT-20b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r092-tall-171624189800691"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20b.tgz
mv DES-PT-20b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;