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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Jun 12 13:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 12 13:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 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 795K 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 ASLink-PT-05b-LTLCardinality-00
FORMULA_NAME ASLink-PT-05b-LTLCardinality-01
FORMULA_NAME ASLink-PT-05b-LTLCardinality-02
FORMULA_NAME ASLink-PT-05b-LTLCardinality-03
FORMULA_NAME ASLink-PT-05b-LTLCardinality-04
FORMULA_NAME ASLink-PT-05b-LTLCardinality-05
FORMULA_NAME ASLink-PT-05b-LTLCardinality-06
FORMULA_NAME ASLink-PT-05b-LTLCardinality-07
FORMULA_NAME ASLink-PT-05b-LTLCardinality-08
FORMULA_NAME ASLink-PT-05b-LTLCardinality-09

=== Now, execution of the tool begins

BK_START 1718215425977

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-05b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-12 18:03:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-12 18:03:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-12 18:03:49] [INFO ] Load time of PNML (sax parser for PT used): 590 ms
[2024-06-12 18:03:49] [INFO ] Transformed 2430 places.
[2024-06-12 18:03:49] [INFO ] Transformed 3040 transitions.
[2024-06-12 18:03:49] [INFO ] Found NUPN structural information;
[2024-06-12 18:03:49] [INFO ] Parsed PT model containing 2430 places and 3040 transitions and 9292 arcs in 1033 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 40 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ASLink-PT-05b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-05b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 2430 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2430/2430 places, 3040/3040 transitions.
Discarding 149 places :
Symmetric choice reduction at 0 with 149 rule applications. Total rules 149 place count 2281 transition count 2891
Iterating global reduction 0 with 149 rules applied. Total rules applied 298 place count 2281 transition count 2891
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 299 place count 2281 transition count 2890
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 355 place count 2225 transition count 2801
Iterating global reduction 1 with 56 rules applied. Total rules applied 411 place count 2225 transition count 2801
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 429 place count 2225 transition count 2783
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 438 place count 2216 transition count 2774
Iterating global reduction 2 with 9 rules applied. Total rules applied 447 place count 2216 transition count 2774
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 451 place count 2212 transition count 2763
Iterating global reduction 2 with 4 rules applied. Total rules applied 455 place count 2212 transition count 2763
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 458 place count 2209 transition count 2760
Iterating global reduction 2 with 3 rules applied. Total rules applied 461 place count 2209 transition count 2760
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 464 place count 2206 transition count 2750
Iterating global reduction 2 with 3 rules applied. Total rules applied 467 place count 2206 transition count 2750
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 468 place count 2205 transition count 2742
Iterating global reduction 2 with 1 rules applied. Total rules applied 469 place count 2205 transition count 2742
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 470 place count 2204 transition count 2741
Iterating global reduction 2 with 1 rules applied. Total rules applied 471 place count 2204 transition count 2741
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 472 place count 2203 transition count 2733
Iterating global reduction 2 with 1 rules applied. Total rules applied 473 place count 2203 transition count 2733
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 474 place count 2202 transition count 2725
Iterating global reduction 2 with 1 rules applied. Total rules applied 475 place count 2202 transition count 2725
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 476 place count 2201 transition count 2724
Iterating global reduction 2 with 1 rules applied. Total rules applied 477 place count 2201 transition count 2724
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 478 place count 2200 transition count 2716
Iterating global reduction 2 with 1 rules applied. Total rules applied 479 place count 2200 transition count 2716
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 480 place count 2199 transition count 2708
Iterating global reduction 2 with 1 rules applied. Total rules applied 481 place count 2199 transition count 2708
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 482 place count 2198 transition count 2707
Iterating global reduction 2 with 1 rules applied. Total rules applied 483 place count 2198 transition count 2707
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 484 place count 2197 transition count 2699
Iterating global reduction 2 with 1 rules applied. Total rules applied 485 place count 2197 transition count 2699
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 486 place count 2196 transition count 2691
Iterating global reduction 2 with 1 rules applied. Total rules applied 487 place count 2196 transition count 2691
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 488 place count 2195 transition count 2690
Iterating global reduction 2 with 1 rules applied. Total rules applied 489 place count 2195 transition count 2690
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 490 place count 2194 transition count 2682
Iterating global reduction 2 with 1 rules applied. Total rules applied 491 place count 2194 transition count 2682
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 492 place count 2193 transition count 2674
Iterating global reduction 2 with 1 rules applied. Total rules applied 493 place count 2193 transition count 2674
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 494 place count 2192 transition count 2673
Iterating global reduction 2 with 1 rules applied. Total rules applied 495 place count 2192 transition count 2673
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 496 place count 2191 transition count 2665
Iterating global reduction 2 with 1 rules applied. Total rules applied 497 place count 2191 transition count 2665
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 498 place count 2190 transition count 2657
Iterating global reduction 2 with 1 rules applied. Total rules applied 499 place count 2190 transition count 2657
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 500 place count 2189 transition count 2656
Iterating global reduction 2 with 1 rules applied. Total rules applied 501 place count 2189 transition count 2656
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 502 place count 2188 transition count 2648
Iterating global reduction 2 with 1 rules applied. Total rules applied 503 place count 2188 transition count 2648
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 504 place count 2187 transition count 2640
Iterating global reduction 2 with 1 rules applied. Total rules applied 505 place count 2187 transition count 2640
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 506 place count 2186 transition count 2639
Iterating global reduction 2 with 1 rules applied. Total rules applied 507 place count 2186 transition count 2639
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 508 place count 2185 transition count 2631
Iterating global reduction 2 with 1 rules applied. Total rules applied 509 place count 2185 transition count 2631
Applied a total of 509 rules in 5562 ms. Remains 2185 /2430 variables (removed 245) and now considering 2631/3040 (removed 409) transitions.
// Phase 1: matrix 2631 rows 2185 cols
[2024-06-12 18:03:56] [INFO ] Computed 238 invariants in 251 ms
[2024-06-12 18:03:59] [INFO ] Implicit Places using invariants in 3009 ms returned [2019, 2030, 2041, 2049, 2057, 2065, 2073, 2084, 2092, 2100, 2111]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 3072 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2174/2430 places, 2631/3040 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 2161 transition count 2618
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 2161 transition count 2618
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 2150 transition count 2607
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 2150 transition count 2607
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 2141 transition count 2598
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 2141 transition count 2598
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 2137 transition count 2594
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 2137 transition count 2594
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 2135 transition count 2592
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 2135 transition count 2592
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 2133 transition count 2590
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 2133 transition count 2590
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 2131 transition count 2588
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 2131 transition count 2588
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 2129 transition count 2586
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 2129 transition count 2586
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 2128 transition count 2585
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 2128 transition count 2585
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 2127 transition count 2584
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 2127 transition count 2584
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 2126 transition count 2583
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 2126 transition count 2583
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 2125 transition count 2582
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 2125 transition count 2582
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 2124 transition count 2581
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 2124 transition count 2581
Applied a total of 100 rules in 2238 ms. Remains 2124 /2174 variables (removed 50) and now considering 2581/2631 (removed 50) transitions.
// Phase 1: matrix 2581 rows 2124 cols
[2024-06-12 18:04:01] [INFO ] Computed 227 invariants in 56 ms
[2024-06-12 18:04:03] [INFO ] Implicit Places using invariants in 2133 ms returned []
[2024-06-12 18:04:03] [INFO ] Invariant cache hit.
[2024-06-12 18:04:10] [INFO ] Implicit Places using invariants and state equation in 7492 ms returned []
Implicit Place search using SMT with State Equation took 9632 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2124/2430 places, 2581/3040 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 20536 ms. Remains : 2124/2430 places, 2581/3040 transitions.
Support contains 22 out of 2124 places after structural reductions.
[2024-06-12 18:04:11] [INFO ] Flatten gal took : 424 ms
[2024-06-12 18:04:11] [INFO ] Flatten gal took : 209 ms
[2024-06-12 18:04:12] [INFO ] Input system was already deterministic with 2581 transitions.
RANDOM walk for 40000 steps (82 resets) in 2553 ms. (15 steps per ms) remains 6/12 properties
BEST_FIRST walk for 40004 steps (9 resets) in 347 ms. (114 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 312 ms. (127 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 268 ms. (148 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (10 resets) in 261 ms. (152 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 275 ms. (144 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (11 resets) in 271 ms. (147 steps per ms) remains 6/6 properties
[2024-06-12 18:04:14] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 87/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 547/644 variables, 51/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/644 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1423/2067 variables, 163/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2067 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 57/2124 variables, 7/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2124 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2581/4705 variables, 2124/2351 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4705 variables, 0/2351 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4705/4705 variables, and 2351 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 170/170 constraints, State Equation: 2124/2124 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 87/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 547/644 variables, 51/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-12 18:04:19] [INFO ] Deduced a trap composed of 49 places in 215 ms of which 44 ms to minimize.
[2024-06-12 18:04:20] [INFO ] Deduced a trap composed of 109 places in 180 ms of which 4 ms to minimize.
[2024-06-12 18:04:20] [INFO ] Deduced a trap composed of 113 places in 139 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/644 variables, 3/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/644 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1423/2067 variables, 163/223 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-12 18:04:22] [INFO ] Deduced a trap composed of 24 places in 1403 ms of which 19 ms to minimize.
[2024-06-12 18:04:24] [INFO ] Deduced a trap composed of 24 places in 2111 ms of which 26 ms to minimize.
SMT process timed out in 10593ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 2124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2124/2124 places, 2581/2581 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 385 transitions
Trivial Post-agglo rules discarded 385 transitions
Performed 385 trivial Post agglomeration. Transition count delta: 385
Iterating post reduction 0 with 385 rules applied. Total rules applied 385 place count 2124 transition count 2196
Reduce places removed 385 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 388 rules applied. Total rules applied 773 place count 1739 transition count 2193
Reduce places removed 2 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 7 rules applied. Total rules applied 780 place count 1737 transition count 2188
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 785 place count 1732 transition count 2188
Performed 569 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 569 Pre rules applied. Total rules applied 785 place count 1732 transition count 1619
Deduced a syphon composed of 569 places in 4 ms
Ensure Unique test removed 52 places
Reduce places removed 621 places and 0 transitions.
Iterating global reduction 4 with 1190 rules applied. Total rules applied 1975 place count 1111 transition count 1619
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 4 with 39 rules applied. Total rules applied 2014 place count 1105 transition count 1586
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 34 rules applied. Total rules applied 2048 place count 1072 transition count 1585
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2049 place count 1071 transition count 1585
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 20 Pre rules applied. Total rules applied 2049 place count 1071 transition count 1565
Deduced a syphon composed of 20 places in 10 ms
Ensure Unique test removed 20 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 60 rules applied. Total rules applied 2109 place count 1031 transition count 1565
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 19 Pre rules applied. Total rules applied 2109 place count 1031 transition count 1546
Deduced a syphon composed of 19 places in 19 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 2147 place count 1012 transition count 1546
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 171
Deduced a syphon composed of 171 places in 11 ms
Ensure Unique test removed 2 places
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 7 with 344 rules applied. Total rules applied 2491 place count 839 transition count 1375
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2495 place count 835 transition count 1371
Ensure Unique test removed 1 places
Iterating global reduction 7 with 5 rules applied. Total rules applied 2500 place count 834 transition count 1371
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 7 with 1 rules applied. Total rules applied 2501 place count 834 transition count 1370
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2502 place count 833 transition count 1370
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 2502 place count 833 transition count 1369
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2504 place count 832 transition count 1369
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2506 place count 830 transition count 1367
Iterating global reduction 9 with 2 rules applied. Total rules applied 2508 place count 830 transition count 1367
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 9 with 2 rules applied. Total rules applied 2510 place count 830 transition count 1365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2511 place count 829 transition count 1365
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 2513 place count 828 transition count 1370
Free-agglomeration rule applied 6 times.
Iterating global reduction 11 with 6 rules applied. Total rules applied 2519 place count 828 transition count 1364
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 2525 place count 822 transition count 1364
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 12 with 4 rules applied. Total rules applied 2529 place count 822 transition count 1360
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 2533 place count 818 transition count 1360
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 13 with 5 rules applied. Total rules applied 2538 place count 818 transition count 1360
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 2539 place count 817 transition count 1359
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 13 with 15 rules applied. Total rules applied 2554 place count 807 transition count 1354
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 2559 place count 802 transition count 1354
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 15 Pre rules applied. Total rules applied 2559 place count 802 transition count 1339
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 15 with 31 rules applied. Total rules applied 2590 place count 786 transition count 1339
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 15 with 6 rules applied. Total rules applied 2596 place count 780 transition count 1339
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2596 place count 780 transition count 1338
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2598 place count 779 transition count 1338
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 16 with 22 rules applied. Total rules applied 2620 place count 768 transition count 1327
Discarding 5 places :
Symmetric choice reduction at 16 with 5 rule applications. Total rules 2625 place count 763 transition count 1322
Iterating global reduction 16 with 5 rules applied. Total rules applied 2630 place count 763 transition count 1322
Free-agglomeration rule applied 5 times.
Iterating global reduction 16 with 5 rules applied. Total rules applied 2635 place count 763 transition count 1317
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 16 with 5 rules applied. Total rules applied 2640 place count 758 transition count 1317
Applied a total of 2640 rules in 1857 ms. Remains 758 /2124 variables (removed 1366) and now considering 1317/2581 (removed 1264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1858 ms. Remains : 758/2124 places, 1317/2581 transitions.
RANDOM walk for 40000 steps (463 resets) in 429 ms. (93 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (96 resets) in 147 ms. (270 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (92 resets) in 161 ms. (246 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (97 resets) in 143 ms. (277 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (94 resets) in 142 ms. (279 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (86 resets) in 111 ms. (357 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (91 resets) in 160 ms. (248 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 202834 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 6
Probabilistic random walk after 202834 steps, saw 44513 distinct states, run finished after 3006 ms. (steps per millisecond=67 ) properties seen :0
// Phase 1: matrix 1317 rows 758 cols
[2024-06-12 18:04:30] [INFO ] Computed 129 invariants in 32 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 51/61 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 5/66 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 242/308 variables, 29/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 90/398 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 5/403 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 262/665 variables, 46/102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/665 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 32/697 variables, 9/111 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/697 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 59/756 variables, 16/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/756 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 1/757 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/757 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 1/758 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/758 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 1317/2075 variables, 758/887 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2075 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 0/2075 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2075/2075 variables, and 887 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2303 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 92/92 constraints, State Equation: 758/758 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 51/61 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 5/66 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 242/308 variables, 29/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/308 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 90/398 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 5/403 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 262/665 variables, 46/102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/665 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 32/697 variables, 9/111 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/697 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 59/756 variables, 16/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/756 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 1/757 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/757 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 1/758 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/758 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 1317/2075 variables, 758/887 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2075 variables, 6/893 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-12 18:04:48] [INFO ] Deduced a trap composed of 63 places in 496 ms of which 8 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/2075 variables, 1/894 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2075 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2075/2075 variables, and 894 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45011 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 92/92 constraints, State Equation: 758/758 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 47367ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 758 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 1317/1317 transitions.
Applied a total of 0 rules in 50 ms. Remains 758 /758 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 758/758 places, 1317/1317 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 1317/1317 transitions.
Applied a total of 0 rules in 32 ms. Remains 758 /758 variables (removed 0) and now considering 1317/1317 (removed 0) transitions.
[2024-06-12 18:05:17] [INFO ] Invariant cache hit.
[2024-06-12 18:05:18] [INFO ] Implicit Places using invariants in 1161 ms returned [1, 18, 19, 31, 48, 66, 108, 142, 146, 155, 156, 158, 175, 193, 263, 267, 268, 279, 280, 282, 299, 317, 386, 390, 391, 402, 404, 406, 424, 442, 512, 516, 517, 528, 529, 531, 548, 566, 637, 641, 642, 645, 656, 657, 658, 676, 697, 698, 699, 700]
[2024-06-12 18:05:18] [INFO ] Actually due to overlaps returned [676, 658, 48, 175, 299, 424, 548, 31, 158, 282, 406, 531, 155, 279, 402, 528, 656, 697, 156, 280, 404, 529, 657, 698, 1, 18, 267, 268, 390, 391, 516, 517, 641, 642, 66, 193, 317, 442, 566, 699, 19, 108, 645, 700]
Discarding 44 places :
Implicit Place search using SMT only with invariants took 1169 ms to find 44 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 714/758 places, 1317/1317 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 94 rules applied. Total rules applied 94 place count 709 transition count 1228
Reduce places removed 89 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 95 rules applied. Total rules applied 189 place count 620 transition count 1222
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 191 place count 618 transition count 1222
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 191 place count 618 transition count 1195
Deduced a syphon composed of 27 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 246 place count 590 transition count 1195
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 258 place count 586 transition count 1187
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 266 place count 578 transition count 1187
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 269 place count 575 transition count 1184
Iterating global reduction 5 with 3 rules applied. Total rules applied 272 place count 575 transition count 1184
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 275 place count 575 transition count 1181
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 6 with 70 rules applied. Total rules applied 345 place count 540 transition count 1146
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 350 place count 535 transition count 1141
Iterating global reduction 6 with 5 rules applied. Total rules applied 355 place count 535 transition count 1141
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 360 place count 535 transition count 1136
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 364 place count 533 transition count 1137
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 7 with 13 rules applied. Total rules applied 377 place count 533 transition count 1124
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 391 place count 519 transition count 1124
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 392 place count 519 transition count 1123
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 8 with 13 rules applied. Total rules applied 405 place count 519 transition count 1123
Applied a total of 405 rules in 404 ms. Remains 519 /714 variables (removed 195) and now considering 1123/1317 (removed 194) transitions.
// Phase 1: matrix 1123 rows 519 cols
[2024-06-12 18:05:19] [INFO ] Computed 74 invariants in 20 ms
[2024-06-12 18:05:20] [INFO ] Implicit Places using invariants in 1024 ms returned [75, 96, 102, 105, 107, 108, 111, 112, 165, 181, 187, 193, 198, 199, 252, 268, 274, 277, 279, 284, 285, 340, 357, 363, 366, 368, 373, 374, 427, 443, 450, 453, 455]
[2024-06-12 18:05:20] [INFO ] Actually due to overlaps returned [111, 198, 284, 373, 112, 199, 285, 374, 96, 102, 107, 181, 187, 268, 274, 279, 357, 363, 368, 443, 455, 75, 108, 165, 193, 252, 340, 427, 450]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 1041 ms to find 29 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 490/758 places, 1123/1317 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 472 transition count 1105
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 472 transition count 1105
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 468 transition count 1101
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 468 transition count 1101
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 64 place count 458 transition count 1091
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 79 place count 458 transition count 1076
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 94 place count 443 transition count 1076
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 99 place count 443 transition count 1071
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 104 place count 438 transition count 1071
Applied a total of 104 rules in 218 ms. Remains 438 /490 variables (removed 52) and now considering 1071/1123 (removed 52) transitions.
// Phase 1: matrix 1071 rows 438 cols
[2024-06-12 18:05:20] [INFO ] Computed 45 invariants in 18 ms
[2024-06-12 18:05:21] [INFO ] Implicit Places using invariants in 740 ms returned []
[2024-06-12 18:05:21] [INFO ] Invariant cache hit.
[2024-06-12 18:05:22] [INFO ] Implicit Places using invariants and state equation in 1796 ms returned []
Implicit Place search using SMT with State Equation took 2540 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 438/758 places, 1071/1317 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5405 ms. Remains : 438/758 places, 1071/1317 transitions.
RANDOM walk for 40000 steps (739 resets) in 256 ms. (155 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (176 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (179 resets) in 137 ms. (289 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (181 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (176 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (183 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (168 resets) in 91 ms. (434 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 244418 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :1 out of 6
Probabilistic random walk after 244418 steps, saw 60534 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :1
[2024-06-12 18:05:26] [INFO ] Invariant cache hit.
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, 5 unsolved
At refinement iteration 1 (OVERLAPS) 43/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 251/302 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 28/330 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 108/438 variables, 17/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1071/1509 variables, 438/483 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-12 18:05:27] [INFO ] Deduced a trap composed of 55 places in 155 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1509 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1509 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/1509 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1509/1509 variables, and 484 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1541 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 438/438 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 43/51 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 251/302 variables, 18/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/302 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 28/330 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 108/438 variables, 17/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1071/1509 variables, 438/484 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1509 variables, 5/489 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1509 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/1509 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1509/1509 variables, and 489 constraints, problems are : Problem set: 0 solved, 5 unsolved in 36475 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 438/438 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 38036ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 38347 ms.
Support contains 8 out of 438 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 438/438 places, 1071/1071 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 438 transition count 1069
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 436 transition count 1069
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 435 transition count 1068
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 435 transition count 1068
Applied a total of 6 rules in 31 ms. Remains 435 /438 variables (removed 3) and now considering 1068/1071 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 435/438 places, 1068/1071 transitions.
Computed a total of 87 stabilizing places and 87 stable transitions
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||X(p1)))||F(p0)) U (p1 U p2)))'
Support contains 4 out of 2124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2124/2124 places, 2581/2581 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2122 transition count 2579
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2122 transition count 2579
Applied a total of 4 rules in 304 ms. Remains 2122 /2124 variables (removed 2) and now considering 2579/2581 (removed 2) transitions.
// Phase 1: matrix 2579 rows 2122 cols
[2024-06-12 18:06:43] [INFO ] Computed 227 invariants in 54 ms
[2024-06-12 18:06:45] [INFO ] Implicit Places using invariants in 2410 ms returned []
[2024-06-12 18:06:45] [INFO ] Invariant cache hit.
[2024-06-12 18:06:57] [INFO ] Implicit Places using invariants and state equation in 12049 ms returned []
Implicit Place search using SMT with State Equation took 14465 ms to find 0 implicit places.
Running 2578 sub problems to find dead transitions.
[2024-06-12 18:06:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2121 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 2578 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2121/4701 variables, and 129 constraints, problems are : Problem set: 0 solved, 2578 unsolved in 30126 ms.
Refiners :[Positive P Invariants (semi-flows): 0/55 constraints, Generalized P Invariants (flows): 129/172 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 2578/2578 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2578 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2121 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 2578 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2121/4701 variables, and 129 constraints, problems are : Problem set: 0 solved, 2578 unsolved in 30089 ms.
Refiners :[Positive P Invariants (semi-flows): 0/55 constraints, Generalized P Invariants (flows): 129/172 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 0/2578 constraints, Known Traps: 0/0 constraints]
After SMT, in 61870ms problems are : Problem set: 0 solved, 2578 unsolved
Search for dead transitions found 0 dead transitions in 61936ms
Starting structural reductions in LTL mode, iteration 1 : 2122/2124 places, 2579/2581 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76736 ms. Remains : 2122/2124 places, 2579/2581 transitions.
Stuttering acceptance computed with spot in 499 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0)]
Running random walk in product with property : ASLink-PT-05b-LTLCardinality-01
Product exploration explored 100000 steps with 33248 reset in 1043 ms.
Product exploration explored 100000 steps with 33414 reset in 653 ms.
Computed a total of 86 stabilizing places and 86 stable transitions
Computed a total of 86 stabilizing places and 86 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (AND (NOT p2) p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p2)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 131 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 40000 steps (70 resets) in 503 ms. (79 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (12 resets) in 225 ms. (177 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (9 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
[2024-06-12 18:08:02] [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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 192/196 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 401/597 variables, 48/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/597 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1468/2065 variables, 165/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2065 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 57/2122 variables, 7/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2122 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4701/4701 variables, and 2349 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3264 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 172/172 constraints, State Equation: 2122/2122 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 192/196 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 401/597 variables, 48/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/597 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1468/2065 variables, 165/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-12 18:08:07] [INFO ] Deduced a trap composed of 29 places in 1326 ms of which 16 ms to minimize.
[2024-06-12 18:08:08] [INFO ] Deduced a trap composed of 49 places in 579 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/2065 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2065 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 57/2122 variables, 7/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2122 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4701/4701 variables, and 2351 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5012 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 172/172 constraints, State Equation: 2122/2122 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 8301ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 2122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2122/2122 places, 2579/2579 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 387 transitions
Trivial Post-agglo rules discarded 387 transitions
Performed 387 trivial Post agglomeration. Transition count delta: 387
Iterating post reduction 0 with 387 rules applied. Total rules applied 387 place count 2122 transition count 2192
Reduce places removed 387 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 390 rules applied. Total rules applied 777 place count 1735 transition count 2189
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 780 place count 1733 transition count 2188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 781 place count 1732 transition count 2188
Performed 572 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 572 Pre rules applied. Total rules applied 781 place count 1732 transition count 1616
Deduced a syphon composed of 572 places in 6 ms
Ensure Unique test removed 53 places
Reduce places removed 625 places and 0 transitions.
Iterating global reduction 4 with 1197 rules applied. Total rules applied 1978 place count 1107 transition count 1616
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 4 with 37 rules applied. Total rules applied 2015 place count 1102 transition count 1584
Reduce places removed 32 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 34 rules applied. Total rules applied 2049 place count 1070 transition count 1582
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2051 place count 1068 transition count 1582
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 20 Pre rules applied. Total rules applied 2051 place count 1068 transition count 1562
Deduced a syphon composed of 20 places in 6 ms
Ensure Unique test removed 20 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 60 rules applied. Total rules applied 2111 place count 1028 transition count 1562
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 19 Pre rules applied. Total rules applied 2111 place count 1028 transition count 1543
Deduced a syphon composed of 19 places in 5 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 2149 place count 1009 transition count 1543
Performed 173 Post agglomeration using F-continuation condition.Transition count delta: 173
Deduced a syphon composed of 173 places in 4 ms
Ensure Unique test removed 3 places
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 7 with 349 rules applied. Total rules applied 2498 place count 833 transition count 1370
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2502 place count 829 transition count 1366
Ensure Unique test removed 1 places
Iterating global reduction 7 with 5 rules applied. Total rules applied 2507 place count 828 transition count 1366
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 7 with 1 rules applied. Total rules applied 2508 place count 828 transition count 1365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2509 place count 827 transition count 1365
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 2509 place count 827 transition count 1364
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2511 place count 826 transition count 1364
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2513 place count 824 transition count 1362
Iterating global reduction 9 with 2 rules applied. Total rules applied 2515 place count 824 transition count 1362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 9 with 2 rules applied. Total rules applied 2517 place count 824 transition count 1360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2518 place count 823 transition count 1360
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 2520 place count 822 transition count 1365
Free-agglomeration rule applied 6 times.
Iterating global reduction 11 with 6 rules applied. Total rules applied 2526 place count 822 transition count 1359
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 2532 place count 816 transition count 1359
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 12 with 4 rules applied. Total rules applied 2536 place count 816 transition count 1355
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 2540 place count 812 transition count 1355
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 13 with 5 rules applied. Total rules applied 2545 place count 812 transition count 1355
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 2546 place count 811 transition count 1354
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 13 with 13 rules applied. Total rules applied 2559 place count 802 transition count 1350
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 2563 place count 798 transition count 1350
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 14 Pre rules applied. Total rules applied 2563 place count 798 transition count 1336
Deduced a syphon composed of 14 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 15 with 29 rules applied. Total rules applied 2592 place count 783 transition count 1336
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 15 with 5 rules applied. Total rules applied 2597 place count 778 transition count 1336
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 2597 place count 778 transition count 1335
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 2599 place count 777 transition count 1335
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 16 with 20 rules applied. Total rules applied 2619 place count 767 transition count 1325
Discarding 4 places :
Symmetric choice reduction at 16 with 4 rule applications. Total rules 2623 place count 763 transition count 1321
Iterating global reduction 16 with 4 rules applied. Total rules applied 2627 place count 763 transition count 1321
Free-agglomeration rule applied 4 times.
Iterating global reduction 16 with 4 rules applied. Total rules applied 2631 place count 763 transition count 1317
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 2635 place count 759 transition count 1317
Applied a total of 2635 rules in 874 ms. Remains 759 /2122 variables (removed 1363) and now considering 1317/2579 (removed 1262) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 876 ms. Remains : 759/2122 places, 1317/2579 transitions.
RANDOM walk for 40000 steps (463 resets) in 608 ms. (65 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (80 resets) in 130 ms. (305 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (88 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
// Phase 1: matrix 1317 rows 759 cols
[2024-06-12 18:08:11] [INFO ] Computed 130 invariants in 20 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/33 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/34 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 88/122 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 29/151 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/153 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 100/253 variables, 19/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/253 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 29/282 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/282 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/284 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/284 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 102/386 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/386 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 28/414 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/414 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 10/424 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/424 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 105/529 variables, 16/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/529 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 25/554 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/554 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/556 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/556 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 90/646 variables, 14/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/646 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 43/689 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/689 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 5/694 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/694 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 63/757 variables, 14/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/757 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 1316/2073 variables, 757/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-12 18:08:14] [INFO ] Deduced a trap composed of 145 places in 782 ms of which 9 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/2073 variables, 1/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2073 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 3/2076 variables, 2/889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2076 variables, 1/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2076 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 0/2076 variables, 0/890 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2076/2076 variables, and 890 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2583 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 91/91 constraints, State Equation: 759/759 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/33 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/34 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 88/122 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 29/151 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/153 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 100/253 variables, 19/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/253 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 29/282 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/282 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/284 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/284 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 102/386 variables, 17/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/386 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 28/414 variables, 4/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/414 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 10/424 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/424 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 105/529 variables, 16/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/529 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 25/554 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/554 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/556 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/556 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 90/646 variables, 14/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/646 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 43/689 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/689 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 5/694 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/694 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 63/757 variables, 14/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/757 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/757 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 1316/2073 variables, 757/887 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2073 variables, 1/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-12 18:08:16] [INFO ] Deduced a trap composed of 76 places in 513 ms of which 7 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/2073 variables, 1/889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2073 variables, 0/889 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 3/2076 variables, 2/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2076 variables, 1/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2076 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 0/2076 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2076/2076 variables, and 892 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2280 ms.
Refiners :[Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 91/91 constraints, State Equation: 759/759 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 4896ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 238 ms.
Support contains 1 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 1317/1317 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 0 with 1 rules applied. Total rules applied 1 place count 759 transition count 1316
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 758 transition count 1316
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 758 transition count 1315
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 756 transition count 1315
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 756 transition count 1314
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 755 transition count 1314
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 754 transition count 1314
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 751 transition count 1311
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 15 place count 750 transition count 1310
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 750 transition count 1310
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 750 transition count 1309
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 749 transition count 1309
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 19 place count 748 transition count 1308
Applied a total of 19 rules in 213 ms. Remains 748 /759 variables (removed 11) and now considering 1308/1317 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 748/759 places, 1308/1317 transitions.
RANDOM walk for 40000 steps (510 resets) in 361 ms. (110 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (89 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 302553 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :0 out of 1
Probabilistic random walk after 302553 steps, saw 62553 distinct states, run finished after 3006 ms. (steps per millisecond=100 ) properties seen :0
// Phase 1: matrix 1308 rows 748 cols
[2024-06-12 18:08:20] [INFO ] Computed 128 invariants in 24 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/33 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/34 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 88/122 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/147 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/149 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/149 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 101/250 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 26/276 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/276 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/278 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/278 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 95/373 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/373 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 26/399 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/399 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/401 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/401 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 95/496 variables, 15/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/496 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 26/522 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/522 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/524 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/524 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 109/633 variables, 15/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/633 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 41/674 variables, 8/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/674 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 1/675 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/675 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 71/746 variables, 16/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/746 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 1/747 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/747 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 1/748 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/748 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 1308/2056 variables, 748/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2056 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 0/2056 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2056/2056 variables, and 876 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1614 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 91/91 constraints, State Equation: 748/748 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/33 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/34 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 88/122 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/147 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/149 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/149 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 101/250 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 26/276 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/276 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/278 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/278 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 95/373 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/373 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 26/399 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/399 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/401 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/401 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 95/496 variables, 15/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/496 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 26/522 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/522 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/524 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/524 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 109/633 variables, 15/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/633 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 41/674 variables, 8/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/674 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 1/675 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/675 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 71/746 variables, 16/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/746 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 1/747 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/747 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 1/748 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/748 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 1308/2056 variables, 748/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2056 variables, 1/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2056 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 0/2056 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2056/2056 variables, and 877 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1572 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 91/91 constraints, State Equation: 748/748 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3222ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 250 ms.
Support contains 1 out of 748 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 748/748 places, 1308/1308 transitions.
Applied a total of 0 rules in 43 ms. Remains 748 /748 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 748/748 places, 1308/1308 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 748/748 places, 1308/1308 transitions.
Applied a total of 0 rules in 39 ms. Remains 748 /748 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
[2024-06-12 18:08:24] [INFO ] Invariant cache hit.
[2024-06-12 18:08:25] [INFO ] Implicit Places using invariants in 1551 ms returned [1, 18, 19, 31, 48, 66, 104, 138, 142, 151, 152, 154, 171, 189, 258, 262, 263, 274, 275, 277, 294, 312, 381, 385, 386, 397, 398, 400, 417, 435, 504, 508, 509, 520, 521, 523, 540, 558, 627, 631, 632, 635, 646, 647, 648, 666, 687, 688, 689, 690]
[2024-06-12 18:08:25] [INFO ] Actually due to overlaps returned [666, 648, 48, 171, 294, 417, 540, 31, 154, 277, 400, 523, 151, 274, 397, 520, 646, 687, 152, 275, 398, 521, 647, 688, 1, 18, 262, 263, 385, 386, 508, 509, 631, 632, 66, 189, 312, 435, 558, 689, 19, 104, 635, 690]
Discarding 44 places :
Implicit Place search using SMT only with invariants took 1560 ms to find 44 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 704/748 places, 1308/1308 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 699 transition count 1216
Reduce places removed 92 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 98 rules applied. Total rules applied 195 place count 607 transition count 1210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 196 place count 606 transition count 1210
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 196 place count 606 transition count 1183
Deduced a syphon composed of 27 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 251 place count 578 transition count 1183
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 263 place count 574 transition count 1175
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 271 place count 566 transition count 1175
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 274 place count 563 transition count 1172
Iterating global reduction 5 with 3 rules applied. Total rules applied 277 place count 563 transition count 1172
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 280 place count 563 transition count 1169
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 3 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 352 place count 527 transition count 1133
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 357 place count 522 transition count 1128
Iterating global reduction 6 with 5 rules applied. Total rules applied 362 place count 522 transition count 1128
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 367 place count 522 transition count 1123
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 371 place count 520 transition count 1124
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 7 with 10 rules applied. Total rules applied 381 place count 520 transition count 1114
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 392 place count 509 transition count 1114
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 407 place count 509 transition count 1114
Applied a total of 407 rules in 220 ms. Remains 509 /704 variables (removed 195) and now considering 1114/1308 (removed 194) transitions.
// Phase 1: matrix 1114 rows 509 cols
[2024-06-12 18:08:25] [INFO ] Computed 73 invariants in 20 ms
[2024-06-12 18:08:26] [INFO ] Implicit Places using invariants in 1164 ms returned [73, 91, 97, 100, 102, 103, 106, 107, 160, 176, 182, 185, 187, 192, 193, 246, 262, 268, 271, 273, 278, 279, 332, 348, 354, 357, 359, 364, 365, 418, 434, 440, 443, 445]
[2024-06-12 18:08:26] [INFO ] Actually due to overlaps returned [106, 192, 278, 364, 107, 193, 279, 365, 91, 97, 102, 176, 182, 187, 262, 268, 273, 348, 354, 359, 434, 440, 445, 73, 103, 160, 246, 332, 418]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 1172 ms to find 29 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 480/748 places, 1114/1308 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 460 transition count 1094
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 460 transition count 1094
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 455 transition count 1089
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 455 transition count 1089
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 70 place count 445 transition count 1079
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 85 place count 445 transition count 1064
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 100 place count 430 transition count 1064
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 105 place count 430 transition count 1059
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 110 place count 425 transition count 1059
Applied a total of 110 rules in 135 ms. Remains 425 /480 variables (removed 55) and now considering 1059/1114 (removed 55) transitions.
// Phase 1: matrix 1059 rows 425 cols
[2024-06-12 18:08:27] [INFO ] Computed 44 invariants in 14 ms
[2024-06-12 18:08:28] [INFO ] Implicit Places using invariants in 912 ms returned []
[2024-06-12 18:08:28] [INFO ] Invariant cache hit.
[2024-06-12 18:08:29] [INFO ] Implicit Places using invariants and state equation in 1895 ms returned []
Implicit Place search using SMT with State Equation took 2817 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 425/748 places, 1059/1308 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5945 ms. Remains : 425/748 places, 1059/1308 transitions.
RANDOM walk for 40000 steps (770 resets) in 319 ms. (125 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (172 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 410098 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :0 out of 1
Probabilistic random walk after 410098 steps, saw 97246 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
[2024-06-12 18:08:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 96/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/103 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/238 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/242 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 91/333 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/350 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/350 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 51/401 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/401 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/423 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/425 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-12 18:08:33] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/425 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/425 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1059/1484 variables, 425/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1484 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1484 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1484/1484 variables, and 470 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1094 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 425/425 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 96/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/103 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/238 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/242 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 91/333 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/350 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/350 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 51/401 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/401 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/423 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/425 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/425 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-12 18:08:34] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/425 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/425 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1059/1484 variables, 425/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1484 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1484 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1484 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1484/1484 variables, and 472 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1184 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 425/425 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 2288ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 330 ms.
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1059/1059 transitions.
Applied a total of 0 rules in 24 ms. Remains 425 /425 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 425/425 places, 1059/1059 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1059/1059 transitions.
Applied a total of 0 rules in 23 ms. Remains 425 /425 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
[2024-06-12 18:08:35] [INFO ] Invariant cache hit.
[2024-06-12 18:08:36] [INFO ] Implicit Places using invariants in 825 ms returned []
[2024-06-12 18:08:36] [INFO ] Invariant cache hit.
[2024-06-12 18:08:38] [INFO ] Implicit Places using invariants and state equation in 2025 ms returned []
Implicit Place search using SMT with State Equation took 2853 ms to find 0 implicit places.
[2024-06-12 18:08:38] [INFO ] Redundant transitions in 172 ms returned []
Running 1030 sub problems to find dead transitions.
[2024-06-12 18:08:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/424 variables, 32/40 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 424/1484 variables, and 40 constraints, problems are : Problem set: 0 solved, 1030 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 8/11 constraints, Generalized P Invariants (flows): 32/33 constraints, State Equation: 0/425 constraints, PredecessorRefiner: 1030/1030 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1030 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/424 variables, 32/40 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
At refinement iteration 3 (OVERLAPS) 1/425 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 1)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 1)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 1)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 1)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/1484 variables, and 44 constraints, problems are : Problem set: 0 solved, 1030 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 0/425 constraints, PredecessorRefiner: 0/1030 constraints, Known Traps: 0/0 constraints]
After SMT, in 60943ms problems are : Problem set: 0 solved, 1030 unsolved
Search for dead transitions found 0 dead transitions in 60963ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64028 ms. Remains : 425/425 places, 1059/1059 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 24 ms. Remains 425 /425 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-12 18:09:39] [INFO ] Invariant cache hit.
[2024-06-12 18:09:39] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-06-12 18:09:39] [INFO ] [Real]Absence check using 11 positive and 33 generalized place invariants in 32 ms returned sat
[2024-06-12 18:09:40] [INFO ] After 972ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-12 18:09:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-06-12 18:09:40] [INFO ] [Nat]Absence check using 11 positive and 33 generalized place invariants in 34 ms returned sat
[2024-06-12 18:09:41] [INFO ] After 727ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-12 18:09:41] [INFO ] After 822ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-12 18:09:41] [INFO ] After 1069ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 2102 ms.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (AND (NOT p2) p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p2)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1 p2))), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F p2), (F (NOT (AND (NOT p0) p1 (NOT p2))))]
Knowledge based reduction with 15 factoid took 454 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 214 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0)]
// Phase 1: matrix 2579 rows 2122 cols
[2024-06-12 18:09:42] [INFO ] Computed 227 invariants in 48 ms
[2024-06-12 18:09:46] [INFO ] [Real]Absence check using 55 positive place invariants in 110 ms returned sat
[2024-06-12 18:09:47] [INFO ] [Real]Absence check using 55 positive and 172 generalized place invariants in 1078 ms returned sat
[2024-06-12 18:09:57] [INFO ] [Real]Absence check using state equation in 10438 ms returned unknown
Could not prove EG (NOT p2)
Support contains 4 out of 2122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2122/2122 places, 2579/2579 transitions.
Applied a total of 0 rules in 131 ms. Remains 2122 /2122 variables (removed 0) and now considering 2579/2579 (removed 0) transitions.
[2024-06-12 18:09:57] [INFO ] Invariant cache hit.
[2024-06-12 18:09:59] [INFO ] Implicit Places using invariants in 1911 ms returned []
[2024-06-12 18:09:59] [INFO ] Invariant cache hit.
[2024-06-12 18:10:10] [INFO ] Implicit Places using invariants and state equation in 10606 ms returned []
Implicit Place search using SMT with State Equation took 12519 ms to find 0 implicit places.
Running 2578 sub problems to find dead transitions.
[2024-06-12 18:10:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2121 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 2578 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2121/4701 variables, and 129 constraints, problems are : Problem set: 0 solved, 2578 unsolved in 30086 ms.
Refiners :[Positive P Invariants (semi-flows): 0/55 constraints, Generalized P Invariants (flows): 129/172 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 2578/2578 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2578 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2121 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 2578 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 13)
(s11 1)
(s12 1)
(s13 1)
(s14 0)
(s15 0)
(s16 1)
(s17 1)
(s18 0)
(s19 0)
(s20 1)
(s21 1)
(s22 0)
(s23 0)
(s24 1)
(s25 1)
(s26 0)
(s27 0)
(s28 1)
(s29 1)
(s30 0)
(s31 0)
(s32 1)
(s33 1)
(s34 0)
(s35 0)
(s36 1)
(s37 1)
(s38 0)
(s39 0)
(s40 1)
(s41 1)
(s42 0)
(s43 0)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 3)
(s49 6)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 22)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 0)
(s94 1)
(s95 1)
(s96 0)
(s97 0)
(s98 1)
(s99 1)
(s100 5)
(s101 1)
(s102 1)
(s103 1)
(s104 0)
(s105 0)
(s106 1)
(s107 1)
(s108 0)
(s109 0)
(s110 1)
(s111 1)
(s112 0)
(s113 0)
(s114 1)
(s115 1)
(s116 0)
(s117 0)
(s118 1)
(s119 1)
(s120 0)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 1)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 5)
(s145 0)
(s146 0)
(s147 1)
(s148 1)
(s149 0)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 0)
(s155 1)
(s156 0)
(s157 1)
(s158 1)
(s159 0)
(s160 1)
(s161 1)
(s162 0)
(s163 1)
(s164 1)
(s165 0)
(s166 1)
(s167 1)
(s168 0)
(s169 1)
(s170 1)
(s171 0)
(s172 0)
(s173 2)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 5)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 0)
(s251 0)
(s252 1)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 0)
(s260 1)
(s261 0)
(s262 1)
(s263 1)
(s264 0)
(s265 1)
(s266 1)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 1)
(s272 1)
(s273 0)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 0)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 0)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 0)
(s293 0)
(s294 1)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 0)
(s306 0)
(s307 1)
(s308 1)
(s309 0)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 0)
(s319 1)
(s320 1)
(s321 1)
(s322 0)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 0)
(s330 1)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 0)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 0)
(s353 1)
(s354 1)
(s355 1)
(s356 0)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 0)
(s363 0)
(s364 4)
(s365 1)
(s366 1)
(s367 0)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 11)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 17)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 17)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 14)
(s403 1)
(s404 0)
(s405 0)
(s406 1)
(s407 1)
(s408 0)
(s409 4)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 81)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 0)
(s487 0)
(s488 1)
(s489 0)
(s490 0)
(s491 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2121/4701 variables, and 129 constraints, problems are : Problem set: 0 solved, 2578 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/55 constraints, Generalized P Invariants (flows): 129/172 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 0/2578 constraints, Known Traps: 0/0 constraints]
After SMT, in 61798ms problems are : Problem set: 0 solved, 2578 unsolved
Search for dead transitions found 0 dead transitions in 61830ms
Finished structural reductions in LTL mode , in 1 iterations and 74492 ms. Remains : 2122/2122 places, 2579/2579 transitions.
Computed a total of 86 stabilizing places and 86 stable transitions
Computed a total of 86 stabilizing places and 86 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT p2)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 284 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 40000 steps (69 resets) in 283 ms. (140 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (11 resets) in 125 ms. (317 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (9 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
[2024-06-12 18:11:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 556/597 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-12 18:11:13] [INFO ] Deduced a trap composed of 111 places in 94 ms of which 3 ms to minimize.
[2024-06-12 18:11:13] [INFO ] Deduced a trap composed of 112 places in 81 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/597 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/597 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1468/2065 variables, 165/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-12 18:11:15] [INFO ] Deduced a trap composed of 48 places in 1548 ms of which 16 ms to minimize.
[2024-06-12 18:11:16] [INFO ] Deduced a trap composed of 22 places in 1289 ms of which 16 ms to minimize.
[2024-06-12 18:11:18] [INFO ] Deduced a trap composed of 154 places in 1292 ms of which 15 ms to minimize.
SMT process timed out in 5042ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 2122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2122/2122 places, 2579/2579 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 388 transitions
Trivial Post-agglo rules discarded 388 transitions
Performed 388 trivial Post agglomeration. Transition count delta: 388
Iterating post reduction 0 with 388 rules applied. Total rules applied 388 place count 2122 transition count 2191
Reduce places removed 388 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 391 rules applied. Total rules applied 779 place count 1734 transition count 2188
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 782 place count 1732 transition count 2187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 783 place count 1731 transition count 2187
Performed 574 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 574 Pre rules applied. Total rules applied 783 place count 1731 transition count 1613
Deduced a syphon composed of 574 places in 4 ms
Ensure Unique test removed 53 places
Reduce places removed 627 places and 0 transitions.
Iterating global reduction 4 with 1201 rules applied. Total rules applied 1984 place count 1104 transition count 1613
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 4 with 39 rules applied. Total rules applied 2023 place count 1099 transition count 1579
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 5 with 34 rules applied. Total rules applied 2057 place count 1065 transition count 1579
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 20 Pre rules applied. Total rules applied 2057 place count 1065 transition count 1559
Deduced a syphon composed of 20 places in 3 ms
Ensure Unique test removed 20 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 2117 place count 1025 transition count 1559
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 19 Pre rules applied. Total rules applied 2117 place count 1025 transition count 1540
Deduced a syphon composed of 19 places in 4 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 2155 place count 1006 transition count 1540
Performed 174 Post agglomeration using F-continuation condition.Transition count delta: 174
Deduced a syphon composed of 174 places in 3 ms
Ensure Unique test removed 3 places
Reduce places removed 177 places and 0 transitions.
Iterating global reduction 6 with 351 rules applied. Total rules applied 2506 place count 829 transition count 1366
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2510 place count 825 transition count 1362
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2515 place count 824 transition count 1362
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 6 with 1 rules applied. Total rules applied 2516 place count 824 transition count 1361
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2517 place count 823 transition count 1361
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2517 place count 823 transition count 1360
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2519 place count 822 transition count 1360
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2521 place count 820 transition count 1358
Iterating global reduction 8 with 2 rules applied. Total rules applied 2523 place count 820 transition count 1358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 8 with 2 rules applied. Total rules applied 2525 place count 820 transition count 1356
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2526 place count 819 transition count 1356
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2528 place count 818 transition count 1361
Free-agglomeration rule applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 2534 place count 818 transition count 1355
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 2540 place count 812 transition count 1355
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 2544 place count 812 transition count 1351
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 2548 place count 808 transition count 1351
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 2553 place count 808 transition count 1351
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2554 place count 807 transition count 1350
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 12 with 15 rules applied. Total rules applied 2569 place count 797 transition count 1345
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 2574 place count 792 transition count 1345
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 15 Pre rules applied. Total rules applied 2574 place count 792 transition count 1330
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 14 with 31 rules applied. Total rules applied 2605 place count 776 transition count 1330
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 14 with 6 rules applied. Total rules applied 2611 place count 770 transition count 1330
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2611 place count 770 transition count 1329
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2613 place count 769 transition count 1329
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 15 with 22 rules applied. Total rules applied 2635 place count 758 transition count 1318
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 2640 place count 753 transition count 1313
Iterating global reduction 15 with 5 rules applied. Total rules applied 2645 place count 753 transition count 1313
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 2650 place count 753 transition count 1308
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 2655 place count 748 transition count 1308
Applied a total of 2655 rules in 668 ms. Remains 748 /2122 variables (removed 1374) and now considering 1308/2579 (removed 1271) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 668 ms. Remains : 748/2122 places, 1308/2579 transitions.
RANDOM walk for 40000 steps (463 resets) in 215 ms. (185 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (86 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 287111 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 1
Probabilistic random walk after 287111 steps, saw 59872 distinct states, run finished after 3002 ms. (steps per millisecond=95 ) properties seen :0
// Phase 1: matrix 1308 rows 748 cols
[2024-06-12 18:11:21] [INFO ] Computed 128 invariants in 19 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/33 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/34 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 88/122 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/147 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/149 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/149 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 101/250 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 26/276 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/276 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/278 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/278 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 95/373 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/373 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 26/399 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/399 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/401 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/401 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 95/496 variables, 15/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/496 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 26/522 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/522 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/524 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/524 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 109/633 variables, 15/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/633 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 41/674 variables, 8/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/674 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 1/675 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/675 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 71/746 variables, 16/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/746 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 1/747 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/747 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 1/748 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/748 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 1308/2056 variables, 748/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2056 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 45 (OVERLAPS) 0/2056 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2056/2056 variables, and 876 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1048 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 91/91 constraints, State Equation: 748/748 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/33 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/34 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 88/122 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/147 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/149 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/149 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 101/250 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/250 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 26/276 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/276 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/278 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/278 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 95/373 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/373 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 26/399 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/399 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/401 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/401 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 95/496 variables, 15/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/496 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 26/522 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/522 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/524 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/524 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 109/633 variables, 15/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/633 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 41/674 variables, 8/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/674 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 1/675 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/675 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 71/746 variables, 16/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/746 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 1/747 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/747 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 1/748 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/748 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 1308/2056 variables, 748/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2056 variables, 1/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2056 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 0/2056 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2056/2056 variables, and 877 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1228 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 91/91 constraints, State Equation: 748/748 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2324ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 141 ms.
Support contains 1 out of 748 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 748/748 places, 1308/1308 transitions.
Applied a total of 0 rules in 25 ms. Remains 748 /748 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 748/748 places, 1308/1308 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 748/748 places, 1308/1308 transitions.
Applied a total of 0 rules in 23 ms. Remains 748 /748 variables (removed 0) and now considering 1308/1308 (removed 0) transitions.
[2024-06-12 18:11:24] [INFO ] Invariant cache hit.
[2024-06-12 18:11:25] [INFO ] Implicit Places using invariants in 1243 ms returned [1, 18, 19, 31, 48, 66, 104, 138, 142, 151, 152, 154, 171, 189, 258, 262, 263, 274, 275, 277, 294, 312, 381, 385, 386, 397, 398, 400, 417, 435, 504, 508, 509, 520, 521, 523, 540, 558, 627, 631, 632, 635, 646, 647, 648, 666, 687, 688, 689, 690]
[2024-06-12 18:11:25] [INFO ] Actually due to overlaps returned [666, 648, 48, 171, 294, 417, 540, 31, 154, 277, 400, 523, 151, 274, 397, 520, 646, 687, 152, 275, 398, 521, 647, 688, 1, 18, 262, 263, 385, 386, 508, 509, 631, 632, 66, 189, 312, 435, 558, 689, 19, 104, 635, 690]
Discarding 44 places :
Implicit Place search using SMT only with invariants took 1249 ms to find 44 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 704/748 places, 1308/1308 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 699 transition count 1216
Reduce places removed 92 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 98 rules applied. Total rules applied 195 place count 607 transition count 1210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 196 place count 606 transition count 1210
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 196 place count 606 transition count 1183
Deduced a syphon composed of 27 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 251 place count 578 transition count 1183
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 263 place count 574 transition count 1175
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 271 place count 566 transition count 1175
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 274 place count 563 transition count 1172
Iterating global reduction 5 with 3 rules applied. Total rules applied 277 place count 563 transition count 1172
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 280 place count 563 transition count 1169
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 352 place count 527 transition count 1133
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 357 place count 522 transition count 1128
Iterating global reduction 6 with 5 rules applied. Total rules applied 362 place count 522 transition count 1128
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 367 place count 522 transition count 1123
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 371 place count 520 transition count 1124
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 7 with 10 rules applied. Total rules applied 381 place count 520 transition count 1114
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 392 place count 509 transition count 1114
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 407 place count 509 transition count 1114
Applied a total of 407 rules in 124 ms. Remains 509 /704 variables (removed 195) and now considering 1114/1308 (removed 194) transitions.
// Phase 1: matrix 1114 rows 509 cols
[2024-06-12 18:11:25] [INFO ] Computed 73 invariants in 10 ms
[2024-06-12 18:11:26] [INFO ] Implicit Places using invariants in 858 ms returned [73, 91, 97, 100, 102, 103, 106, 107, 160, 176, 182, 185, 187, 192, 193, 246, 262, 268, 271, 273, 278, 279, 332, 348, 354, 357, 359, 364, 365, 418, 434, 440, 443, 445]
[2024-06-12 18:11:26] [INFO ] Actually due to overlaps returned [106, 192, 278, 364, 107, 193, 279, 365, 91, 97, 102, 176, 182, 187, 262, 268, 273, 348, 354, 359, 434, 440, 445, 73, 103, 160, 246, 332, 418]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 863 ms to find 29 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 480/748 places, 1114/1308 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 460 transition count 1094
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 460 transition count 1094
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 455 transition count 1089
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 455 transition count 1089
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 70 place count 445 transition count 1079
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 85 place count 445 transition count 1064
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 100 place count 430 transition count 1064
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 105 place count 430 transition count 1059
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 110 place count 425 transition count 1059
Applied a total of 110 rules in 80 ms. Remains 425 /480 variables (removed 55) and now considering 1059/1114 (removed 55) transitions.
// Phase 1: matrix 1059 rows 425 cols
[2024-06-12 18:11:26] [INFO ] Computed 44 invariants in 9 ms
[2024-06-12 18:11:27] [INFO ] Implicit Places using invariants in 538 ms returned []
[2024-06-12 18:11:27] [INFO ] Invariant cache hit.
[2024-06-12 18:11:28] [INFO ] Implicit Places using invariants and state equation in 1273 ms returned []
Implicit Place search using SMT with State Equation took 1814 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 425/748 places, 1059/1308 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4166 ms. Remains : 425/748 places, 1059/1308 transitions.
RANDOM walk for 40000 steps (781 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (170 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 400494 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :0 out of 1
Probabilistic random walk after 400494 steps, saw 94858 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
[2024-06-12 18:11:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 96/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/103 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/238 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/242 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 91/333 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/350 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/350 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 51/401 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/401 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/423 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/425 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-12 18:11:31] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/425 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/425 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1059/1484 variables, 425/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1484 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1484 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1484/1484 variables, and 470 constraints, problems are : Problem set: 0 solved, 1 unsolved in 710 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 425/425 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 96/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/103 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/238 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/242 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 91/333 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/350 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/350 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 51/401 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/401 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/423 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/425 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/425 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-12 18:11:32] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/425 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/425 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1059/1484 variables, 425/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1484 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1484 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1484 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1484/1484 variables, and 472 constraints, problems are : Problem set: 0 solved, 1 unsolved in 741 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 425/425 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1458ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 115 ms.
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1059/1059 transitions.
Applied a total of 0 rules in 13 ms. Remains 425 /425 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 425/425 places, 1059/1059 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1059/1059 transitions.
Applied a total of 0 rules in 13 ms. Remains 425 /425 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
[2024-06-12 18:11:33] [INFO ] Invariant cache hit.
[2024-06-12 18:11:33] [INFO ] Implicit Places using invariants in 550 ms returned []
[2024-06-12 18:11:33] [INFO ] Invariant cache hit.
[2024-06-12 18:11:35] [INFO ] Implicit Places using invariants and state equation in 1297 ms returned []
Implicit Place search using SMT with State Equation took 1849 ms to find 0 implicit places.
[2024-06-12 18:11:35] [INFO ] Redundant transitions in 13 ms returned []
Running 1030 sub problems to find dead transitions.
[2024-06-12 18:11:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/424 variables, 32/40 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
At refinement iteration 3 (OVERLAPS) 1/425 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
SMT process timed out in 30626ms, After SMT, problems are : Problem set: 0 solved, 1030 unsolved
Search for dead transitions found 0 dead transitions in 30638ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32522 ms. Remains : 425/425 places, 1059/1059 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 15 ms. Remains 425 /425 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-12 18:12:05] [INFO ] Invariant cache hit.
[2024-06-12 18:12:05] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-12 18:12:05] [INFO ] [Real]Absence check using 11 positive and 33 generalized place invariants in 20 ms returned sat
[2024-06-12 18:12:06] [INFO ] After 428ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-12 18:12:06] [INFO ] After 489ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-06-12 18:12:06] [INFO ] After 658ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 683 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT p2)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1 p2))), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F p2), (F (NOT (AND (NOT p0) p1 (NOT p2))))]
Knowledge based reduction with 15 factoid took 307 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0)]
// Phase 1: matrix 2579 rows 2122 cols
[2024-06-12 18:12:07] [INFO ] Computed 227 invariants in 31 ms
[2024-06-12 18:12:09] [INFO ] [Real]Absence check using 55 positive place invariants in 69 ms returned sat
[2024-06-12 18:12:10] [INFO ] [Real]Absence check using 55 positive and 172 generalized place invariants in 917 ms returned sat
[2024-06-12 18:12:22] [INFO ] [Real]Absence check using state equation in 11675 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 172 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 33356 reset in 556 ms.
Product exploration explored 100000 steps with 33452 reset in 529 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 148 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 2122 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2122/2122 places, 2579/2579 transitions.
Performed 378 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 378 rules applied. Total rules applied 378 place count 2122 transition count 2579
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 379 place count 2122 transition count 2578
Performed 386 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 386 Pre rules applied. Total rules applied 379 place count 2122 transition count 2674
Deduced a syphon composed of 764 places in 6 ms
Iterating global reduction 2 with 386 rules applied. Total rules applied 765 place count 2122 transition count 2674
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 2 with 2 rules applied. Total rules applied 767 place count 2121 transition count 2674
Discarding 208 places :
Symmetric choice reduction at 3 with 208 rule applications. Total rules 975 place count 1913 transition count 2466
Deduced a syphon composed of 557 places in 6 ms
Iterating global reduction 3 with 208 rules applied. Total rules applied 1183 place count 1913 transition count 2466
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 1183 place count 1913 transition count 2470
Deduced a syphon composed of 561 places in 6 ms
Iterating global reduction 3 with 4 rules applied. Total rules applied 1187 place count 1913 transition count 2470
Performed 365 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 926 places in 4 ms
Iterating global reduction 3 with 365 rules applied. Total rules applied 1552 place count 1913 transition count 2471
Discarding 146 places :
Symmetric choice reduction at 3 with 146 rule applications. Total rules 1698 place count 1767 transition count 2323
Deduced a syphon composed of 784 places in 4 ms
Iterating global reduction 3 with 146 rules applied. Total rules applied 1844 place count 1767 transition count 2323
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1846 place count 1765 transition count 2320
Deduced a syphon composed of 784 places in 4 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 1848 place count 1765 transition count 2320
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1850 place count 1765 transition count 2318
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 815 places in 4 ms
Iterating global reduction 4 with 31 rules applied. Total rules applied 1881 place count 1765 transition count 2425
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1890 place count 1756 transition count 2405
Deduced a syphon composed of 806 places in 3 ms
Iterating global reduction 4 with 9 rules applied. Total rules applied 1899 place count 1756 transition count 2405
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 807 places in 4 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 1900 place count 1756 transition count 2407
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1901 place count 1755 transition count 2405
Deduced a syphon composed of 806 places in 4 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 1902 place count 1755 transition count 2405
Deduced a syphon composed of 806 places in 3 ms
Applied a total of 1902 rules in 1707 ms. Remains 1755 /2122 variables (removed 367) and now considering 2405/2579 (removed 174) transitions.
[2024-06-12 18:12:25] [INFO ] Redundant transitions in 311 ms returned []
Running 2404 sub problems to find dead transitions.
// Phase 1: matrix 2405 rows 1755 cols
[2024-06-12 18:12:25] [INFO ] Computed 226 invariants in 49 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1754 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2404 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1754/4160 variables, and 157 constraints, problems are : Problem set: 0 solved, 2404 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 0/52 constraints, Generalized P Invariants (flows): 157/174 constraints, State Equation: 0/1755 constraints, PredecessorRefiner: 2404/2404 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2404 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1754 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 2404 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1754/4160 variables, and 157 constraints, problems are : Problem set: 0 solved, 2404 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/52 constraints, Generalized P Invariants (flows): 157/174 constraints, State Equation: 0/1755 constraints, PredecessorRefiner: 0/2404 constraints, Known Traps: 0/0 constraints]
After SMT, in 61710ms problems are : Problem set: 0 solved, 2404 unsolved
Search for dead transitions found 0 dead transitions in 61738ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1755/2122 places, 2405/2579 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63769 ms. Remains : 1755/2122 places, 2405/2579 transitions.
Support contains 4 out of 2122 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2122/2122 places, 2579/2579 transitions.
Applied a total of 0 rules in 160 ms. Remains 2122 /2122 variables (removed 0) and now considering 2579/2579 (removed 0) transitions.
// Phase 1: matrix 2579 rows 2122 cols
[2024-06-12 18:13:27] [INFO ] Computed 227 invariants in 59 ms
[2024-06-12 18:13:29] [INFO ] Implicit Places using invariants in 1839 ms returned []
[2024-06-12 18:13:29] [INFO ] Invariant cache hit.
[2024-06-12 18:13:38] [INFO ] Implicit Places using invariants and state equation in 8584 ms returned []
Implicit Place search using SMT with State Equation took 10439 ms to find 0 implicit places.
Running 2578 sub problems to find dead transitions.
[2024-06-12 18:13:38] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2121 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 2578 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2121/4701 variables, and 129 constraints, problems are : Problem set: 0 solved, 2578 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/55 constraints, Generalized P Invariants (flows): 129/172 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 2578/2578 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2578 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2121 variables, 129/129 constraints. Problems are: Problem set: 0 solved, 2578 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 13)
(s11 1)
(s12 1)
(s13 1)
(s14 0)
(s15 0)
(s16 1)
(s17 1)
(s18 0)
(s19 0)
(s20 1)
(s21 1)
(s22 0)
(s23 0)
(s24 1)
(s25 1)
(s26 0)
(s27 0)
(s28 1)
(s29 1)
(s30 0)
(s31 0)
(s32 1)
(s33 1)
(s34 0)
(s35 0)
(s36 1)
(s37 1)
(s38 0)
(s39 0)
(s40 1)
(s41 1)
(s42 0)
(s43 0)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 3)
(s49 6)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 22)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 0)
(s94 1)
(s95 1)
(s96 0)
(s97 0)
(s98 1)
(s99 1)
(s100 5)
(s101 1)
(s102 1)
(s103 1)
(s104 0)
(s105 0)
(s106 1)
(s107 1)
(s108 0)
(s109 0)
(s110 1)
(s111 1)
(s112 0)
(s113 0)
(s114 1)
(s115 1)
(s116 0)
(s117 0)
(s118 1)
(s119 1)
(s120 0)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 1)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 5)
(s145 0)
(s146 0)
(s147 1)
(s148 1)
(s149 0)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 0)
(s155 1)
(s156 0)
(s157 1)
(s158 1)
(s159 0)
(s160 1)
(s161 1)
(s162 0)
(s163 1)
(s164 1)
(s165 0)
(s166 1)
(s167 1)
(s168 0)
(s169 1)
(s170 1)
(s171 0)
(s172 0)
(s173 2)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 5)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 0)
(s251 0)
(s252 1)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 1)
(s258 0)
(s259 0)
(s260 1)
(s261 0)
(s262 1)
(s263 1)
(s264 0)
(s265 1)
(s266 1)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 1)
(s272 1)
(s273 0)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 0)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 0)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 0)
(s293 0)
(s294 1)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 0)
(s306 0)
(s307 1)
(s308 1)
(s309 0)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 0)
(s319 1)
(s320 1)
(s321 1)
(s322 0)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 0)
(s330 1)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 0)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 0)
(s353 1)
(s354 1)
(s355 1)
(s356 0)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 0)
(s363 0)
(s364 4)
(s365 1)
(s366 1)
(s367 0)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 11)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 17)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 17)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 14)
(s403 1)
(s404 0)
(s405 0)
(s406 1)
(s407 1)
(s408 0)
(s409 4)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 81)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 0)
(s487 0)
(s488 1)
(s489 0)
(s490 0)
(s491 1)
(s492 1)
(s493 0)
(s494 1)
(s495 1)
(s496 0)
(s497 1)
(s498 0)
(s499 0)
(s500 1)
(s501 1)
(s502 0)
(s503 1)
(s504 1)
(s505 0)
(s506 1)
(s507 1)
(s508 0)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 0)
(s610 0)
(s611 1)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 4)
(s621 1)
(s622 1)
(s623 0)
(s624 1)
(s625 1)
(s626 0)
(s627 1)
(s628 0)
(s629 0)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 9)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 0)
(s643 0)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 10)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 0)
(s679 1)
(s680 1)
(s681 1)
(s682 0)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 0)
(s688 0)
(s689 1)
(s690 1)
(s691 0)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 0)
(s698 0)
(s699 1)
(s700 1)
(s701 0)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 0)
(s712 1)
(s713 1)
(s714 1)
(s715 0)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 4)
(s721 0)
(s722 1)
(s723 1)
(s724 1)
(s725 0)
(s726 0)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 23)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 13)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 13)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 10)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 4)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 110)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 0)
(s810 1)
(s811 1)
(s812 1)
(s813 0)
(s814 0)
(s815 1)
(s816 1)
(s817 0)
(s818 1)
(s819 0)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 0)
(s834 1)
(s835 1)
(s836 1)
(s837 0)
(s838 0)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 0)
(s846 1)
(s847 1)
(s848 0)
(s849 1)
(s850 0)
(s851 0)
(s852 1)
(s853 1)
(s854 0)
(s855 1)
(s856 1)
(s857 0)
(s858 0)
(s859 1)
(s860 1)
(s861 0)
(s862 1)
(s863 0)
(s864 0)
(s865 1)
(s866 0)
(s867 0)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 16)
(s995 1)
(s996 1)
(s997 1)
(s998 0)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 0)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 10)
(s1033 1)
(s1034 1)
(s1035 0)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 0)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 7)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 0)
(s1070 1)
(s1071 0)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 4)
(s1080 1)
(s1081 0)
(s1082 1)
(s1083 0)
(s1084 0)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 9)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 9)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 6)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 4)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 28)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 0)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 0)
(s1173 1)
(s1174 0)
(s1175 1)
(s1176 0)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 0)
(s1189 1)
(s1190 0)
(s1191 1)
(s1192 0)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 0)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 23)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 1)
(s1290 1)
(s1291 1)
(s1292 1)
(s1293 1)
(s1294 1)
(s1295 1)
(s1296 1)
(s1297 1)
(s1298 1)
(s1299 1)
(s1300 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2121/4701 variables, and 129 constraints, problems are : Problem set: 0 solved, 2578 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 0/55 constraints, Generalized P Invariants (flows): 129/172 constraints, State Equation: 0/2122 constraints, PredecessorRefiner: 0/2578 constraints, Known Traps: 0/0 constraints]
After SMT, in 61184ms problems are : Problem set: 0 solved, 2578 unsolved
Search for dead transitions found 0 dead transitions in 61212ms
Finished structural reductions in LTL mode , in 1 iterations and 71817 ms. Remains : 2122/2122 places, 2579/2579 transitions.
Treatment of property ASLink-PT-05b-LTLCardinality-01 finished in 477043 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 2124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2124/2124 places, 2581/2581 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 391 transitions
Trivial Post-agglo rules discarded 391 transitions
Performed 391 trivial Post agglomeration. Transition count delta: 391
Iterating post reduction 0 with 391 rules applied. Total rules applied 391 place count 2123 transition count 2189
Reduce places removed 391 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 394 rules applied. Total rules applied 785 place count 1732 transition count 2186
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 788 place count 1730 transition count 2185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 789 place count 1729 transition count 2185
Performed 574 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 574 Pre rules applied. Total rules applied 789 place count 1729 transition count 1611
Deduced a syphon composed of 574 places in 4 ms
Ensure Unique test removed 53 places
Reduce places removed 627 places and 0 transitions.
Iterating global reduction 4 with 1201 rules applied. Total rules applied 1990 place count 1102 transition count 1611
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 4 with 39 rules applied. Total rules applied 2029 place count 1096 transition count 1578
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 34 rules applied. Total rules applied 2063 place count 1063 transition count 1577
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2064 place count 1062 transition count 1577
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 21 Pre rules applied. Total rules applied 2064 place count 1062 transition count 1556
Deduced a syphon composed of 21 places in 3 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 7 with 63 rules applied. Total rules applied 2127 place count 1020 transition count 1556
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 20 Pre rules applied. Total rules applied 2127 place count 1020 transition count 1536
Deduced a syphon composed of 20 places in 4 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 2167 place count 1000 transition count 1536
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 7 with 340 rules applied. Total rules applied 2507 place count 829 transition count 1367
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2511 place count 825 transition count 1363
Ensure Unique test removed 1 places
Iterating global reduction 7 with 5 rules applied. Total rules applied 2516 place count 824 transition count 1363
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 7 with 1 rules applied. Total rules applied 2517 place count 824 transition count 1362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2518 place count 823 transition count 1362
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 2518 place count 823 transition count 1361
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2520 place count 822 transition count 1361
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2522 place count 820 transition count 1359
Iterating global reduction 9 with 2 rules applied. Total rules applied 2524 place count 820 transition count 1359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 9 with 2 rules applied. Total rules applied 2526 place count 820 transition count 1357
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2527 place count 819 transition count 1357
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 2529 place count 818 transition count 1362
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 2531 place count 816 transition count 1360
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 11 with 15 rules applied. Total rules applied 2546 place count 806 transition count 1355
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 2551 place count 801 transition count 1355
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 15 Pre rules applied. Total rules applied 2551 place count 801 transition count 1340
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 13 with 31 rules applied. Total rules applied 2582 place count 785 transition count 1340
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 13 with 11 rules applied. Total rules applied 2593 place count 774 transition count 1340
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 2593 place count 774 transition count 1339
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 2595 place count 773 transition count 1339
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 14 with 32 rules applied. Total rules applied 2627 place count 757 transition count 1323
Discarding 10 places :
Symmetric choice reduction at 14 with 10 rule applications. Total rules 2637 place count 747 transition count 1313
Iterating global reduction 14 with 10 rules applied. Total rules applied 2647 place count 747 transition count 1313
Discarding 5 places :
Symmetric choice reduction at 14 with 5 rule applications. Total rules 2652 place count 742 transition count 1308
Iterating global reduction 14 with 5 rules applied. Total rules applied 2657 place count 742 transition count 1308
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 2662 place count 742 transition count 1303
Applied a total of 2662 rules in 663 ms. Remains 742 /2124 variables (removed 1382) and now considering 1303/2581 (removed 1278) transitions.
// Phase 1: matrix 1303 rows 742 cols
[2024-06-12 18:14:40] [INFO ] Computed 122 invariants in 15 ms
[2024-06-12 18:14:41] [INFO ] Implicit Places using invariants in 1015 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 257, 258, 270, 271, 273, 290, 308, 328, 379, 380, 392, 394, 396, 413, 431, 451, 502, 503, 515, 516, 518, 535, 553, 573, 624, 625, 628, 639, 640, 641, 659, 680, 681, 682, 683]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 1018 ms to find 49 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 693/2124 places, 1303/2581 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 693 transition count 1216
Reduce places removed 87 places and 0 transitions.
Iterating post reduction 1 with 87 rules applied. Total rules applied 174 place count 606 transition count 1216
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 174 place count 606 transition count 1189
Deduced a syphon composed of 27 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 55 rules applied. Total rules applied 229 place count 578 transition count 1189
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 241 place count 574 transition count 1181
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 249 place count 566 transition count 1181
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 252 place count 563 transition count 1178
Iterating global reduction 4 with 3 rules applied. Total rules applied 255 place count 563 transition count 1178
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 258 place count 563 transition count 1175
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 340 place count 522 transition count 1134
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 344 place count 520 transition count 1135
Applied a total of 344 rules in 99 ms. Remains 520 /693 variables (removed 173) and now considering 1135/1303 (removed 168) transitions.
// Phase 1: matrix 1135 rows 520 cols
[2024-06-12 18:14:41] [INFO ] Computed 68 invariants in 10 ms
[2024-06-12 18:14:42] [INFO ] Implicit Places using invariants in 1135 ms returned [88, 94, 99, 174, 180, 186, 263, 269, 274, 353, 359, 364, 441, 447, 452, 517]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 1138 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 504/2124 places, 1135/2581 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 0 with 1 rules applied. Total rules applied 1 place count 504 transition count 1134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 503 transition count 1134
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 12 place count 493 transition count 1124
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 493 transition count 1124
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 31 place count 484 transition count 1115
Iterating global reduction 2 with 9 rules applied. Total rules applied 40 place count 484 transition count 1115
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 45 place count 479 transition count 1110
Iterating global reduction 2 with 5 rules applied. Total rules applied 50 place count 479 transition count 1110
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 60 place count 474 transition count 1105
Applied a total of 60 rules in 82 ms. Remains 474 /504 variables (removed 30) and now considering 1105/1135 (removed 30) transitions.
// Phase 1: matrix 1105 rows 474 cols
[2024-06-12 18:14:42] [INFO ] Computed 52 invariants in 9 ms
[2024-06-12 18:14:43] [INFO ] Implicit Places using invariants in 929 ms returned []
[2024-06-12 18:14:43] [INFO ] Invariant cache hit.
[2024-06-12 18:14:45] [INFO ] Implicit Places using invariants and state equation in 1444 ms returned []
Implicit Place search using SMT with State Equation took 2377 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 474/2124 places, 1105/2581 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 5380 ms. Remains : 474/2124 places, 1105/2581 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-05b-LTLCardinality-02
Product exploration explored 100000 steps with 1451 reset in 339 ms.
Product exploration explored 100000 steps with 1446 reset in 525 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 137 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 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (568 resets) in 193 ms. (206 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (130 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 287099 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 1
Probabilistic random walk after 287099 steps, saw 126155 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
[2024-06-12 18:14:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 132/134 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/149 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 210/359 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/385 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 56/441 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/441 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 22/463 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/463 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/474 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1105/1579 variables, 474/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1579 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1579 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1579/1579 variables, and 526 constraints, problems are : Problem set: 0 solved, 1 unsolved in 540 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 132/134 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/149 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 210/359 variables, 26/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/385 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 56/441 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/441 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 22/463 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/463 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/474 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1105/1579 variables, 474/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1579 variables, 1/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1579 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1579 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1579/1579 variables, and 527 constraints, problems are : Problem set: 0 solved, 1 unsolved in 666 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 474/474 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1235ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 15508 steps, including 983 resets, run visited all 1 properties in 37 ms. (steps per millisecond=419 )
Parikh walk visited 1 properties in 45 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 474/474 places, 1105/1105 transitions.
Applied a total of 0 rules in 16 ms. Remains 474 /474 variables (removed 0) and now considering 1105/1105 (removed 0) transitions.
[2024-06-12 18:14:50] [INFO ] Invariant cache hit.
[2024-06-12 18:14:51] [INFO ] Implicit Places using invariants in 506 ms returned []
[2024-06-12 18:14:51] [INFO ] Invariant cache hit.
[2024-06-12 18:14:52] [INFO ] Implicit Places using invariants and state equation in 1190 ms returned []
Implicit Place search using SMT with State Equation took 1729 ms to find 0 implicit places.
[2024-06-12 18:14:52] [INFO ] Redundant transitions in 24 ms returned []
Running 1066 sub problems to find dead transitions.
[2024-06-12 18:14:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1066 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 1066 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1066 unsolved
At refinement iteration 3 (OVERLAPS) 2/470 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 1066 unsolved
SMT process timed out in 30646ms, After SMT, problems are : Problem set: 0 solved, 1066 unsolved
Search for dead transitions found 0 dead transitions in 30657ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 32436 ms. Remains : 474/474 places, 1105/1105 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 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 87 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 37772 steps (526 resets) in 258 ms. (145 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 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1388 reset in 241 ms.
Product exploration explored 100000 steps with 1434 reset in 273 ms.
Support contains 2 out of 474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 474/474 places, 1105/1105 transitions.
Applied a total of 0 rules in 16 ms. Remains 474 /474 variables (removed 0) and now considering 1105/1105 (removed 0) transitions.
[2024-06-12 18:15:24] [INFO ] Invariant cache hit.
[2024-06-12 18:15:25] [INFO ] Implicit Places using invariants in 514 ms returned []
[2024-06-12 18:15:25] [INFO ] Invariant cache hit.
[2024-06-12 18:15:26] [INFO ] Implicit Places using invariants and state equation in 1230 ms returned []
Implicit Place search using SMT with State Equation took 1775 ms to find 0 implicit places.
[2024-06-12 18:15:26] [INFO ] Redundant transitions in 19 ms returned []
Running 1066 sub problems to find dead transitions.
[2024-06-12 18:15:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1066 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 1066 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1066 unsolved
At refinement iteration 3 (OVERLAPS) 2/470 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 1066 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1066 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/1579 variables, and 39 constraints, problems are : Problem set: 0 solved, 1066 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 28/41 constraints, State Equation: 0/474 constraints, PredecessorRefiner: 1066/1066 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1066 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1066 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 27/33 constraints. Problems are: Problem set: 0 solved, 1066 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/468 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1066 unsolved
At refinement iteration 3 (OVERLAPS) 2/470 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 1066 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 1066 unsolved
[2024-06-12 18:16:16] [INFO ] Deduced a trap composed of 60 places in 133 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1066 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 470/1579 variables, and 40 constraints, problems are : Problem set: 0 solved, 1066 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 28/41 constraints, State Equation: 0/474 constraints, PredecessorRefiner: 0/1066 constraints, Known Traps: 1/1 constraints]
After SMT, in 60622ms problems are : Problem set: 0 solved, 1066 unsolved
Search for dead transitions found 0 dead transitions in 60634ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62456 ms. Remains : 474/474 places, 1105/1105 transitions.
Treatment of property ASLink-PT-05b-LTLCardinality-02 finished in 107359 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)&&X(p1))))'
Support contains 4 out of 2124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2124/2124 places, 2581/2581 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2121 transition count 2578
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2121 transition count 2578
Applied a total of 6 rules in 263 ms. Remains 2121 /2124 variables (removed 3) and now considering 2578/2581 (removed 3) transitions.
// Phase 1: matrix 2578 rows 2121 cols
[2024-06-12 18:16:27] [INFO ] Computed 227 invariants in 31 ms
[2024-06-12 18:16:28] [INFO ] Implicit Places using invariants in 1570 ms returned []
[2024-06-12 18:16:28] [INFO ] Invariant cache hit.
[2024-06-12 18:16:44] [INFO ] Implicit Places using invariants and state equation in 15167 ms returned []
Implicit Place search using SMT with State Equation took 16744 ms to find 0 implicit places.
Running 2577 sub problems to find dead transitions.
[2024-06-12 18:16:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 2577/2577 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2577 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 13)
(s12 1)
(s13 1)
(s14 0)
(s15 0)
(s16 1)
(s17 1)
(s18 0)
(s19 0)
(s20 1)
(s21 1)
(s22 0)
(s23 0)
(s24 1)
(s25 1)
(s26 0)
(s27 0)
(s28 1)
(s29 1)
(s30 0)
(s31 0)
(s32 1)
(s33 1)
(s34 0)
(s35 0)
(s36 1)
(s37 1)
(s38 0)
(s39 0)
(s40 1)
(s41 1)
(s42 0)
(s43 0)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 3)
(s49 1)
(s50 6)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 22)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 6)
(s92 1)
(s93 0)
(s94 1)
(s95 1)
(s96 0)
(s97 1)
(s98 1)
(s99 1)
(s100 0)
(s101 0)
(s102 1)
(s103 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 0/2577 constraints, Known Traps: 0/0 constraints]
After SMT, in 61111ms problems are : Problem set: 0 solved, 2577 unsolved
Search for dead transitions found 0 dead transitions in 61138ms
Starting structural reductions in LTL mode, iteration 1 : 2121/2124 places, 2578/2581 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78151 ms. Remains : 2121/2124 places, 2578/2581 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-05b-LTLCardinality-05
Product exploration explored 100000 steps with 194 reset in 344 ms.
Product exploration explored 100000 steps with 192 reset in 420 ms.
Computed a total of 86 stabilizing places and 86 stable transitions
Computed a total of 86 stabilizing places and 86 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 117 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (82 resets) in 216 ms. (184 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (10 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
[2024-06-12 18:17:46] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 536/578 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1484/2062 variables, 165/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2062 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 59/2121 variables, 8/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2121 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4699/4699 variables, and 2348 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1876 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 173/173 constraints, State Equation: 2121/2121 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 536/578 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1484/2062 variables, 165/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-12 18:17:50] [INFO ] Deduced a trap composed of 26 places in 1700 ms of which 19 ms to minimize.
[2024-06-12 18:17:52] [INFO ] Deduced a trap composed of 50 places in 1761 ms of which 17 ms to minimize.
[2024-06-12 18:17:53] [INFO ] Deduced a trap composed of 93 places in 1540 ms of which 17 ms to minimize.
SMT process timed out in 7442ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 2121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 388 transitions
Trivial Post-agglo rules discarded 388 transitions
Performed 388 trivial Post agglomeration. Transition count delta: 388
Iterating post reduction 0 with 388 rules applied. Total rules applied 388 place count 2121 transition count 2190
Reduce places removed 388 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 391 rules applied. Total rules applied 779 place count 1733 transition count 2187
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 783 place count 1731 transition count 2185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 785 place count 1729 transition count 2185
Performed 572 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 572 Pre rules applied. Total rules applied 785 place count 1729 transition count 1613
Deduced a syphon composed of 572 places in 4 ms
Ensure Unique test removed 53 places
Reduce places removed 625 places and 0 transitions.
Iterating global reduction 4 with 1197 rules applied. Total rules applied 1982 place count 1104 transition count 1613
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 4 with 39 rules applied. Total rules applied 2021 place count 1099 transition count 1579
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 5 with 34 rules applied. Total rules applied 2055 place count 1065 transition count 1579
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 20 Pre rules applied. Total rules applied 2055 place count 1065 transition count 1559
Deduced a syphon composed of 20 places in 4 ms
Ensure Unique test removed 20 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 2115 place count 1025 transition count 1559
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 19 Pre rules applied. Total rules applied 2115 place count 1025 transition count 1540
Deduced a syphon composed of 19 places in 4 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 2153 place count 1006 transition count 1540
Performed 173 Post agglomeration using F-continuation condition.Transition count delta: 173
Deduced a syphon composed of 173 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 6 with 348 rules applied. Total rules applied 2501 place count 831 transition count 1367
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2505 place count 827 transition count 1363
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2510 place count 826 transition count 1363
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 6 with 1 rules applied. Total rules applied 2511 place count 826 transition count 1362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2512 place count 825 transition count 1362
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2512 place count 825 transition count 1361
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2514 place count 824 transition count 1361
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2516 place count 822 transition count 1359
Iterating global reduction 8 with 2 rules applied. Total rules applied 2518 place count 822 transition count 1359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 8 with 2 rules applied. Total rules applied 2520 place count 822 transition count 1357
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2521 place count 821 transition count 1357
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2523 place count 820 transition count 1362
Free-agglomeration rule applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 2529 place count 820 transition count 1356
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 2535 place count 814 transition count 1356
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 2539 place count 814 transition count 1352
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 2543 place count 810 transition count 1352
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 2548 place count 810 transition count 1352
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2549 place count 809 transition count 1351
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 12 with 15 rules applied. Total rules applied 2564 place count 799 transition count 1346
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 2569 place count 794 transition count 1346
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 15 Pre rules applied. Total rules applied 2569 place count 794 transition count 1331
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 14 with 31 rules applied. Total rules applied 2600 place count 778 transition count 1331
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 14 with 6 rules applied. Total rules applied 2606 place count 772 transition count 1331
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2606 place count 772 transition count 1330
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2608 place count 771 transition count 1330
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 15 with 22 rules applied. Total rules applied 2630 place count 760 transition count 1319
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 2635 place count 755 transition count 1314
Iterating global reduction 15 with 5 rules applied. Total rules applied 2640 place count 755 transition count 1314
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 2645 place count 755 transition count 1309
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 2650 place count 750 transition count 1309
Applied a total of 2650 rules in 636 ms. Remains 750 /2121 variables (removed 1371) and now considering 1309/2578 (removed 1269) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 636 ms. Remains : 750/2121 places, 1309/2578 transitions.
RANDOM walk for 40000 steps (477 resets) in 282 ms. (141 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (87 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 291172 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :0 out of 1
Probabilistic random walk after 291172 steps, saw 60653 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
// Phase 1: matrix 1309 rows 750 cols
[2024-06-12 18:17:57] [INFO ] Computed 129 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/77 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/80 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 187/267 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 78/345 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/349 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/349 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 252/601 variables, 42/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/601 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 17/618 variables, 9/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/618 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 100/718 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/718 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/721 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/721 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 27/748 variables, 7/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/748 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/750 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/750 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1309/2059 variables, 750/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2059 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/2059 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2059/2059 variables, and 879 constraints, problems are : Problem set: 0 solved, 1 unsolved in 963 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 92/92 constraints, State Equation: 750/750 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/77 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/80 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 187/267 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 78/345 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/349 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/349 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 252/601 variables, 42/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/601 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 17/618 variables, 9/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/618 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 100/718 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/718 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/721 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/721 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 27/748 variables, 7/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/748 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/750 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/750 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1309/2059 variables, 750/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2059 variables, 1/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2059 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/2059 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2059/2059 variables, and 880 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2522 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 92/92 constraints, State Equation: 750/750 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3505ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 145 ms.
Support contains 2 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1309/1309 transitions.
Applied a total of 0 rules in 24 ms. Remains 750 /750 variables (removed 0) and now considering 1309/1309 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 750/750 places, 1309/1309 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1309/1309 transitions.
Applied a total of 0 rules in 24 ms. Remains 750 /750 variables (removed 0) and now considering 1309/1309 (removed 0) transitions.
[2024-06-12 18:18:01] [INFO ] Invariant cache hit.
[2024-06-12 18:18:02] [INFO ] Implicit Places using invariants in 1146 ms returned [1, 18, 19, 31, 48, 66, 102, 105, 139, 143, 152, 153, 155, 172, 190, 259, 263, 264, 275, 276, 278, 295, 313, 382, 386, 387, 398, 399, 401, 419, 437, 506, 510, 511, 522, 523, 525, 542, 560, 629, 633, 634, 637, 648, 649, 650, 668, 689, 690, 691, 692]
[2024-06-12 18:18:02] [INFO ] Actually due to overlaps returned [668, 650, 48, 172, 295, 419, 542, 31, 155, 278, 401, 525, 152, 275, 398, 522, 648, 689, 153, 276, 399, 523, 649, 690, 1, 18, 263, 264, 386, 387, 510, 511, 633, 634, 66, 190, 313, 437, 560, 691, 19, 637, 692]
Discarding 43 places :
Implicit Place search using SMT only with invariants took 1151 ms to find 43 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 707/750 places, 1309/1309 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 702 transition count 1217
Reduce places removed 92 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 194 place count 610 transition count 1212
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 194 place count 610 transition count 1185
Deduced a syphon composed of 27 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 55 rules applied. Total rules applied 249 place count 582 transition count 1185
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 261 place count 578 transition count 1177
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 269 place count 570 transition count 1177
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 272 place count 567 transition count 1174
Iterating global reduction 4 with 3 rules applied. Total rules applied 275 place count 567 transition count 1174
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 278 place count 567 transition count 1171
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 352 place count 530 transition count 1134
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 357 place count 525 transition count 1129
Iterating global reduction 5 with 5 rules applied. Total rules applied 362 place count 525 transition count 1129
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 367 place count 525 transition count 1124
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 371 place count 523 transition count 1125
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 381 place count 523 transition count 1115
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 392 place count 512 transition count 1115
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 7 with 15 rules applied. Total rules applied 407 place count 512 transition count 1115
Applied a total of 407 rules in 124 ms. Remains 512 /707 variables (removed 195) and now considering 1115/1309 (removed 194) transitions.
// Phase 1: matrix 1115 rows 512 cols
[2024-06-12 18:18:02] [INFO ] Computed 75 invariants in 9 ms
[2024-06-12 18:18:03] [INFO ] Implicit Places using invariants in 618 ms returned [73, 82, 85, 93, 99, 102, 104, 105, 108, 109, 162, 178, 184, 187, 189, 194, 195, 248, 264, 270, 273, 275, 280, 281, 335, 351, 357, 360, 362, 367, 368, 421, 437, 443, 446, 448]
[2024-06-12 18:18:03] [INFO ] Actually due to overlaps returned [108, 194, 280, 367, 109, 195, 281, 368, 93, 99, 104, 178, 184, 189, 264, 270, 275, 351, 357, 362, 437, 443, 448, 73, 82, 105, 162, 248, 335, 421]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 638 ms to find 30 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 482/750 places, 1115/1309 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 462 transition count 1095
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 462 transition count 1095
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 457 transition count 1090
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 457 transition count 1090
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 70 place count 447 transition count 1080
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 85 place count 447 transition count 1065
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 100 place count 432 transition count 1065
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 105 place count 432 transition count 1060
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 110 place count 427 transition count 1060
Applied a total of 110 rules in 84 ms. Remains 427 /482 variables (removed 55) and now considering 1060/1115 (removed 55) transitions.
// Phase 1: matrix 1060 rows 427 cols
[2024-06-12 18:18:03] [INFO ] Computed 45 invariants in 10 ms
[2024-06-12 18:18:03] [INFO ] Implicit Places using invariants in 544 ms returned [81]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 553 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 426/750 places, 1060/1309 transitions.
Applied a total of 0 rules in 15 ms. Remains 426 /426 variables (removed 0) and now considering 1060/1060 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 2589 ms. Remains : 426/750 places, 1060/1309 transitions.
RANDOM walk for 40000 steps (718 resets) in 273 ms. (145 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (177 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 398132 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :0 out of 1
Probabilistic random walk after 398132 steps, saw 94303 distinct states, run finished after 3002 ms. (steps per millisecond=132 ) properties seen :0
// Phase 1: matrix 1060 rows 426 cols
[2024-06-12 18:18:07] [INFO ] Computed 44 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/49 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/52 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/65 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/68 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 264/332 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 28/360 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 66/426 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1060/1486 variables, 426/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1486 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1486 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1486/1486 variables, and 470 constraints, problems are : Problem set: 0 solved, 1 unsolved in 497 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 426/426 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/49 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/52 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/65 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/68 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 264/332 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 28/360 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 66/426 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1060/1486 variables, 426/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1486/1486 variables, and 471 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8112 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 426/426 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 8623ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 131 ms.
Support contains 2 out of 426 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 1060/1060 transitions.
Applied a total of 0 rules in 15 ms. Remains 426 /426 variables (removed 0) and now considering 1060/1060 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 426/426 places, 1060/1060 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 1060/1060 transitions.
Applied a total of 0 rules in 16 ms. Remains 426 /426 variables (removed 0) and now considering 1060/1060 (removed 0) transitions.
[2024-06-12 18:18:15] [INFO ] Invariant cache hit.
[2024-06-12 18:18:16] [INFO ] Implicit Places using invariants in 582 ms returned []
[2024-06-12 18:18:16] [INFO ] Invariant cache hit.
[2024-06-12 18:18:17] [INFO ] Implicit Places using invariants and state equation in 1128 ms returned []
Implicit Place search using SMT with State Equation took 1736 ms to find 0 implicit places.
[2024-06-12 18:18:17] [INFO ] Redundant transitions in 18 ms returned []
Running 1031 sub problems to find dead transitions.
[2024-06-12 18:18:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1031 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 31/40 constraints. Problems are: Problem set: 0 solved, 1031 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1031 unsolved
At refinement iteration 3 (OVERLAPS) 1/426 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1031 unsolved
SMT process timed out in 30644ms, After SMT, problems are : Problem set: 0 solved, 1031 unsolved
Search for dead transitions found 0 dead transitions in 30655ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32436 ms. Remains : 426/426 places, 1060/1060 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 15 ms. Remains 426 /426 variables (removed 0) and now considering 1060/1060 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-12 18:18:48] [INFO ] Invariant cache hit.
[2024-06-12 18:18:48] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-12 18:18:48] [INFO ] [Nat]Absence check using 12 positive place invariants in 9 ms returned sat
[2024-06-12 18:18:48] [INFO ] [Nat]Absence check using 12 positive and 32 generalized place invariants in 20 ms returned sat
[2024-06-12 18:18:49] [INFO ] After 996ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-12 18:18:51] [INFO ] After 3103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-12 18:18:51] [INFO ] After 3307ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 3425 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (NOT (OR p1 p0))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 199 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 2578 rows 2121 cols
[2024-06-12 18:18:52] [INFO ] Computed 227 invariants in 43 ms
[2024-06-12 18:18:54] [INFO ] [Real]Absence check using 54 positive place invariants in 62 ms returned sat
[2024-06-12 18:18:55] [INFO ] [Real]Absence check using 54 positive and 173 generalized place invariants in 985 ms returned sat
[2024-06-12 18:19:07] [INFO ] [Real]Absence check using state equation in 11489 ms returned unknown
Could not prove EG (NOT p1)
Support contains 4 out of 2121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Applied a total of 0 rules in 128 ms. Remains 2121 /2121 variables (removed 0) and now considering 2578/2578 (removed 0) transitions.
[2024-06-12 18:19:07] [INFO ] Invariant cache hit.
[2024-06-12 18:19:08] [INFO ] Implicit Places using invariants in 1321 ms returned []
[2024-06-12 18:19:08] [INFO ] Invariant cache hit.
[2024-06-12 18:19:23] [INFO ] Implicit Places using invariants and state equation in 14953 ms returned []
Implicit Place search using SMT with State Equation took 16290 ms to find 0 implicit places.
Running 2577 sub problems to find dead transitions.
[2024-06-12 18:19:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 2577/2577 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2577 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 0/2577 constraints, Known Traps: 0/0 constraints]
After SMT, in 61140ms problems are : Problem set: 0 solved, 2577 unsolved
Search for dead transitions found 0 dead transitions in 61166ms
Finished structural reductions in LTL mode , in 1 iterations and 77600 ms. Remains : 2121/2121 places, 2578/2578 transitions.
Computed a total of 86 stabilizing places and 86 stable transitions
Computed a total of 86 stabilizing places and 86 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p1) p0)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 238 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (74 resets) in 253 ms. (157 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (10 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
[2024-06-12 18:20:25] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 536/578 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1484/2062 variables, 165/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2062 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 59/2121 variables, 8/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2121 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4699/4699 variables, and 2348 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1898 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 173/173 constraints, State Equation: 2121/2121 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 536/578 variables, 53/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1484/2062 variables, 165/219 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-12 18:20:29] [INFO ] Deduced a trap composed of 26 places in 1666 ms of which 17 ms to minimize.
[2024-06-12 18:20:31] [INFO ] Deduced a trap composed of 50 places in 1533 ms of which 16 ms to minimize.
[2024-06-12 18:20:32] [INFO ] Deduced a trap composed of 93 places in 1398 ms of which 16 ms to minimize.
SMT process timed out in 7085ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 2121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 388 transitions
Trivial Post-agglo rules discarded 388 transitions
Performed 388 trivial Post agglomeration. Transition count delta: 388
Iterating post reduction 0 with 388 rules applied. Total rules applied 388 place count 2121 transition count 2190
Reduce places removed 388 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 391 rules applied. Total rules applied 779 place count 1733 transition count 2187
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 783 place count 1731 transition count 2185
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 785 place count 1729 transition count 2185
Performed 572 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 572 Pre rules applied. Total rules applied 785 place count 1729 transition count 1613
Deduced a syphon composed of 572 places in 6 ms
Ensure Unique test removed 53 places
Reduce places removed 625 places and 0 transitions.
Iterating global reduction 4 with 1197 rules applied. Total rules applied 1982 place count 1104 transition count 1613
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 4 with 39 rules applied. Total rules applied 2021 place count 1099 transition count 1579
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 5 with 34 rules applied. Total rules applied 2055 place count 1065 transition count 1579
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 20 Pre rules applied. Total rules applied 2055 place count 1065 transition count 1559
Deduced a syphon composed of 20 places in 4 ms
Ensure Unique test removed 20 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 2115 place count 1025 transition count 1559
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 19 Pre rules applied. Total rules applied 2115 place count 1025 transition count 1540
Deduced a syphon composed of 19 places in 4 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 2153 place count 1006 transition count 1540
Performed 173 Post agglomeration using F-continuation condition.Transition count delta: 173
Deduced a syphon composed of 173 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 6 with 348 rules applied. Total rules applied 2501 place count 831 transition count 1367
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2505 place count 827 transition count 1363
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2510 place count 826 transition count 1363
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 6 with 1 rules applied. Total rules applied 2511 place count 826 transition count 1362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2512 place count 825 transition count 1362
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2512 place count 825 transition count 1361
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2514 place count 824 transition count 1361
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2516 place count 822 transition count 1359
Iterating global reduction 8 with 2 rules applied. Total rules applied 2518 place count 822 transition count 1359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 8 with 2 rules applied. Total rules applied 2520 place count 822 transition count 1357
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2521 place count 821 transition count 1357
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2523 place count 820 transition count 1362
Free-agglomeration rule applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 2529 place count 820 transition count 1356
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 2535 place count 814 transition count 1356
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 2539 place count 814 transition count 1352
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 2543 place count 810 transition count 1352
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 2548 place count 810 transition count 1352
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2549 place count 809 transition count 1351
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 12 with 15 rules applied. Total rules applied 2564 place count 799 transition count 1346
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 2569 place count 794 transition count 1346
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 15 Pre rules applied. Total rules applied 2569 place count 794 transition count 1331
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 14 with 31 rules applied. Total rules applied 2600 place count 778 transition count 1331
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 14 with 6 rules applied. Total rules applied 2606 place count 772 transition count 1331
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2606 place count 772 transition count 1330
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2608 place count 771 transition count 1330
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 15 with 22 rules applied. Total rules applied 2630 place count 760 transition count 1319
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 2635 place count 755 transition count 1314
Iterating global reduction 15 with 5 rules applied. Total rules applied 2640 place count 755 transition count 1314
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 2645 place count 755 transition count 1309
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 2650 place count 750 transition count 1309
Applied a total of 2650 rules in 590 ms. Remains 750 /2121 variables (removed 1371) and now considering 1309/2578 (removed 1269) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 591 ms. Remains : 750/2121 places, 1309/2578 transitions.
RANDOM walk for 40000 steps (499 resets) in 337 ms. (118 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (93 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 298844 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 1
Probabilistic random walk after 298844 steps, saw 61921 distinct states, run finished after 3001 ms. (steps per millisecond=99 ) properties seen :0
// Phase 1: matrix 1309 rows 750 cols
[2024-06-12 18:20:36] [INFO ] Computed 129 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/77 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/80 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 187/267 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 78/345 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/349 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/349 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 252/601 variables, 42/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/601 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 17/618 variables, 9/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/618 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 100/718 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/718 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/721 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/721 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 27/748 variables, 7/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/748 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/750 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/750 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1309/2059 variables, 750/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2059 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/2059 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2059/2059 variables, and 879 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1029 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 92/92 constraints, State Equation: 750/750 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 50/77 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/80 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 187/267 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 78/345 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/349 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/349 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 252/601 variables, 42/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/601 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 17/618 variables, 9/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/618 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 100/718 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/718 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/721 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/721 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 27/748 variables, 7/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/748 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/750 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/750 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 1309/2059 variables, 750/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2059 variables, 1/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2059 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/2059 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2059/2059 variables, and 880 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2532 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 92/92 constraints, State Equation: 750/750 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3608ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 179 ms.
Support contains 2 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1309/1309 transitions.
Applied a total of 0 rules in 24 ms. Remains 750 /750 variables (removed 0) and now considering 1309/1309 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 750/750 places, 1309/1309 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1309/1309 transitions.
Applied a total of 0 rules in 24 ms. Remains 750 /750 variables (removed 0) and now considering 1309/1309 (removed 0) transitions.
[2024-06-12 18:20:40] [INFO ] Invariant cache hit.
[2024-06-12 18:20:41] [INFO ] Implicit Places using invariants in 1149 ms returned [1, 18, 19, 31, 48, 66, 102, 105, 139, 143, 152, 153, 155, 172, 190, 259, 263, 264, 275, 276, 278, 295, 313, 382, 386, 387, 398, 399, 401, 419, 437, 506, 510, 511, 522, 523, 525, 542, 560, 629, 633, 634, 637, 648, 649, 650, 668, 689, 690, 691, 692]
[2024-06-12 18:20:41] [INFO ] Actually due to overlaps returned [668, 650, 48, 172, 295, 419, 542, 31, 155, 278, 401, 525, 152, 275, 398, 522, 648, 689, 153, 276, 399, 523, 649, 690, 1, 18, 263, 264, 386, 387, 510, 511, 633, 634, 66, 190, 313, 437, 560, 691, 19, 637, 692]
Discarding 43 places :
Implicit Place search using SMT only with invariants took 1153 ms to find 43 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 707/750 places, 1309/1309 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 97 rules applied. Total rules applied 97 place count 702 transition count 1217
Reduce places removed 92 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 194 place count 610 transition count 1212
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 194 place count 610 transition count 1185
Deduced a syphon composed of 27 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 55 rules applied. Total rules applied 249 place count 582 transition count 1185
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 261 place count 578 transition count 1177
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 269 place count 570 transition count 1177
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 272 place count 567 transition count 1174
Iterating global reduction 4 with 3 rules applied. Total rules applied 275 place count 567 transition count 1174
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 278 place count 567 transition count 1171
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 352 place count 530 transition count 1134
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 357 place count 525 transition count 1129
Iterating global reduction 5 with 5 rules applied. Total rules applied 362 place count 525 transition count 1129
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 367 place count 525 transition count 1124
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 371 place count 523 transition count 1125
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 381 place count 523 transition count 1115
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 392 place count 512 transition count 1115
Partial Free-agglomeration rule applied 15 times.
Drop transitions (Partial Free agglomeration) removed 15 transitions
Iterating global reduction 7 with 15 rules applied. Total rules applied 407 place count 512 transition count 1115
Applied a total of 407 rules in 188 ms. Remains 512 /707 variables (removed 195) and now considering 1115/1309 (removed 194) transitions.
// Phase 1: matrix 1115 rows 512 cols
[2024-06-12 18:20:41] [INFO ] Computed 75 invariants in 13 ms
[2024-06-12 18:20:41] [INFO ] Implicit Places using invariants in 609 ms returned [73, 82, 85, 93, 99, 102, 104, 105, 108, 109, 162, 178, 184, 187, 189, 194, 195, 248, 264, 270, 273, 275, 280, 281, 335, 351, 357, 360, 362, 367, 368, 421, 437, 443, 446, 448]
[2024-06-12 18:20:42] [INFO ] Actually due to overlaps returned [108, 194, 280, 367, 109, 195, 281, 368, 93, 99, 104, 178, 184, 189, 264, 270, 275, 351, 357, 362, 437, 443, 448, 73, 82, 105, 162, 248, 335, 421]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 626 ms to find 30 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 482/750 places, 1115/1309 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 462 transition count 1095
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 462 transition count 1095
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 457 transition count 1090
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 457 transition count 1090
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 70 place count 447 transition count 1080
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 85 place count 447 transition count 1065
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 100 place count 432 transition count 1065
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 105 place count 432 transition count 1060
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 110 place count 427 transition count 1060
Applied a total of 110 rules in 85 ms. Remains 427 /482 variables (removed 55) and now considering 1060/1115 (removed 55) transitions.
// Phase 1: matrix 1060 rows 427 cols
[2024-06-12 18:20:42] [INFO ] Computed 45 invariants in 9 ms
[2024-06-12 18:20:42] [INFO ] Implicit Places using invariants in 458 ms returned [81]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 462 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 426/750 places, 1060/1309 transitions.
Applied a total of 0 rules in 15 ms. Remains 426 /426 variables (removed 0) and now considering 1060/1060 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 2559 ms. Remains : 426/750 places, 1060/1309 transitions.
RANDOM walk for 40000 steps (714 resets) in 190 ms. (209 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (172 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 396376 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :0 out of 1
Probabilistic random walk after 396376 steps, saw 93836 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
// Phase 1: matrix 1060 rows 426 cols
[2024-06-12 18:20:45] [INFO ] Computed 44 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/49 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/52 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/65 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/68 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 264/332 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 28/360 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 66/426 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1060/1486 variables, 426/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1486 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1486 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1486/1486 variables, and 470 constraints, problems are : Problem set: 0 solved, 1 unsolved in 470 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 426/426 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 28/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/49 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/52 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 13/65 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/68 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/68 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 264/332 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/332 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 28/360 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/360 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 66/426 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1060/1486 variables, 426/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1486/1486 variables, and 471 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8116 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 426/426 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 8612ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 118 ms.
Support contains 2 out of 426 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 1060/1060 transitions.
Applied a total of 0 rules in 15 ms. Remains 426 /426 variables (removed 0) and now considering 1060/1060 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 426/426 places, 1060/1060 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 1060/1060 transitions.
Applied a total of 0 rules in 15 ms. Remains 426 /426 variables (removed 0) and now considering 1060/1060 (removed 0) transitions.
[2024-06-12 18:20:54] [INFO ] Invariant cache hit.
[2024-06-12 18:20:54] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-06-12 18:20:54] [INFO ] Invariant cache hit.
[2024-06-12 18:20:56] [INFO ] Implicit Places using invariants and state equation in 1205 ms returned []
Implicit Place search using SMT with State Equation took 1688 ms to find 0 implicit places.
[2024-06-12 18:20:56] [INFO ] Redundant transitions in 19 ms returned []
Running 1031 sub problems to find dead transitions.
[2024-06-12 18:20:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1031 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 31/40 constraints. Problems are: Problem set: 0 solved, 1031 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1031 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1/426 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1031 unsolved
SMT process timed out in 30670ms, After SMT, problems are : Problem set: 0 solved, 1031 unsolved
Search for dead transitions found 0 dead transitions in 30681ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32413 ms. Remains : 426/426 places, 1060/1060 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 15 ms. Remains 426 /426 variables (removed 0) and now considering 1060/1060 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-12 18:21:26] [INFO ] Invariant cache hit.
[2024-06-12 18:21:26] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-12 18:21:27] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-06-12 18:21:27] [INFO ] [Nat]Absence check using 12 positive and 32 generalized place invariants in 18 ms returned sat
[2024-06-12 18:21:28] [INFO ] After 990ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-12 18:21:30] [INFO ] After 3099ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-12 18:21:30] [INFO ] After 3291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 3423 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND (NOT p1) p0)), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 211 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
// Phase 1: matrix 2578 rows 2121 cols
[2024-06-12 18:21:30] [INFO ] Computed 227 invariants in 29 ms
[2024-06-12 18:21:33] [INFO ] [Real]Absence check using 54 positive place invariants in 64 ms returned sat
[2024-06-12 18:21:34] [INFO ] [Real]Absence check using 54 positive and 173 generalized place invariants in 978 ms returned sat
[2024-06-12 18:21:45] [INFO ] [Real]Absence check using state equation in 11610 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 188 reset in 374 ms.
Product exploration explored 100000 steps with 187 reset in 383 ms.
Support contains 4 out of 2121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2121/2121 places, 2578/2578 transitions.
Applied a total of 0 rules in 128 ms. Remains 2121 /2121 variables (removed 0) and now considering 2578/2578 (removed 0) transitions.
[2024-06-12 18:21:46] [INFO ] Invariant cache hit.
[2024-06-12 18:21:48] [INFO ] Implicit Places using invariants in 1364 ms returned []
[2024-06-12 18:21:48] [INFO ] Invariant cache hit.
[2024-06-12 18:22:03] [INFO ] Implicit Places using invariants and state equation in 15538 ms returned []
Implicit Place search using SMT with State Equation took 16919 ms to find 0 implicit places.
Running 2577 sub problems to find dead transitions.
[2024-06-12 18:22:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 2577/2577 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2577 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30063 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 0/2577 constraints, Known Traps: 0/0 constraints]
After SMT, in 61131ms problems are : Problem set: 0 solved, 2577 unsolved
Search for dead transitions found 0 dead transitions in 61159ms
Finished structural reductions in LTL mode , in 1 iterations and 78212 ms. Remains : 2121/2121 places, 2578/2578 transitions.
Treatment of property ASLink-PT-05b-LTLCardinality-05 finished in 397994 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 2124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2124/2124 places, 2581/2581 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2121 transition count 2578
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2121 transition count 2578
Applied a total of 6 rules in 262 ms. Remains 2121 /2124 variables (removed 3) and now considering 2578/2581 (removed 3) transitions.
[2024-06-12 18:23:05] [INFO ] Invariant cache hit.
[2024-06-12 18:23:06] [INFO ] Implicit Places using invariants in 1351 ms returned []
[2024-06-12 18:23:06] [INFO ] Invariant cache hit.
[2024-06-12 18:23:21] [INFO ] Implicit Places using invariants and state equation in 14418 ms returned []
Implicit Place search using SMT with State Equation took 15792 ms to find 0 implicit places.
Running 2577 sub problems to find dead transitions.
[2024-06-12 18:23:21] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 13.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 3.0)
(s49 1.0)
(s50 6.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 22.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 6.0)
(s92 1.0)
(s93 0.0)
(s94 1.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 0.0)
(s118 5.0)
(s119 1.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 0.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 1.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 1.0)
(s158 1.0)
(s159 0.0)
(s160 1.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 1.0)
(s165 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 2577/2577 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2577 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 0/2577 constraints, Known Traps: 0/0 constraints]
After SMT, in 61155ms problems are : Problem set: 0 solved, 2577 unsolved
Search for dead transitions found 0 dead transitions in 61182ms
Starting structural reductions in LTL mode, iteration 1 : 2121/2124 places, 2578/2581 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77241 ms. Remains : 2121/2124 places, 2578/2581 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-05b-LTLCardinality-06
Product exploration explored 100000 steps with 33333 reset in 669 ms.
Product exploration explored 100000 steps with 33333 reset in 634 ms.
Computed a total of 86 stabilizing places and 86 stable transitions
Computed a total of 86 stabilizing places and 86 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 20 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-05b-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-05b-LTLCardinality-06 finished in 78774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 2124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2124/2124 places, 2581/2581 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 391 transitions
Trivial Post-agglo rules discarded 391 transitions
Performed 391 trivial Post agglomeration. Transition count delta: 391
Iterating post reduction 0 with 391 rules applied. Total rules applied 391 place count 2123 transition count 2189
Reduce places removed 391 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 394 rules applied. Total rules applied 785 place count 1732 transition count 2186
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 788 place count 1730 transition count 2185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 789 place count 1729 transition count 2185
Performed 574 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 574 Pre rules applied. Total rules applied 789 place count 1729 transition count 1611
Deduced a syphon composed of 574 places in 3 ms
Ensure Unique test removed 54 places
Reduce places removed 628 places and 0 transitions.
Iterating global reduction 4 with 1202 rules applied. Total rules applied 1991 place count 1101 transition count 1611
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 4 with 39 rules applied. Total rules applied 2030 place count 1096 transition count 1577
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 5 with 34 rules applied. Total rules applied 2064 place count 1062 transition count 1577
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 21 Pre rules applied. Total rules applied 2064 place count 1062 transition count 1556
Deduced a syphon composed of 21 places in 3 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 63 rules applied. Total rules applied 2127 place count 1020 transition count 1556
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 20 Pre rules applied. Total rules applied 2127 place count 1020 transition count 1536
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 2167 place count 1000 transition count 1536
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 6 with 342 rules applied. Total rules applied 2509 place count 828 transition count 1366
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2513 place count 824 transition count 1362
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2518 place count 823 transition count 1362
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 6 with 1 rules applied. Total rules applied 2519 place count 823 transition count 1361
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2520 place count 822 transition count 1361
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2520 place count 822 transition count 1360
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2522 place count 821 transition count 1360
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2524 place count 819 transition count 1358
Iterating global reduction 8 with 2 rules applied. Total rules applied 2526 place count 819 transition count 1358
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 8 with 2 rules applied. Total rules applied 2528 place count 819 transition count 1356
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2529 place count 818 transition count 1356
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2531 place count 817 transition count 1361
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2533 place count 815 transition count 1359
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 10 with 15 rules applied. Total rules applied 2548 place count 805 transition count 1354
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 2553 place count 800 transition count 1354
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 15 Pre rules applied. Total rules applied 2553 place count 800 transition count 1339
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 12 with 31 rules applied. Total rules applied 2584 place count 784 transition count 1339
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 12 with 11 rules applied. Total rules applied 2595 place count 773 transition count 1339
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 2595 place count 773 transition count 1338
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 2597 place count 772 transition count 1338
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 13 with 32 rules applied. Total rules applied 2629 place count 756 transition count 1322
Discarding 10 places :
Symmetric choice reduction at 13 with 10 rule applications. Total rules 2639 place count 746 transition count 1312
Iterating global reduction 13 with 10 rules applied. Total rules applied 2649 place count 746 transition count 1312
Discarding 5 places :
Symmetric choice reduction at 13 with 5 rule applications. Total rules 2654 place count 741 transition count 1307
Iterating global reduction 13 with 5 rules applied. Total rules applied 2659 place count 741 transition count 1307
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 2664 place count 741 transition count 1302
Applied a total of 2664 rules in 459 ms. Remains 741 /2124 variables (removed 1383) and now considering 1302/2581 (removed 1279) transitions.
// Phase 1: matrix 1302 rows 741 cols
[2024-06-12 18:24:24] [INFO ] Computed 122 invariants in 13 ms
[2024-06-12 18:24:25] [INFO ] Implicit Places using invariants in 1068 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 378, 379, 391, 392, 394, 411, 429, 449, 501, 502, 514, 515, 517, 534, 552, 572, 623, 624, 627, 638, 639, 640, 658, 679, 680, 681, 682]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 1071 ms to find 49 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 692/2124 places, 1302/2581 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 692 transition count 1215
Reduce places removed 87 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 88 rules applied. Total rules applied 175 place count 605 transition count 1214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 176 place count 604 transition count 1214
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 176 place count 604 transition count 1187
Deduced a syphon composed of 27 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 231 place count 576 transition count 1187
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 243 place count 572 transition count 1179
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 251 place count 564 transition count 1179
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 254 place count 561 transition count 1176
Iterating global reduction 5 with 3 rules applied. Total rules applied 257 place count 561 transition count 1176
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 260 place count 561 transition count 1173
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 82 rules applied. Total rules applied 342 place count 520 transition count 1132
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 346 place count 518 transition count 1133
Applied a total of 346 rules in 89 ms. Remains 518 /692 variables (removed 174) and now considering 1133/1302 (removed 169) transitions.
// Phase 1: matrix 1133 rows 518 cols
[2024-06-12 18:24:25] [INFO ] Computed 68 invariants in 10 ms
[2024-06-12 18:24:26] [INFO ] Implicit Places using invariants in 717 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 273, 351, 357, 362, 439, 445, 450, 515]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 719 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 502/2124 places, 1133/2581 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 0 with 1 rules applied. Total rules applied 1 place count 502 transition count 1132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 501 transition count 1132
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 12 place count 491 transition count 1122
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 491 transition count 1122
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 32 place count 481 transition count 1112
Iterating global reduction 2 with 10 rules applied. Total rules applied 42 place count 481 transition count 1112
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 476 transition count 1107
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 476 transition count 1107
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 62 place count 471 transition count 1102
Applied a total of 62 rules in 73 ms. Remains 471 /502 variables (removed 31) and now considering 1102/1133 (removed 31) transitions.
// Phase 1: matrix 1102 rows 471 cols
[2024-06-12 18:24:26] [INFO ] Computed 52 invariants in 9 ms
[2024-06-12 18:24:26] [INFO ] Implicit Places using invariants in 494 ms returned []
[2024-06-12 18:24:26] [INFO ] Invariant cache hit.
[2024-06-12 18:24:28] [INFO ] Implicit Places using invariants and state equation in 1385 ms returned []
Implicit Place search using SMT with State Equation took 1918 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 471/2124 places, 1102/2581 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4332 ms. Remains : 471/2124 places, 1102/2581 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-05b-LTLCardinality-09
Product exploration explored 100000 steps with 1411 reset in 277 ms.
Product exploration explored 100000 steps with 1429 reset in 271 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (601 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (131 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 331161 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 1
Probabilistic random walk after 331161 steps, saw 110941 distinct states, run finished after 3004 ms. (steps per millisecond=110 ) properties seen :0
[2024-06-12 18:24:32] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 113/115 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/131 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 255/386 variables, 27/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/420 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 51/471 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1102/1573 variables, 471/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1573 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1573 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1573/1573 variables, and 523 constraints, problems are : Problem set: 0 solved, 1 unsolved in 531 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 113/115 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/131 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 255/386 variables, 27/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/420 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 51/471 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1102/1573 variables, 471/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1573 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1573/1573 variables, and 524 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1928 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2496ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 471 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 471/471 places, 1102/1102 transitions.
Free-agglomeration rule applied 25 times.
Iterating global reduction 0 with 25 rules applied. Total rules applied 25 place count 471 transition count 1077
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 55 place count 446 transition count 1072
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 1 with 14 rules applied. Total rules applied 69 place count 446 transition count 1058
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 83 place count 432 transition count 1058
Applied a total of 83 rules in 54 ms. Remains 432 /471 variables (removed 39) and now considering 1058/1102 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 432/471 places, 1058/1102 transitions.
RANDOM walk for 40000 steps (724 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (175 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 354054 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :0 out of 1
Probabilistic random walk after 354054 steps, saw 98789 distinct states, run finished after 3004 ms. (steps per millisecond=117 ) properties seen :0
// Phase 1: matrix 1058 rows 432 cols
[2024-06-12 18:24:37] [INFO ] Computed 52 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 93/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/106 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 194/300 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/326 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/399 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 22/421 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/421 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/432 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/432 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1058/1490 variables, 432/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1490 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1490 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1490/1490 variables, and 484 constraints, problems are : Problem set: 0 solved, 1 unsolved in 768 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 432/432 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 93/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/106 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 194/300 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/326 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/399 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 22/421 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-12 18:24:38] [INFO ] Deduced a trap composed of 54 places in 192 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/421 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/421 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/432 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/432 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1058/1490 variables, 432/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1490 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1490 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1490 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1490/1490 variables, and 486 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8558 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 432/432 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 9350ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 308 ms.
Support contains 2 out of 432 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 432/432 places, 1058/1058 transitions.
Applied a total of 0 rules in 15 ms. Remains 432 /432 variables (removed 0) and now considering 1058/1058 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 432/432 places, 1058/1058 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 432/432 places, 1058/1058 transitions.
Applied a total of 0 rules in 15 ms. Remains 432 /432 variables (removed 0) and now considering 1058/1058 (removed 0) transitions.
[2024-06-12 18:24:47] [INFO ] Invariant cache hit.
[2024-06-12 18:24:48] [INFO ] Implicit Places using invariants in 591 ms returned [88, 89, 159, 160, 230, 231, 302, 303]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 593 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 424/432 places, 1058/1058 transitions.
Applied a total of 0 rules in 15 ms. Remains 424 /424 variables (removed 0) and now considering 1058/1058 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 624 ms. Remains : 424/432 places, 1058/1058 transitions.
RANDOM walk for 40000 steps (777 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (179 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 361040 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 1
Probabilistic random walk after 361040 steps, saw 101198 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
// Phase 1: matrix 1058 rows 424 cols
[2024-06-12 18:24:51] [INFO ] Computed 44 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 115/117 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/129 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 201/330 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/364 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 52/416 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/424 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1058/1482 variables, 424/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1482 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1482 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1482/1482 variables, and 468 constraints, problems are : Problem set: 0 solved, 1 unsolved in 669 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 115/117 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/129 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 201/330 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/364 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 52/416 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/424 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1058/1482 variables, 424/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1482 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1482 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1482 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1482/1482 variables, and 469 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6561 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 7261ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 339 ms.
Support contains 2 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 1058/1058 transitions.
Applied a total of 0 rules in 14 ms. Remains 424 /424 variables (removed 0) and now considering 1058/1058 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 424/424 places, 1058/1058 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 1058/1058 transitions.
Applied a total of 0 rules in 15 ms. Remains 424 /424 variables (removed 0) and now considering 1058/1058 (removed 0) transitions.
[2024-06-12 18:24:58] [INFO ] Invariant cache hit.
[2024-06-12 18:24:59] [INFO ] Implicit Places using invariants in 448 ms returned []
[2024-06-12 18:24:59] [INFO ] Invariant cache hit.
[2024-06-12 18:25:00] [INFO ] Implicit Places using invariants and state equation in 1158 ms returned []
Implicit Place search using SMT with State Equation took 1634 ms to find 0 implicit places.
[2024-06-12 18:25:00] [INFO ] Redundant transitions in 18 ms returned []
Running 1029 sub problems to find dead transitions.
[2024-06-12 18:25:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 31/38 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.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 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1/424 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
SMT process timed out in 30646ms, After SMT, problems are : Problem set: 0 solved, 1029 unsolved
Search for dead transitions found 0 dead transitions in 30658ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32334 ms. Remains : 424/424 places, 1058/1058 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 16 ms. Remains 424 /424 variables (removed 0) and now considering 1058/1058 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-12 18:25:31] [INFO ] Invariant cache hit.
[2024-06-12 18:25:31] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-12 18:25:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-06-12 18:25:31] [INFO ] [Nat]Absence check using 10 positive and 34 generalized place invariants in 25 ms returned sat
[2024-06-12 18:25:33] [INFO ] After 1792ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-12 18:25:33] [INFO ] After 1859ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-12 18:25:36] [INFO ] After 4953ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 5074 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 471 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 471/471 places, 1102/1102 transitions.
Applied a total of 0 rules in 16 ms. Remains 471 /471 variables (removed 0) and now considering 1102/1102 (removed 0) transitions.
// Phase 1: matrix 1102 rows 471 cols
[2024-06-12 18:25:36] [INFO ] Computed 52 invariants in 13 ms
[2024-06-12 18:25:36] [INFO ] Implicit Places using invariants in 484 ms returned []
[2024-06-12 18:25:36] [INFO ] Invariant cache hit.
[2024-06-12 18:25:38] [INFO ] Implicit Places using invariants and state equation in 1334 ms returned []
Implicit Place search using SMT with State Equation took 1833 ms to find 0 implicit places.
[2024-06-12 18:25:38] [INFO ] Redundant transitions in 19 ms returned []
Running 1063 sub problems to find dead transitions.
[2024-06-12 18:25:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1063 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 1063 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1063 unsolved
At refinement iteration 3 (OVERLAPS) 2/467 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 1063 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 1063 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 467/1573 variables, and 39 constraints, problems are : Problem set: 0 solved, 1063 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 29/42 constraints, State Equation: 0/471 constraints, PredecessorRefiner: 1063/1063 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1063 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1063 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 1063 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1063 unsolved
At refinement iteration 3 (OVERLAPS) 2/467 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 1063 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 1063 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1063 unsolved
At refinement iteration 6 (OVERLAPS) 4/471 variables, 13/52 constraints. Problems are: Problem set: 0 solved, 1063 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 1)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 471/1573 variables, and 52 constraints, problems are : Problem set: 0 solved, 1063 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/471 constraints, PredecessorRefiner: 0/1063 constraints, Known Traps: 0/0 constraints]
After SMT, in 60645ms problems are : Problem set: 0 solved, 1063 unsolved
Search for dead transitions found 0 dead transitions in 60656ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62532 ms. Remains : 471/471 places, 1102/1102 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 149 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 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (549 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (138 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 334200 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 1
Probabilistic random walk after 334200 steps, saw 111680 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
[2024-06-12 18:26:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 113/115 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/131 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 255/386 variables, 27/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/420 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 51/471 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1102/1573 variables, 471/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1573 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1573 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1573/1573 variables, and 523 constraints, problems are : Problem set: 0 solved, 1 unsolved in 539 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 113/115 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 16/131 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 255/386 variables, 27/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/420 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 51/471 variables, 10/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1102/1573 variables, 471/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1573 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1573/1573 variables, and 524 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1953 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 471/471 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2529ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 471 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 471/471 places, 1102/1102 transitions.
Free-agglomeration rule applied 25 times.
Iterating global reduction 0 with 25 rules applied. Total rules applied 25 place count 471 transition count 1077
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 55 place count 446 transition count 1072
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 1 with 14 rules applied. Total rules applied 69 place count 446 transition count 1058
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 83 place count 432 transition count 1058
Applied a total of 83 rules in 53 ms. Remains 432 /471 variables (removed 39) and now considering 1058/1102 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 432/471 places, 1058/1102 transitions.
RANDOM walk for 40000 steps (746 resets) in 214 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (181 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 355148 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :0 out of 1
Probabilistic random walk after 355148 steps, saw 99062 distinct states, run finished after 3003 ms. (steps per millisecond=118 ) properties seen :0
// Phase 1: matrix 1058 rows 432 cols
[2024-06-12 18:26:47] [INFO ] Computed 52 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 93/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/106 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 194/300 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/326 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/399 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 22/421 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/421 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/432 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/432 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1058/1490 variables, 432/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1490 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1490 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1490/1490 variables, and 484 constraints, problems are : Problem set: 0 solved, 1 unsolved in 707 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 432/432 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 93/95 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/106 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 194/300 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/326 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/326 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/399 variables, 9/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 22/421 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-12 18:26:49] [INFO ] Deduced a trap composed of 54 places in 199 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/421 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/421 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/432 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/432 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1058/1490 variables, 432/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1490 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1490 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1490 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1490/1490 variables, and 486 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8925 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 432/432 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 9664ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 287 ms.
Support contains 2 out of 432 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 432/432 places, 1058/1058 transitions.
Applied a total of 0 rules in 15 ms. Remains 432 /432 variables (removed 0) and now considering 1058/1058 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 432/432 places, 1058/1058 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 432/432 places, 1058/1058 transitions.
Applied a total of 0 rules in 15 ms. Remains 432 /432 variables (removed 0) and now considering 1058/1058 (removed 0) transitions.
[2024-06-12 18:26:57] [INFO ] Invariant cache hit.
[2024-06-12 18:26:58] [INFO ] Implicit Places using invariants in 508 ms returned [88, 89, 159, 160, 230, 231, 302, 303]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 525 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 424/432 places, 1058/1058 transitions.
Applied a total of 0 rules in 15 ms. Remains 424 /424 variables (removed 0) and now considering 1058/1058 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 555 ms. Remains : 424/432 places, 1058/1058 transitions.
RANDOM walk for 40000 steps (742 resets) in 221 ms. (180 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (180 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 362737 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 1
Probabilistic random walk after 362737 steps, saw 101757 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
// Phase 1: matrix 1058 rows 424 cols
[2024-06-12 18:27:01] [INFO ] Computed 44 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 115/117 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/129 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 201/330 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/364 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 52/416 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/424 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1058/1482 variables, 424/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1482 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1482 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1482/1482 variables, and 468 constraints, problems are : Problem set: 0 solved, 1 unsolved in 657 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 115/117 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/129 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 201/330 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/330 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 34/364 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 52/416 variables, 10/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/424 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/424 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1058/1482 variables, 424/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1482 variables, 1/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1482 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1482 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1482/1482 variables, and 469 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6484 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 7173ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 301 ms.
Support contains 2 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 1058/1058 transitions.
Applied a total of 0 rules in 14 ms. Remains 424 /424 variables (removed 0) and now considering 1058/1058 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 424/424 places, 1058/1058 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 1058/1058 transitions.
Applied a total of 0 rules in 14 ms. Remains 424 /424 variables (removed 0) and now considering 1058/1058 (removed 0) transitions.
[2024-06-12 18:27:09] [INFO ] Invariant cache hit.
[2024-06-12 18:27:09] [INFO ] Implicit Places using invariants in 452 ms returned []
[2024-06-12 18:27:09] [INFO ] Invariant cache hit.
[2024-06-12 18:27:10] [INFO ] Implicit Places using invariants and state equation in 1115 ms returned []
Implicit Place search using SMT with State Equation took 1601 ms to find 0 implicit places.
[2024-06-12 18:27:10] [INFO ] Redundant transitions in 19 ms returned []
Running 1029 sub problems to find dead transitions.
[2024-06-12 18:27:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 31/38 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
At refinement iteration 3 (OVERLAPS) 1/424 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
SMT process timed out in 30603ms, After SMT, problems are : Problem set: 0 solved, 1029 unsolved
Search for dead transitions found 0 dead transitions in 30615ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32256 ms. Remains : 424/424 places, 1058/1058 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 15 ms. Remains 424 /424 variables (removed 0) and now considering 1058/1058 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-12 18:27:41] [INFO ] Invariant cache hit.
[2024-06-12 18:27:41] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-12 18:27:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-12 18:27:41] [INFO ] [Nat]Absence check using 10 positive and 34 generalized place invariants in 20 ms returned sat
[2024-06-12 18:27:43] [INFO ] After 1766ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-12 18:27:43] [INFO ] After 1826ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-12 18:27:46] [INFO ] After 4929ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 5065 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1432 reset in 240 ms.
Product exploration explored 100000 steps with 1397 reset in 272 ms.
Support contains 2 out of 471 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 471/471 places, 1102/1102 transitions.
Applied a total of 0 rules in 16 ms. Remains 471 /471 variables (removed 0) and now considering 1102/1102 (removed 0) transitions.
// Phase 1: matrix 1102 rows 471 cols
[2024-06-12 18:27:47] [INFO ] Computed 52 invariants in 9 ms
[2024-06-12 18:27:47] [INFO ] Implicit Places using invariants in 486 ms returned []
[2024-06-12 18:27:47] [INFO ] Invariant cache hit.
[2024-06-12 18:27:49] [INFO ] Implicit Places using invariants and state equation in 1332 ms returned []
Implicit Place search using SMT with State Equation took 1858 ms to find 0 implicit places.
[2024-06-12 18:27:49] [INFO ] Redundant transitions in 19 ms returned []
Running 1063 sub problems to find dead transitions.
[2024-06-12 18:27:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1063 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 1063 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1063 unsolved
At refinement iteration 3 (OVERLAPS) 2/467 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 1063 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 1063 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 467/1573 variables, and 39 constraints, problems are : Problem set: 0 solved, 1063 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 29/42 constraints, State Equation: 0/471 constraints, PredecessorRefiner: 1063/1063 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1063 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1063 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 1063 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1063 unsolved
At refinement iteration 3 (OVERLAPS) 2/467 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 1063 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 1063 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1063 unsolved
At refinement iteration 6 (OVERLAPS) 4/471 variables, 13/52 constraints. Problems are: Problem set: 0 solved, 1063 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 1)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 1)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 1)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 1)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 1)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 1)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 1)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 1)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 1)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 1)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 1)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 1)
(s418 0)
(s419 0)
(s420 1)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 471/1573 variables, and 52 constraints, problems are : Problem set: 0 solved, 1063 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/471 constraints, PredecessorRefiner: 0/1063 constraints, Known Traps: 0/0 constraints]
After SMT, in 60635ms problems are : Problem set: 0 solved, 1063 unsolved
Search for dead transitions found 0 dead transitions in 60646ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62554 ms. Remains : 471/471 places, 1102/1102 transitions.
Treatment of property ASLink-PT-05b-LTLCardinality-09 finished in 265982 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 2124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2124/2124 places, 2581/2581 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 390 transitions
Trivial Post-agglo rules discarded 390 transitions
Performed 390 trivial Post agglomeration. Transition count delta: 390
Iterating post reduction 0 with 390 rules applied. Total rules applied 390 place count 2123 transition count 2190
Reduce places removed 390 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 393 rules applied. Total rules applied 783 place count 1733 transition count 2187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 785 place count 1731 transition count 2187
Performed 575 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 575 Pre rules applied. Total rules applied 785 place count 1731 transition count 1612
Deduced a syphon composed of 575 places in 4 ms
Ensure Unique test removed 54 places
Reduce places removed 629 places and 0 transitions.
Iterating global reduction 3 with 1204 rules applied. Total rules applied 1989 place count 1102 transition count 1612
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 3 with 39 rules applied. Total rules applied 2028 place count 1097 transition count 1578
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 4 with 34 rules applied. Total rules applied 2062 place count 1063 transition count 1578
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 2062 place count 1063 transition count 1557
Deduced a syphon composed of 21 places in 3 ms
Ensure Unique test removed 21 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 63 rules applied. Total rules applied 2125 place count 1021 transition count 1557
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 2125 place count 1021 transition count 1537
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 2165 place count 1001 transition count 1537
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 171 places and 0 transitions.
Iterating global reduction 5 with 340 rules applied. Total rules applied 2505 place count 830 transition count 1368
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2509 place count 826 transition count 1364
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2514 place count 825 transition count 1364
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 5 with 1 rules applied. Total rules applied 2515 place count 825 transition count 1363
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2516 place count 824 transition count 1363
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2516 place count 824 transition count 1362
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2518 place count 823 transition count 1362
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2520 place count 821 transition count 1360
Iterating global reduction 7 with 2 rules applied. Total rules applied 2522 place count 821 transition count 1360
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 7 with 2 rules applied. Total rules applied 2524 place count 821 transition count 1358
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2525 place count 820 transition count 1358
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2527 place count 819 transition count 1363
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2529 place count 817 transition count 1361
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 9 with 15 rules applied. Total rules applied 2544 place count 807 transition count 1356
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 2549 place count 802 transition count 1356
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 15 Pre rules applied. Total rules applied 2549 place count 802 transition count 1341
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 11 with 31 rules applied. Total rules applied 2580 place count 786 transition count 1341
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 11 with 11 rules applied. Total rules applied 2591 place count 775 transition count 1341
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 2591 place count 775 transition count 1340
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 2593 place count 774 transition count 1340
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 12 with 32 rules applied. Total rules applied 2625 place count 758 transition count 1324
Discarding 10 places :
Symmetric choice reduction at 12 with 10 rule applications. Total rules 2635 place count 748 transition count 1314
Iterating global reduction 12 with 10 rules applied. Total rules applied 2645 place count 748 transition count 1314
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 2650 place count 743 transition count 1309
Iterating global reduction 12 with 5 rules applied. Total rules applied 2655 place count 743 transition count 1309
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 12 with 5 rules applied. Total rules applied 2660 place count 743 transition count 1304
Applied a total of 2660 rules in 441 ms. Remains 743 /2124 variables (removed 1381) and now considering 1304/2581 (removed 1277) transitions.
// Phase 1: matrix 1304 rows 743 cols
[2024-06-12 18:28:50] [INFO ] Computed 122 invariants in 14 ms
[2024-06-12 18:28:51] [INFO ] Implicit Places using invariants in 897 ms returned [1, 18, 19, 31, 48, 66, 86, 137, 147, 148, 150, 167, 185, 205, 257, 258, 270, 271, 273, 290, 308, 328, 379, 380, 392, 393, 395, 412, 430, 450, 501, 502, 514, 515, 517, 534, 552, 573, 625, 626, 629, 640, 641, 642, 660, 681, 682, 683, 684]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 902 ms to find 49 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 694/2124 places, 1304/2581 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 88 place count 694 transition count 1216
Reduce places removed 88 places and 0 transitions.
Iterating post reduction 1 with 88 rules applied. Total rules applied 176 place count 606 transition count 1216
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 176 place count 606 transition count 1189
Deduced a syphon composed of 27 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 55 rules applied. Total rules applied 231 place count 578 transition count 1189
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 243 place count 574 transition count 1181
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 251 place count 566 transition count 1181
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 254 place count 563 transition count 1178
Iterating global reduction 4 with 3 rules applied. Total rules applied 257 place count 563 transition count 1178
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 260 place count 563 transition count 1175
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 342 place count 522 transition count 1134
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 346 place count 520 transition count 1135
Applied a total of 346 rules in 109 ms. Remains 520 /694 variables (removed 174) and now considering 1135/1304 (removed 169) transitions.
// Phase 1: matrix 1135 rows 520 cols
[2024-06-12 18:28:51] [INFO ] Computed 68 invariants in 10 ms
[2024-06-12 18:28:51] [INFO ] Implicit Places using invariants in 697 ms returned [88, 94, 99, 174, 180, 186, 263, 269, 274, 351, 357, 362, 441, 447, 452, 517]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 702 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 504/2124 places, 1135/2581 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 0 with 1 rules applied. Total rules applied 1 place count 504 transition count 1134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 503 transition count 1134
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 12 place count 493 transition count 1124
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 493 transition count 1124
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 31 place count 484 transition count 1115
Iterating global reduction 2 with 9 rules applied. Total rules applied 40 place count 484 transition count 1115
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 45 place count 479 transition count 1110
Iterating global reduction 2 with 5 rules applied. Total rules applied 50 place count 479 transition count 1110
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 60 place count 474 transition count 1105
Applied a total of 60 rules in 75 ms. Remains 474 /504 variables (removed 30) and now considering 1105/1135 (removed 30) transitions.
// Phase 1: matrix 1105 rows 474 cols
[2024-06-12 18:28:52] [INFO ] Computed 52 invariants in 8 ms
[2024-06-12 18:28:52] [INFO ] Implicit Places using invariants in 509 ms returned []
[2024-06-12 18:28:52] [INFO ] Invariant cache hit.
[2024-06-12 18:28:53] [INFO ] Implicit Places using invariants and state equation in 1297 ms returned []
Implicit Place search using SMT with State Equation took 1822 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 474/2124 places, 1105/2581 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4055 ms. Remains : 474/2124 places, 1105/2581 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-05b-LTLCardinality-11
Stuttering criterion allowed to conclude after 96 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-05b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLCardinality-11 finished in 4112 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))'
Support contains 3 out of 2124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2124/2124 places, 2581/2581 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 389 transitions
Trivial Post-agglo rules discarded 389 transitions
Performed 389 trivial Post agglomeration. Transition count delta: 389
Iterating post reduction 0 with 389 rules applied. Total rules applied 389 place count 2123 transition count 2191
Reduce places removed 389 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 392 rules applied. Total rules applied 781 place count 1734 transition count 2188
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 784 place count 1732 transition count 2187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 785 place count 1731 transition count 2187
Performed 573 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 573 Pre rules applied. Total rules applied 785 place count 1731 transition count 1614
Deduced a syphon composed of 573 places in 3 ms
Ensure Unique test removed 54 places
Reduce places removed 627 places and 0 transitions.
Iterating global reduction 4 with 1200 rules applied. Total rules applied 1985 place count 1104 transition count 1614
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 4 with 38 rules applied. Total rules applied 2023 place count 1100 transition count 1580
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 5 with 34 rules applied. Total rules applied 2057 place count 1066 transition count 1580
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 21 Pre rules applied. Total rules applied 2057 place count 1066 transition count 1559
Deduced a syphon composed of 21 places in 4 ms
Ensure Unique test removed 20 places
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 6 with 62 rules applied. Total rules applied 2119 place count 1025 transition count 1559
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 19 Pre rules applied. Total rules applied 2119 place count 1025 transition count 1540
Deduced a syphon composed of 19 places in 3 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 6 with 38 rules applied. Total rules applied 2157 place count 1006 transition count 1540
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 6 with 342 rules applied. Total rules applied 2499 place count 834 transition count 1370
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2503 place count 830 transition count 1366
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2508 place count 829 transition count 1366
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 6 with 1 rules applied. Total rules applied 2509 place count 829 transition count 1365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2510 place count 828 transition count 1365
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2510 place count 828 transition count 1364
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2512 place count 827 transition count 1364
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2514 place count 825 transition count 1362
Iterating global reduction 8 with 2 rules applied. Total rules applied 2516 place count 825 transition count 1362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 8 with 2 rules applied. Total rules applied 2518 place count 825 transition count 1360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2519 place count 824 transition count 1360
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2521 place count 823 transition count 1365
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2523 place count 821 transition count 1363
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 10 with 15 rules applied. Total rules applied 2538 place count 811 transition count 1358
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 2543 place count 806 transition count 1358
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 15 Pre rules applied. Total rules applied 2543 place count 806 transition count 1343
Deduced a syphon composed of 15 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 12 with 31 rules applied. Total rules applied 2574 place count 790 transition count 1343
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 12 with 11 rules applied. Total rules applied 2585 place count 779 transition count 1343
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 2585 place count 779 transition count 1342
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 2587 place count 778 transition count 1342
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 13 with 32 rules applied. Total rules applied 2619 place count 762 transition count 1326
Discarding 10 places :
Symmetric choice reduction at 13 with 10 rule applications. Total rules 2629 place count 752 transition count 1316
Iterating global reduction 13 with 10 rules applied. Total rules applied 2639 place count 752 transition count 1316
Discarding 5 places :
Symmetric choice reduction at 13 with 5 rule applications. Total rules 2644 place count 747 transition count 1311
Iterating global reduction 13 with 5 rules applied. Total rules applied 2649 place count 747 transition count 1311
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 2654 place count 747 transition count 1306
Applied a total of 2654 rules in 507 ms. Remains 747 /2124 variables (removed 1377) and now considering 1306/2581 (removed 1275) transitions.
// Phase 1: matrix 1306 rows 747 cols
[2024-06-12 18:28:54] [INFO ] Computed 124 invariants in 15 ms
[2024-06-12 18:28:55] [INFO ] Implicit Places using invariants in 868 ms returned [1, 18, 19, 31, 48, 66, 86, 116, 140, 153, 154, 156, 173, 191, 211, 262, 263, 275, 276, 278, 295, 313, 333, 384, 385, 397, 398, 400, 417, 435, 456, 507, 508, 520, 521, 523, 540, 558, 578, 629, 630, 633, 644, 645, 646, 664, 685, 686, 687, 688]
[2024-06-12 18:28:55] [INFO ] Actually due to overlaps returned [664, 646, 48, 173, 295, 417, 540, 31, 153, 156, 275, 278, 397, 400, 520, 523, 644, 685, 154, 276, 398, 521, 645, 686, 1, 18, 262, 263, 384, 385, 507, 508, 629, 630, 687, 19, 66, 86, 140, 191, 211, 313, 333, 435, 456, 558, 578, 633, 688]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 880 ms to find 49 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 698/2124 places, 1306/2581 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 697 transition count 1220
Reduce places removed 86 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 87 rules applied. Total rules applied 174 place count 611 transition count 1219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 175 place count 610 transition count 1219
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 175 place count 610 transition count 1192
Deduced a syphon composed of 27 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 230 place count 582 transition count 1192
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 242 place count 578 transition count 1184
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 250 place count 570 transition count 1184
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 253 place count 567 transition count 1181
Iterating global reduction 5 with 3 rules applied. Total rules applied 256 place count 567 transition count 1181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 259 place count 567 transition count 1178
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 84 rules applied. Total rules applied 343 place count 525 transition count 1136
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 347 place count 523 transition count 1137
Applied a total of 347 rules in 86 ms. Remains 523 /698 variables (removed 175) and now considering 1137/1306 (removed 169) transitions.
// Phase 1: matrix 1137 rows 523 cols
[2024-06-12 18:28:55] [INFO ] Computed 69 invariants in 9 ms
[2024-06-12 18:28:56] [INFO ] Implicit Places using invariants in 657 ms returned [96, 101, 179, 185, 190, 267, 273, 278, 356, 362, 367, 444, 450, 455, 520]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 659 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 508/2124 places, 1137/2581 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 0 with 1 rules applied. Total rules applied 1 place count 508 transition count 1136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 507 transition count 1136
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 10 place count 499 transition count 1128
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 499 transition count 1128
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 26 place count 491 transition count 1120
Iterating global reduction 2 with 8 rules applied. Total rules applied 34 place count 491 transition count 1120
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 37 place count 488 transition count 1117
Iterating global reduction 2 with 3 rules applied. Total rules applied 40 place count 488 transition count 1117
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 50 place count 483 transition count 1112
Applied a total of 50 rules in 73 ms. Remains 483 /508 variables (removed 25) and now considering 1112/1137 (removed 25) transitions.
// Phase 1: matrix 1112 rows 483 cols
[2024-06-12 18:28:56] [INFO ] Computed 54 invariants in 11 ms
[2024-06-12 18:28:56] [INFO ] Implicit Places using invariants in 494 ms returned []
[2024-06-12 18:28:56] [INFO ] Invariant cache hit.
[2024-06-12 18:28:57] [INFO ] Implicit Places using invariants and state equation in 1246 ms returned []
Implicit Place search using SMT with State Equation took 1767 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 483/2124 places, 1112/2581 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3972 ms. Remains : 483/2124 places, 1112/2581 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-05b-LTLCardinality-12
Stuttering criterion allowed to conclude after 72 steps with 1 reset in 0 ms.
FORMULA ASLink-PT-05b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLCardinality-12 finished in 4030 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 3 out of 2124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2124/2124 places, 2581/2581 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2121 transition count 2578
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2121 transition count 2578
Applied a total of 6 rules in 272 ms. Remains 2121 /2124 variables (removed 3) and now considering 2578/2581 (removed 3) transitions.
// Phase 1: matrix 2578 rows 2121 cols
[2024-06-12 18:28:58] [INFO ] Computed 227 invariants in 31 ms
[2024-06-12 18:28:59] [INFO ] Implicit Places using invariants in 1479 ms returned []
[2024-06-12 18:28:59] [INFO ] Invariant cache hit.
[2024-06-12 18:29:18] [INFO ] Implicit Places using invariants and state equation in 18683 ms returned []
Implicit Place search using SMT with State Equation took 20184 ms to find 0 implicit places.
Running 2577 sub problems to find dead transitions.
[2024-06-12 18:29:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 2577/2577 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2577 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2120 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 2577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2120/4699 variables, and 131 constraints, problems are : Problem set: 0 solved, 2577 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 0/54 constraints, Generalized P Invariants (flows): 131/173 constraints, State Equation: 0/2121 constraints, PredecessorRefiner: 0/2577 constraints, Known Traps: 0/0 constraints]
After SMT, in 61109ms problems are : Problem set: 0 solved, 2577 unsolved
Search for dead transitions found 0 dead transitions in 61136ms
Starting structural reductions in LTL mode, iteration 1 : 2121/2124 places, 2578/2581 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81598 ms. Remains : 2121/2124 places, 2578/2581 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : ASLink-PT-05b-LTLCardinality-14
Stuttering criterion allowed to conclude after 282 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-05b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-05b-LTLCardinality-14 finished in 81718 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||X(p1)))||F(p0)) U (p1 U p2)))'
Found a Lengthening insensitive property : ASLink-PT-05b-LTLCardinality-01
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0)]
Support contains 4 out of 2124 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2124/2124 places, 2581/2581 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 389 transitions
Trivial Post-agglo rules discarded 389 transitions
Performed 389 trivial Post agglomeration. Transition count delta: 389
Iterating post reduction 0 with 389 rules applied. Total rules applied 389 place count 2123 transition count 2191
Reduce places removed 389 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 392 rules applied. Total rules applied 781 place count 1734 transition count 2188
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 784 place count 1732 transition count 2187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 785 place count 1731 transition count 2187
Performed 572 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 572 Pre rules applied. Total rules applied 785 place count 1731 transition count 1615
Deduced a syphon composed of 572 places in 4 ms
Ensure Unique test removed 53 places
Reduce places removed 625 places and 0 transitions.
Iterating global reduction 4 with 1197 rules applied. Total rules applied 1982 place count 1106 transition count 1615
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 4 with 37 rules applied. Total rules applied 2019 place count 1101 transition count 1583
Reduce places removed 32 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 34 rules applied. Total rules applied 2053 place count 1069 transition count 1581
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 2055 place count 1067 transition count 1581
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 20 Pre rules applied. Total rules applied 2055 place count 1067 transition count 1561
Deduced a syphon composed of 20 places in 3 ms
Ensure Unique test removed 20 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 60 rules applied. Total rules applied 2115 place count 1027 transition count 1561
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 19 Pre rules applied. Total rules applied 2115 place count 1027 transition count 1542
Deduced a syphon composed of 19 places in 3 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 2153 place count 1008 transition count 1542
Performed 171 Post agglomeration using F-continuation condition.Transition count delta: 171
Deduced a syphon composed of 171 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 174 places and 0 transitions.
Iterating global reduction 7 with 345 rules applied. Total rules applied 2498 place count 834 transition count 1371
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2502 place count 830 transition count 1367
Ensure Unique test removed 1 places
Iterating global reduction 7 with 5 rules applied. Total rules applied 2507 place count 829 transition count 1367
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 7 with 1 rules applied. Total rules applied 2508 place count 829 transition count 1366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2509 place count 828 transition count 1366
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 2509 place count 828 transition count 1365
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2511 place count 827 transition count 1365
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 2513 place count 825 transition count 1363
Iterating global reduction 9 with 2 rules applied. Total rules applied 2515 place count 825 transition count 1363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 9 with 2 rules applied. Total rules applied 2517 place count 825 transition count 1361
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2518 place count 824 transition count 1361
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 2520 place count 823 transition count 1366
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 2522 place count 821 transition count 1364
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 11 with 13 rules applied. Total rules applied 2535 place count 812 transition count 1360
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 2539 place count 808 transition count 1360
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 14 Pre rules applied. Total rules applied 2539 place count 808 transition count 1346
Deduced a syphon composed of 14 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 13 with 29 rules applied. Total rules applied 2568 place count 793 transition count 1346
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 13 with 10 rules applied. Total rules applied 2578 place count 783 transition count 1346
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 2578 place count 783 transition count 1345
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 2580 place count 782 transition count 1345
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 14 with 30 rules applied. Total rules applied 2610 place count 767 transition count 1330
Discarding 9 places :
Symmetric choice reduction at 14 with 9 rule applications. Total rules 2619 place count 758 transition count 1321
Iterating global reduction 14 with 9 rules applied. Total rules applied 2628 place count 758 transition count 1321
Discarding 5 places :
Symmetric choice reduction at 14 with 5 rule applications. Total rules 2633 place count 753 transition count 1316
Iterating global reduction 14 with 5 rules applied. Total rules applied 2638 place count 753 transition count 1316
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 14 with 5 rules applied. Total rules applied 2643 place count 753 transition count 1311
Applied a total of 2643 rules in 512 ms. Remains 753 /2124 variables (removed 1371) and now considering 1311/2581 (removed 1270) transitions.
// Phase 1: matrix 1311 rows 753 cols
[2024-06-12 18:30:20] [INFO ] Computed 125 invariants in 14 ms
[2024-06-12 18:30:21] [INFO ] Implicit Places using invariants in 1041 ms returned [1, 18, 19, 31, 48, 66, 86, 105, 140, 150, 151, 153, 170, 188, 209, 264, 265, 279, 280, 282, 299, 317, 337, 388, 389, 401, 402, 406, 423, 441, 461, 513, 525, 526, 528, 545, 563, 583, 634, 635, 638, 649, 650, 651, 669, 690, 691, 692, 693]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 1049 ms to find 49 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 704/2124 places, 1311/2581 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 704 transition count 1224
Reduce places removed 87 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 88 rules applied. Total rules applied 175 place count 617 transition count 1223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 176 place count 616 transition count 1223
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 176 place count 616 transition count 1196
Deduced a syphon composed of 27 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 231 place count 588 transition count 1196
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 11 rules applied. Total rules applied 242 place count 584 transition count 1189
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 249 place count 577 transition count 1189
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 251 place count 575 transition count 1187
Iterating global reduction 5 with 2 rules applied. Total rules applied 253 place count 575 transition count 1187
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 255 place count 575 transition count 1185
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 3 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 6 with 78 rules applied. Total rules applied 333 place count 536 transition count 1146
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 337 place count 534 transition count 1147
Applied a total of 337 rules in 123 ms. Remains 534 /704 variables (removed 170) and now considering 1147/1311 (removed 164) transitions.
// Phase 1: matrix 1147 rows 534 cols
[2024-06-12 18:30:21] [INFO ] Computed 71 invariants in 14 ms
[2024-06-12 18:30:22] [INFO ] Implicit Places using invariants in 685 ms returned [90, 96, 101, 177, 183, 188, 270, 276, 281, 363, 369, 374, 452, 458, 463, 531]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 686 ms to find 16 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 518/2124 places, 1147/2581 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 0 with 1 rules applied. Total rules applied 1 place count 518 transition count 1146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 517 transition count 1146
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 12 place count 507 transition count 1136
Iterating global reduction 2 with 10 rules applied. Total rules applied 22 place count 507 transition count 1136
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 32 place count 497 transition count 1126
Iterating global reduction 2 with 10 rules applied. Total rules applied 42 place count 497 transition count 1126
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 492 transition count 1121
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 492 transition count 1121
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 62 place count 487 transition count 1116
Applied a total of 62 rules in 79 ms. Remains 487 /518 variables (removed 31) and now considering 1116/1147 (removed 31) transitions.
// Phase 1: matrix 1116 rows 487 cols
[2024-06-12 18:30:22] [INFO ] Computed 55 invariants in 9 ms
[2024-06-12 18:30:23] [INFO ] Implicit Places using invariants in 660 ms returned []
[2024-06-12 18:30:23] [INFO ] Invariant cache hit.
[2024-06-12 18:30:24] [INFO ] Implicit Places using invariants and state equation in 1328 ms returned []
Implicit Place search using SMT with State Equation took 1995 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 487/2124 places, 1116/2581 transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 4445 ms. Remains : 487/2124 places, 1116/2581 transitions.
Running random walk in product with property : ASLink-PT-05b-LTLCardinality-01
Product exploration explored 100000 steps with 34068 reset in 383 ms.
Product exploration explored 100000 steps with 34159 reset in 416 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (AND (NOT p2) p1 (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT p2)), (X p2), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 11 factoid took 411 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 40000 steps (538 resets) in 191 ms. (208 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40003 steps (112 resets) in 70 ms. (563 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (123 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
[2024-06-12 18:30:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 103/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/122 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 243/365 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/391 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 58/449 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 23/472 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/485 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/485 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1115/1600 variables, 485/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1600 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/1603 variables, 2/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1603 variables, 1/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1603 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1603 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1603/1603 variables, and 542 constraints, problems are : Problem set: 0 solved, 1 unsolved in 859 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 103/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/122 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 243/365 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/391 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 58/449 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 23/472 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/485 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/485 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1115/1600 variables, 485/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1600 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1600 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/1603 variables, 2/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1603 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1603 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1603 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1603/1603 variables, and 543 constraints, problems are : Problem set: 0 solved, 1 unsolved in 692 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1557ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 117 ms.
Support contains 1 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 1116/1116 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 487 transition count 1114
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 485 transition count 1114
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 485 transition count 1113
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 483 transition count 1113
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 1 rules applied. Total rules applied 8 place count 483 transition count 1112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 9 place count 482 transition count 1112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 9 place count 482 transition count 1111
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 11 place count 481 transition count 1111
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 12 place count 480 transition count 1111
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 13 place count 479 transition count 1110
Iterating global reduction 5 with 1 rules applied. Total rules applied 14 place count 479 transition count 1110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 15 place count 479 transition count 1109
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 19 place count 477 transition count 1107
Free-agglomeration rule applied 25 times.
Iterating global reduction 6 with 25 rules applied. Total rules applied 44 place count 477 transition count 1082
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 30 rules applied. Total rules applied 74 place count 452 transition count 1077
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 7 with 13 rules applied. Total rules applied 87 place count 452 transition count 1064
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 100 place count 439 transition count 1064
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 101 place count 438 transition count 1063
Applied a total of 101 rules in 129 ms. Remains 438 /487 variables (removed 49) and now considering 1063/1116 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 438/487 places, 1063/1116 transitions.
RANDOM walk for 40000 steps (709 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (170 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 332553 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :0 out of 1
Probabilistic random walk after 332553 steps, saw 92478 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
// Phase 1: matrix 1063 rows 438 cols
[2024-06-12 18:30:30] [INFO ] Computed 53 invariants in 9 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 86/87 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/101 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 250/351 variables, 27/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 40/391 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 47/438 variables, 12/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-12 18:30:31] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/438 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1063/1501 variables, 438/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1501 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1501 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1501/1501 variables, and 492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 748 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 438/438 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 86/87 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/101 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 250/351 variables, 27/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 40/391 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 47/438 variables, 12/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/438 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1063/1501 variables, 438/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1501 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1501 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1501 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1501/1501 variables, and 493 constraints, problems are : Problem set: 0 solved, 1 unsolved in 694 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 438/438 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1455ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 113 ms.
Support contains 1 out of 438 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 438/438 places, 1063/1063 transitions.
Applied a total of 0 rules in 16 ms. Remains 438 /438 variables (removed 0) and now considering 1063/1063 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 438/438 places, 1063/1063 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 438/438 places, 1063/1063 transitions.
Applied a total of 0 rules in 16 ms. Remains 438 /438 variables (removed 0) and now considering 1063/1063 (removed 0) transitions.
[2024-06-12 18:30:32] [INFO ] Invariant cache hit.
[2024-06-12 18:30:33] [INFO ] Implicit Places using invariants in 623 ms returned [90, 91, 161, 162, 303, 308, 309]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 624 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 431/438 places, 1063/1063 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 429 transition count 1061
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 429 transition count 1059
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 427 transition count 1059
Applied a total of 8 rules in 43 ms. Remains 427 /431 variables (removed 4) and now considering 1059/1063 (removed 4) transitions.
// Phase 1: matrix 1059 rows 427 cols
[2024-06-12 18:30:33] [INFO ] Computed 46 invariants in 8 ms
[2024-06-12 18:30:33] [INFO ] Implicit Places using invariants in 582 ms returned [228, 229]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 583 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 425/438 places, 1059/1063 transitions.
Applied a total of 0 rules in 16 ms. Remains 425 /425 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1282 ms. Remains : 425/438 places, 1059/1063 transitions.
RANDOM walk for 40000 steps (785 resets) in 194 ms. (205 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (175 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 345841 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 1
Probabilistic random walk after 345841 steps, saw 92896 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
// Phase 1: matrix 1059 rows 425 cols
[2024-06-12 18:30:36] [INFO ] Computed 44 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 96/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/103 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/238 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/242 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 91/333 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/350 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/350 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 51/401 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/401 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/423 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/425 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/425 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1059/1484 variables, 425/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1484 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1484 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1484/1484 variables, and 469 constraints, problems are : Problem set: 0 solved, 1 unsolved in 681 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 425/425 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 96/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/103 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/238 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/242 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 91/333 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/350 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/350 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 51/401 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/401 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/423 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/425 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-12 18:30:37] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/425 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/425 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1059/1484 variables, 425/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1484 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1484 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1484 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1484/1484 variables, and 471 constraints, problems are : Problem set: 0 solved, 1 unsolved in 806 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 425/425 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1499ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 109 ms.
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1059/1059 transitions.
Applied a total of 0 rules in 16 ms. Remains 425 /425 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 425/425 places, 1059/1059 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1059/1059 transitions.
Applied a total of 0 rules in 15 ms. Remains 425 /425 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
[2024-06-12 18:30:38] [INFO ] Invariant cache hit.
[2024-06-12 18:30:38] [INFO ] Implicit Places using invariants in 503 ms returned []
[2024-06-12 18:30:38] [INFO ] Invariant cache hit.
[2024-06-12 18:30:40] [INFO ] Implicit Places using invariants and state equation in 1222 ms returned []
Implicit Place search using SMT with State Equation took 1728 ms to find 0 implicit places.
[2024-06-12 18:30:40] [INFO ] Redundant transitions in 19 ms returned []
Running 1030 sub problems to find dead transitions.
[2024-06-12 18:30:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/424 variables, 32/40 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
(s140 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.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 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 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 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 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.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1/425 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
SMT process timed out in 30623ms, After SMT, problems are : Problem set: 0 solved, 1030 unsolved
Search for dead transitions found 0 dead transitions in 30635ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32404 ms. Remains : 425/425 places, 1059/1059 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 16 ms. Remains 425 /425 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-12 18:31:10] [INFO ] Invariant cache hit.
[2024-06-12 18:31:10] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-12 18:31:10] [INFO ] [Real]Absence check using 11 positive and 33 generalized place invariants in 20 ms returned sat
[2024-06-12 18:31:11] [INFO ] After 605ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-12 18:31:11] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-06-12 18:31:11] [INFO ] [Nat]Absence check using 11 positive and 33 generalized place invariants in 20 ms returned sat
[2024-06-12 18:31:11] [INFO ] After 454ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-12 18:31:12] [INFO ] After 513ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-12 18:31:12] [INFO ] After 674ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1307 ms.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (AND (NOT p2) p1 (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT p2)), (X p2), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p2))), (X (X p2)), (F (NOT (OR p0 p1 p2))), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F p2), (F (NOT (AND (NOT p0) p1 (NOT p2))))]
Knowledge based reduction with 11 factoid took 621 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 155 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0)]
// Phase 1: matrix 1116 rows 487 cols
[2024-06-12 18:31:13] [INFO ] Computed 55 invariants in 10 ms
[2024-06-12 18:31:13] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-06-12 18:31:14] [INFO ] [Real]Absence check using 12 positive and 43 generalized place invariants in 92 ms returned sat
[2024-06-12 18:31:16] [INFO ] [Real]Absence check using state equation in 2065 ms returned sat
[2024-06-12 18:31:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-12 18:31:17] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-06-12 18:31:17] [INFO ] [Nat]Absence check using 12 positive and 43 generalized place invariants in 48 ms returned sat
[2024-06-12 18:31:21] [INFO ] [Nat]Absence check using state equation in 4103 ms returned unknown
Could not prove EG (NOT p2)
Support contains 4 out of 487 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 1116/1116 transitions.
Applied a total of 0 rules in 10 ms. Remains 487 /487 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2024-06-12 18:31:21] [INFO ] Invariant cache hit.
[2024-06-12 18:31:21] [INFO ] Implicit Places using invariants in 516 ms returned []
[2024-06-12 18:31:21] [INFO ] Invariant cache hit.
[2024-06-12 18:31:22] [INFO ] Implicit Places using invariants and state equation in 1258 ms returned []
Implicit Place search using SMT with State Equation took 1803 ms to find 0 implicit places.
Running 1080 sub problems to find dead transitions.
[2024-06-12 18:31:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 3 (OVERLAPS) 4/484 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
SMT process timed out in 30599ms, After SMT, problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 30611ms
Finished structural reductions in LTL mode , in 1 iterations and 32428 ms. Remains : 487/487 places, 1116/1116 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p2)), (X p2), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 11 factoid took 397 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 40000 steps (531 resets) in 1245 ms. (32 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40003 steps (102 resets) in 75 ms. (526 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (128 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
[2024-06-12 18:31:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 103/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/122 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 243/365 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/391 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 58/449 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 23/472 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/485 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/485 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1115/1600 variables, 485/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1600 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/1603 variables, 2/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1603 variables, 1/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1603 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1603 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1603/1603 variables, and 542 constraints, problems are : Problem set: 0 solved, 1 unsolved in 877 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 103/104 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/122 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 243/365 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/391 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 58/449 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 23/472 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/472 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 13/485 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/485 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1115/1600 variables, 485/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1600 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1600 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/1603 variables, 2/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1603 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1603 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1603 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1603/1603 variables, and 543 constraints, problems are : Problem set: 0 solved, 1 unsolved in 717 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1602ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 114 ms.
Support contains 1 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 1116/1116 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 487 transition count 1114
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 485 transition count 1114
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 485 transition count 1113
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 7 place count 483 transition count 1113
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 1 rules applied. Total rules applied 8 place count 483 transition count 1112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 9 place count 482 transition count 1112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 9 place count 482 transition count 1111
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 11 place count 481 transition count 1111
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 12 place count 480 transition count 1111
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 13 place count 479 transition count 1110
Iterating global reduction 5 with 1 rules applied. Total rules applied 14 place count 479 transition count 1110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 15 place count 479 transition count 1109
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 19 place count 477 transition count 1107
Free-agglomeration rule applied 25 times.
Iterating global reduction 6 with 25 rules applied. Total rules applied 44 place count 477 transition count 1082
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 30 rules applied. Total rules applied 74 place count 452 transition count 1077
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 7 with 13 rules applied. Total rules applied 87 place count 452 transition count 1064
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 100 place count 439 transition count 1064
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 101 place count 438 transition count 1063
Applied a total of 101 rules in 118 ms. Remains 438 /487 variables (removed 49) and now considering 1063/1116 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 438/487 places, 1063/1116 transitions.
RANDOM walk for 40000 steps (744 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (172 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 325730 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :0 out of 1
Probabilistic random walk after 325730 steps, saw 91036 distinct states, run finished after 3001 ms. (steps per millisecond=108 ) properties seen :0
// Phase 1: matrix 1063 rows 438 cols
[2024-06-12 18:31:59] [INFO ] Computed 53 invariants in 9 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 86/87 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/101 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 250/351 variables, 27/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 40/391 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 47/438 variables, 12/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-12 18:31:59] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/438 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1063/1501 variables, 438/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1501 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1501 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1501/1501 variables, and 492 constraints, problems are : Problem set: 0 solved, 1 unsolved in 755 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 438/438 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 86/87 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/101 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 250/351 variables, 27/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 40/391 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 47/438 variables, 12/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/438 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1063/1501 variables, 438/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1501 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1501 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1501 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1501/1501 variables, and 493 constraints, problems are : Problem set: 0 solved, 1 unsolved in 700 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 438/438 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1471ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 112 ms.
Support contains 1 out of 438 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 438/438 places, 1063/1063 transitions.
Applied a total of 0 rules in 16 ms. Remains 438 /438 variables (removed 0) and now considering 1063/1063 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 438/438 places, 1063/1063 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 438/438 places, 1063/1063 transitions.
Applied a total of 0 rules in 19 ms. Remains 438 /438 variables (removed 0) and now considering 1063/1063 (removed 0) transitions.
[2024-06-12 18:32:01] [INFO ] Invariant cache hit.
[2024-06-12 18:32:01] [INFO ] Implicit Places using invariants in 556 ms returned [90, 91, 161, 162, 303, 308, 309]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 558 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 431/438 places, 1063/1063 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 429 transition count 1061
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 429 transition count 1059
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 427 transition count 1059
Applied a total of 8 rules in 44 ms. Remains 427 /431 variables (removed 4) and now considering 1059/1063 (removed 4) transitions.
// Phase 1: matrix 1059 rows 427 cols
[2024-06-12 18:32:01] [INFO ] Computed 46 invariants in 8 ms
[2024-06-12 18:32:02] [INFO ] Implicit Places using invariants in 539 ms returned [228, 229]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 541 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 425/438 places, 1059/1063 transitions.
Applied a total of 0 rules in 14 ms. Remains 425 /425 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1180 ms. Remains : 425/438 places, 1059/1063 transitions.
RANDOM walk for 40000 steps (709 resets) in 199 ms. (200 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (181 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 348006 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 1
Probabilistic random walk after 348006 steps, saw 93427 distinct states, run finished after 3004 ms. (steps per millisecond=115 ) properties seen :0
// Phase 1: matrix 1059 rows 425 cols
[2024-06-12 18:32:05] [INFO ] Computed 44 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 96/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/103 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/238 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/242 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 91/333 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/350 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/350 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 51/401 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/401 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/423 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/425 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/425 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1059/1484 variables, 425/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1484 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1484 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1484/1484 variables, and 469 constraints, problems are : Problem set: 0 solved, 1 unsolved in 656 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 425/425 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 96/97 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/103 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 135/238 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/242 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 91/333 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 17/350 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/350 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 51/401 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/401 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/423 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/423 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/425 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-12 18:32:06] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/425 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/425 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1059/1484 variables, 425/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1484 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1484 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1484 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1484/1484 variables, and 471 constraints, problems are : Problem set: 0 solved, 1 unsolved in 858 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 425/425 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1529ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 107 ms.
Support contains 1 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1059/1059 transitions.
Applied a total of 0 rules in 15 ms. Remains 425 /425 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 425/425 places, 1059/1059 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1059/1059 transitions.
Applied a total of 0 rules in 15 ms. Remains 425 /425 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
[2024-06-12 18:32:07] [INFO ] Invariant cache hit.
[2024-06-12 18:32:07] [INFO ] Implicit Places using invariants in 537 ms returned []
[2024-06-12 18:32:07] [INFO ] Invariant cache hit.
[2024-06-12 18:32:08] [INFO ] Implicit Places using invariants and state equation in 1331 ms returned []
Implicit Place search using SMT with State Equation took 1870 ms to find 0 implicit places.
[2024-06-12 18:32:08] [INFO ] Redundant transitions in 19 ms returned []
Running 1030 sub problems to find dead transitions.
[2024-06-12 18:32:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/424 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/424 variables, 32/40 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
At refinement iteration 3 (OVERLAPS) 1/425 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 1030 unsolved
SMT process timed out in 30617ms, After SMT, problems are : Problem set: 0 solved, 1030 unsolved
Search for dead transitions found 0 dead transitions in 30629ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32543 ms. Remains : 425/425 places, 1059/1059 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 20 ms. Remains 425 /425 variables (removed 0) and now considering 1059/1059 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-12 18:32:39] [INFO ] Invariant cache hit.
[2024-06-12 18:32:39] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-06-12 18:32:39] [INFO ] [Real]Absence check using 11 positive and 33 generalized place invariants in 22 ms returned sat
[2024-06-12 18:32:40] [INFO ] After 650ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-12 18:32:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-06-12 18:32:40] [INFO ] [Nat]Absence check using 11 positive and 33 generalized place invariants in 20 ms returned sat
[2024-06-12 18:32:40] [INFO ] After 462ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-12 18:32:40] [INFO ] After 523ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-12 18:32:40] [INFO ] After 683ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1365 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p2)), (X p2), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (F (NOT (OR p0 p1 p2))), (F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F p2), (F (NOT (AND (NOT p0) p1 (NOT p2))))]
Knowledge based reduction with 11 factoid took 703 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0)]
// Phase 1: matrix 1116 rows 487 cols
[2024-06-12 18:32:41] [INFO ] Computed 55 invariants in 9 ms
[2024-06-12 18:32:42] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-06-12 18:32:42] [INFO ] [Real]Absence check using 12 positive and 43 generalized place invariants in 103 ms returned sat
[2024-06-12 18:32:45] [INFO ] [Real]Absence check using state equation in 2237 ms returned sat
[2024-06-12 18:32:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-12 18:32:45] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-06-12 18:32:46] [INFO ] [Nat]Absence check using 12 positive and 43 generalized place invariants in 48 ms returned sat
[2024-06-12 18:32:50] [INFO ] [Nat]Absence check using state equation in 4068 ms returned unknown
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 138 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 34200 reset in 538 ms.
Product exploration explored 100000 steps with 34100 reset in 415 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 203 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 1116/1116 transitions.
Applied a total of 0 rules in 27 ms. Remains 487 /487 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2024-06-12 18:32:51] [INFO ] Redundant transitions in 34 ms returned []
Running 1080 sub problems to find dead transitions.
[2024-06-12 18:32:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 480/1603 variables, and 34 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 5/12 constraints, Generalized P Invariants (flows): 29/43 constraints, State Equation: 0/487 constraints, PredecessorRefiner: 1080/1080 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 3 (OVERLAPS) 4/484 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
[2024-06-12 18:33:44] [INFO ] Deduced a trap composed of 82 places in 355 ms of which 10 ms to minimize.
[2024-06-12 18:33:47] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 2 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 Int declared 484/1603 variables, and 47 constraints, problems are : Problem set: 0 solved, 1080 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 33/43 constraints, State Equation: 0/487 constraints, PredecessorRefiner: 0/1080 constraints, Known Traps: 2/2 constraints]
After SMT, in 60948ms problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 60967ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61043 ms. Remains : 487/487 places, 1116/1116 transitions.
Support contains 4 out of 487 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 1116/1116 transitions.
Applied a total of 0 rules in 17 ms. Remains 487 /487 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2024-06-12 18:33:52] [INFO ] Invariant cache hit.
[2024-06-12 18:33:53] [INFO ] Implicit Places using invariants in 824 ms returned []
[2024-06-12 18:33:53] [INFO ] Invariant cache hit.
[2024-06-12 18:33:54] [INFO ] Implicit Places using invariants and state equation in 1470 ms returned []
Implicit Place search using SMT with State Equation took 2299 ms to find 0 implicit places.
Running 1080 sub problems to find dead transitions.
[2024-06-12 18:33:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
At refinement iteration 3 (OVERLAPS) 4/484 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 1080 unsolved
SMT process timed out in 30965ms, After SMT, problems are : Problem set: 0 solved, 1080 unsolved
Search for dead transitions found 0 dead transitions in 31000ms
Finished structural reductions in LTL mode , in 1 iterations and 33321 ms. Remains : 487/487 places, 1116/1116 transitions.
Treatment of property ASLink-PT-05b-LTLCardinality-01 finished in 246349 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(p1))))'
Found a Shortening insensitive property : ASLink-PT-05b-LTLCardinality-05
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 2124 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2124/2124 places, 2581/2581 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 388 transitions
Trivial Post-agglo rules discarded 388 transitions
Performed 388 trivial Post agglomeration. Transition count delta: 388
Iterating post reduction 0 with 388 rules applied. Total rules applied 388 place count 2123 transition count 2192
Reduce places removed 388 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 391 rules applied. Total rules applied 779 place count 1735 transition count 2189
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 784 place count 1733 transition count 2186
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 787 place count 1730 transition count 2186
Performed 572 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 572 Pre rules applied. Total rules applied 787 place count 1730 transition count 1614
Deduced a syphon composed of 572 places in 6 ms
Ensure Unique test removed 53 places
Reduce places removed 625 places and 0 transitions.
Iterating global reduction 4 with 1197 rules applied. Total rules applied 1984 place count 1105 transition count 1614
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 4 with 38 rules applied. Total rules applied 2022 place count 1100 transition count 1581
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 34 rules applied. Total rules applied 2056 place count 1067 transition count 1580
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2057 place count 1066 transition count 1580
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 20 Pre rules applied. Total rules applied 2057 place count 1066 transition count 1560
Deduced a syphon composed of 20 places in 5 ms
Ensure Unique test removed 19 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 7 with 59 rules applied. Total rules applied 2116 place count 1027 transition count 1560
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 2117 place count 1026 transition count 1560
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 19 Pre rules applied. Total rules applied 2117 place count 1026 transition count 1541
Deduced a syphon composed of 19 places in 3 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 8 with 38 rules applied. Total rules applied 2155 place count 1007 transition count 1541
Performed 170 Post agglomeration using F-continuation condition.Transition count delta: 170
Deduced a syphon composed of 170 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 172 places and 0 transitions.
Iterating global reduction 8 with 342 rules applied. Total rules applied 2497 place count 835 transition count 1371
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 2501 place count 831 transition count 1367
Ensure Unique test removed 1 places
Iterating global reduction 8 with 5 rules applied. Total rules applied 2506 place count 830 transition count 1367
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 8 with 1 rules applied. Total rules applied 2507 place count 830 transition count 1366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2508 place count 829 transition count 1366
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 2508 place count 829 transition count 1365
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2510 place count 828 transition count 1365
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 2512 place count 826 transition count 1363
Iterating global reduction 10 with 2 rules applied. Total rules applied 2514 place count 826 transition count 1363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 10 with 2 rules applied. Total rules applied 2516 place count 826 transition count 1361
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 2517 place count 825 transition count 1361
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 2519 place count 824 transition count 1366
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 2520 place count 824 transition count 1366
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 2522 place count 822 transition count 1364
Reduce places removed 10 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 12 with 14 rules applied. Total rules applied 2536 place count 812 transition count 1360
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 2540 place count 808 transition count 1360
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 15 Pre rules applied. Total rules applied 2540 place count 808 transition count 1345
Deduced a syphon composed of 15 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 14 with 31 rules applied. Total rules applied 2571 place count 792 transition count 1345
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 14 with 11 rules applied. Total rules applied 2582 place count 781 transition count 1345
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2582 place count 781 transition count 1344
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2584 place count 780 transition count 1344
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 15 with 32 rules applied. Total rules applied 2616 place count 764 transition count 1328
Discarding 10 places :
Symmetric choice reduction at 15 with 10 rule applications. Total rules 2626 place count 754 transition count 1318
Iterating global reduction 15 with 10 rules applied. Total rules applied 2636 place count 754 transition count 1318
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 2641 place count 749 transition count 1313
Iterating global reduction 15 with 5 rules applied. Total rules applied 2646 place count 749 transition count 1313
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 2651 place count 749 transition count 1308
Applied a total of 2651 rules in 762 ms. Remains 749 /2124 variables (removed 1375) and now considering 1308/2581 (removed 1273) transitions.
// Phase 1: matrix 1308 rows 749 cols
[2024-06-12 18:34:27] [INFO ] Computed 124 invariants in 22 ms
[2024-06-12 18:34:28] [INFO ] Implicit Places using invariants in 1393 ms returned [1, 18, 19, 31, 48, 66, 86, 103, 106, 143, 153, 154, 156, 173, 191, 213, 264, 265, 277, 278, 280, 297, 315, 335, 386, 387, 399, 400, 402, 420, 438, 458, 509, 510, 522, 523, 525, 542, 560, 580, 631, 632, 635, 646, 647, 648, 666, 687, 688, 689, 690]
[2024-06-12 18:34:28] [INFO ] Actually due to overlaps returned [666, 648, 48, 173, 297, 420, 542, 31, 153, 156, 277, 280, 399, 402, 522, 525, 646, 687, 154, 278, 400, 523, 647, 688, 1, 18, 264, 265, 386, 387, 509, 510, 631, 632, 689, 19, 66, 86, 143, 191, 213, 315, 335, 438, 458, 560, 580, 635, 690]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 1415 ms to find 49 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 700/2124 places, 1308/2581 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 86 place count 700 transition count 1222
Reduce places removed 86 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 87 rules applied. Total rules applied 173 place count 614 transition count 1221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 174 place count 613 transition count 1221
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 174 place count 613 transition count 1194
Deduced a syphon composed of 27 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 229 place count 585 transition count 1194
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 241 place count 581 transition count 1186
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 249 place count 573 transition count 1186
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 252 place count 570 transition count 1183
Iterating global reduction 5 with 3 rules applied. Total rules applied 255 place count 570 transition count 1183
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 258 place count 570 transition count 1180
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 84 rules applied. Total rules applied 342 place count 528 transition count 1138
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 346 place count 526 transition count 1139
Applied a total of 346 rules in 82 ms. Remains 526 /700 variables (removed 174) and now considering 1139/1308 (removed 169) transitions.
// Phase 1: matrix 1139 rows 526 cols
[2024-06-12 18:34:28] [INFO ] Computed 70 invariants in 16 ms
[2024-06-12 18:34:29] [INFO ] Implicit Places using invariants in 843 ms returned [81, 84, 92, 98, 182, 188, 193, 270, 276, 281, 359, 365, 370, 447, 453, 458, 523]
[2024-06-12 18:34:29] [INFO ] Actually due to overlaps returned [81, 92, 98, 182, 188, 193, 270, 276, 281, 359, 365, 370, 447, 453, 458, 523]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 850 ms to find 16 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 510/2124 places, 1139/2581 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 0 with 1 rules applied. Total rules applied 1 place count 510 transition count 1138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 509 transition count 1138
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 11 place count 500 transition count 1129
Iterating global reduction 2 with 9 rules applied. Total rules applied 20 place count 500 transition count 1129
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 29 place count 491 transition count 1120
Iterating global reduction 2 with 9 rules applied. Total rules applied 38 place count 491 transition count 1120
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 43 place count 486 transition count 1115
Iterating global reduction 2 with 5 rules applied. Total rules applied 48 place count 486 transition count 1115
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 58 place count 481 transition count 1110
Applied a total of 58 rules in 112 ms. Remains 481 /510 variables (removed 29) and now considering 1110/1139 (removed 29) transitions.
// Phase 1: matrix 1110 rows 481 cols
[2024-06-12 18:34:29] [INFO ] Computed 54 invariants in 15 ms
[2024-06-12 18:34:30] [INFO ] Implicit Places using invariants in 714 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 725 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 3 : 480/2124 places, 1110/2581 transitions.
Applied a total of 0 rules in 20 ms. Remains 480 /480 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 4 iterations and 3970 ms. Remains : 480/2124 places, 1110/2581 transitions.
Running random walk in product with property : ASLink-PT-05b-LTLCardinality-05
Stuttering criterion allowed to conclude after 16087 steps with 237 reset in 66 ms.
Treatment of property ASLink-PT-05b-LTLCardinality-05 finished in 4400 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-06-12 18:34:30] [INFO ] Flatten gal took : 156 ms
[2024-06-12 18:34:30] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-12 18:34:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2124 places, 2581 transitions and 7978 arcs took 34 ms.
Total runtime 1842236 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ASLink-PT-05b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 2124
TRANSITIONS: 2581
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.089s, Sys 0.016s]


SAVING FILE /home/mcc/execution/416/model (.net / .def) ...
EXPORT TIME: [User 0.017s, Sys 0.003s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2461
MODEL NAME: /home/mcc/execution/416/model
2124 places, 2581 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML