Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r179-tall-171640601200284.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 FunctionPointer-PT-c004, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601200284
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M 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 FunctionPointer-PT-c004-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716436973126

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c004
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 04:02:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 04:02:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 04:02:54] [INFO ] Load time of PNML (sax parser for PT used): 390 ms
[2024-05-23 04:02:54] [INFO ] Transformed 2826 places.
[2024-05-23 04:02:54] [INFO ] Transformed 8960 transitions.
[2024-05-23 04:02:54] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 544 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1198 places in 46 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c004-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 289 places :
Symmetric choice reduction at 1 with 289 rule applications. Total rules 306 place count 1322 transition count 3804
Iterating global reduction 1 with 289 rules applied. Total rules applied 595 place count 1322 transition count 3804
Ensure Unique test removed 426 transitions
Reduce isomorphic transitions removed 426 transitions.
Iterating post reduction 1 with 426 rules applied. Total rules applied 1021 place count 1322 transition count 3378
Discarding 146 places :
Symmetric choice reduction at 2 with 146 rule applications. Total rules 1167 place count 1176 transition count 3086
Iterating global reduction 2 with 146 rules applied. Total rules applied 1313 place count 1176 transition count 3086
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 2 with 92 rules applied. Total rules applied 1405 place count 1176 transition count 2994
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1418 place count 1163 transition count 2968
Iterating global reduction 3 with 13 rules applied. Total rules applied 1431 place count 1163 transition count 2968
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1443 place count 1151 transition count 2944
Iterating global reduction 3 with 12 rules applied. Total rules applied 1455 place count 1151 transition count 2944
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1467 place count 1139 transition count 2920
Iterating global reduction 3 with 12 rules applied. Total rules applied 1479 place count 1139 transition count 2920
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1491 place count 1127 transition count 2896
Iterating global reduction 3 with 12 rules applied. Total rules applied 1503 place count 1127 transition count 2896
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1514 place count 1116 transition count 2874
Iterating global reduction 3 with 11 rules applied. Total rules applied 1525 place count 1116 transition count 2874
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1535 place count 1106 transition count 2854
Iterating global reduction 3 with 10 rules applied. Total rules applied 1545 place count 1106 transition count 2854
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1554 place count 1097 transition count 2836
Iterating global reduction 3 with 9 rules applied. Total rules applied 1563 place count 1097 transition count 2836
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 1594 place count 1066 transition count 2722
Iterating global reduction 3 with 31 rules applied. Total rules applied 1625 place count 1066 transition count 2722
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 1668 place count 1023 transition count 2550
Iterating global reduction 3 with 43 rules applied. Total rules applied 1711 place count 1023 transition count 2550
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 1754 place count 980 transition count 2428
Iterating global reduction 3 with 43 rules applied. Total rules applied 1797 place count 980 transition count 2428
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 1840 place count 937 transition count 2342
Iterating global reduction 3 with 43 rules applied. Total rules applied 1883 place count 937 transition count 2342
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 1926 place count 894 transition count 2256
Iterating global reduction 3 with 43 rules applied. Total rules applied 1969 place count 894 transition count 2256
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 2012 place count 851 transition count 2170
Iterating global reduction 3 with 43 rules applied. Total rules applied 2055 place count 851 transition count 2170
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 2097 place count 809 transition count 2086
Iterating global reduction 3 with 42 rules applied. Total rules applied 2139 place count 809 transition count 2086
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 2157 place count 791 transition count 2050
Iterating global reduction 3 with 18 rules applied. Total rules applied 2175 place count 791 transition count 2050
Applied a total of 2175 rules in 1262 ms. Remains 791 /1628 variables (removed 837) and now considering 2050/5962 (removed 3912) transitions.
[2024-05-23 04:02:56] [INFO ] Flow matrix only has 1375 transitions (discarded 675 similar events)
// Phase 1: matrix 1375 rows 791 cols
[2024-05-23 04:02:56] [INFO ] Computed 2 invariants in 34 ms
[2024-05-23 04:02:57] [INFO ] Implicit Places using invariants in 752 ms returned []
[2024-05-23 04:02:57] [INFO ] Flow matrix only has 1375 transitions (discarded 675 similar events)
[2024-05-23 04:02:57] [INFO ] Invariant cache hit.
[2024-05-23 04:02:57] [INFO ] State equation strengthened by 327 read => feed constraints.
[2024-05-23 04:02:59] [INFO ] Implicit Places using invariants and state equation in 2483 ms returned []
Implicit Place search using SMT with State Equation took 3263 ms to find 0 implicit places.
Running 2048 sub problems to find dead transitions.
[2024-05-23 04:02:59] [INFO ] Flow matrix only has 1375 transitions (discarded 675 similar events)
[2024-05-23 04:02:59] [INFO ] Invariant cache hit.
[2024-05-23 04:02:59] [INFO ] State equation strengthened by 327 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/791 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2048 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/791 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2048 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 791/2166 variables, and 2 constraints, problems are : Problem set: 0 solved, 2048 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/791 constraints, ReadFeed: 0/327 constraints, PredecessorRefiner: 2048/2048 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2048 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/791 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2048 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/791 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2048 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/791 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2048 unsolved
At refinement iteration 3 (OVERLAPS) 1375/2166 variables, 791/793 constraints. Problems are: Problem set: 0 solved, 2048 unsolved
SMT process timed out in 70991ms, After SMT, problems are : Problem set: 0 solved, 2048 unsolved
Search for dead transitions found 0 dead transitions in 71038ms
Starting structural reductions in LTL mode, iteration 1 : 791/1628 places, 2050/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75598 ms. Remains : 791/1628 places, 2050/5962 transitions.
Support contains 26 out of 791 places after structural reductions.
[2024-05-23 04:04:11] [INFO ] Flatten gal took : 200 ms
[2024-05-23 04:04:11] [INFO ] Flatten gal took : 98 ms
[2024-05-23 04:04:11] [INFO ] Input system was already deterministic with 2050 transitions.
RANDOM walk for 40001 steps (8 resets) in 3037 ms. (13 steps per ms) remains 22/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 18/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
[2024-05-23 04:04:12] [INFO ] Flow matrix only has 1375 transitions (discarded 675 similar events)
[2024-05-23 04:04:12] [INFO ] Invariant cache hit.
[2024-05-23 04:04:12] [INFO ] State equation strengthened by 327 read => feed constraints.
Problem AtomicPropp5 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 383/403 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 45/448 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1026/1474 variables, 448/450 constraints. Problems are: Problem set: 1 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1474 variables, 260/710 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1474 variables, 0/710 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 540/2014 variables, 220/930 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2014 variables, 67/997 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2014 variables, 0/997 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 139/2153 variables, 115/1112 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2153 variables, 0/1112 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 10/2163 variables, 6/1118 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2163 variables, 0/1118 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 3/2166 variables, 2/1120 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2166 variables, 0/1120 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 0/2166 variables, 0/1120 constraints. Problems are: Problem set: 1 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2166/2166 variables, and 1120 constraints, problems are : Problem set: 1 solved, 17 unsolved in 3586 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 791/791 constraints, ReadFeed: 327/327 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 383/403 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 45/448 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/448 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1026/1474 variables, 448/450 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1474 variables, 260/710 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1474 variables, 0/710 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 540/2014 variables, 220/930 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2014 variables, 67/997 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2014 variables, 17/1014 constraints. Problems are: Problem set: 1 solved, 17 unsolved
[2024-05-23 04:04:18] [INFO ] Deduced a trap composed of 131 places in 210 ms of which 24 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2014 variables, 1/1015 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2014 variables, 0/1015 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 139/2153 variables, 115/1130 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2153 variables, 0/1130 constraints. Problems are: Problem set: 1 solved, 17 unsolved
SMT process timed out in 8778ms, After SMT, problems are : Problem set: 1 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 791 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 791/791 places, 2050/2050 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 789 transition count 2046
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 789 transition count 2046
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 789 transition count 2044
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 786 transition count 2038
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 786 transition count 2038
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 16 place count 786 transition count 2034
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 784 transition count 2028
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 784 transition count 2028
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 782 transition count 2022
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 782 transition count 2022
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 777 transition count 2004
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 777 transition count 2004
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 39 place count 772 transition count 1986
Iterating global reduction 2 with 5 rules applied. Total rules applied 44 place count 772 transition count 1986
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 49 place count 767 transition count 1976
Iterating global reduction 2 with 5 rules applied. Total rules applied 54 place count 767 transition count 1976
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 59 place count 762 transition count 1966
Iterating global reduction 2 with 5 rules applied. Total rules applied 64 place count 762 transition count 1966
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 69 place count 757 transition count 1956
Iterating global reduction 2 with 5 rules applied. Total rules applied 74 place count 757 transition count 1956
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 78 place count 753 transition count 1948
Iterating global reduction 2 with 4 rules applied. Total rules applied 82 place count 753 transition count 1948
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 86 place count 749 transition count 1940
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 749 transition count 1940
Drop transitions (Redundant composition of simpler transitions.) removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 2 with 32 rules applied. Total rules applied 122 place count 749 transition count 1908
Applied a total of 122 rules in 694 ms. Remains 749 /791 variables (removed 42) and now considering 1908/2050 (removed 142) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 695 ms. Remains : 749/791 places, 1908/2050 transitions.
RANDOM walk for 40001 steps (8 resets) in 509 ms. (78 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (9 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 184912 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 17
Probabilistic random walk after 184912 steps, saw 120038 distinct states, run finished after 3005 ms. (steps per millisecond=61 ) properties seen :0
[2024-05-23 04:04:25] [INFO ] Flow matrix only has 1284 transitions (discarded 624 similar events)
// Phase 1: matrix 1284 rows 749 cols
[2024-05-23 04:04:25] [INFO ] Computed 2 invariants in 10 ms
[2024-05-23 04:04:25] [INFO ] State equation strengthened by 312 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 383/403 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 35/438 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 989/1427 variables, 438/440 constraints. Problems are: Problem set: 0 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1427 variables, 245/685 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1427 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 481/1908 variables, 204/889 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1908 variables, 67/956 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1908 variables, 0/956 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 117/2025 variables, 102/1058 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2025 variables, 0/1058 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 5/2030 variables, 3/1061 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2030 variables, 0/1061 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 3/2033 variables, 2/1063 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2033 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 0/2033 variables, 0/1063 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2033/2033 variables, and 1063 constraints, problems are : Problem set: 0 solved, 17 unsolved in 3617 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 749/749 constraints, ReadFeed: 312/312 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 383/403 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 35/438 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/438 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 989/1427 variables, 438/440 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1427 variables, 245/685 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1427 variables, 0/685 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 481/1908 variables, 204/889 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1908 variables, 67/956 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1908 variables, 17/973 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-23 04:04:31] [INFO ] Deduced a trap composed of 131 places in 173 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1908 variables, 1/974 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1908 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 117/2025 variables, 102/1076 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2025 variables, 0/1076 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 5/2030 variables, 3/1079 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2030 variables, 0/1079 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 3/2033 variables, 2/1081 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2033 variables, 0/1081 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (OVERLAPS) 0/2033 variables, 0/1081 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2033/2033 variables, and 1081 constraints, problems are : Problem set: 0 solved, 17 unsolved in 12030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 749/749 constraints, ReadFeed: 312/312 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints]
After SMT, in 15814ms problems are : Problem set: 0 solved, 17 unsolved
Parikh walk visited 10 properties in 18809 ms.
Support contains 9 out of 749 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 749/749 places, 1908/1908 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 740 transition count 1890
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 740 transition count 1890
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 740 transition count 1884
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 32 place count 732 transition count 1866
Iterating global reduction 1 with 8 rules applied. Total rules applied 40 place count 732 transition count 1866
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 726 transition count 1850
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 726 transition count 1850
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 58 place count 720 transition count 1838
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 720 transition count 1838
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 714 transition count 1826
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 714 transition count 1826
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 84 place count 706 transition count 1804
Iterating global reduction 1 with 8 rules applied. Total rules applied 92 place count 706 transition count 1804
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 99 place count 699 transition count 1788
Iterating global reduction 1 with 7 rules applied. Total rules applied 106 place count 699 transition count 1788
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 113 place count 692 transition count 1774
Iterating global reduction 1 with 7 rules applied. Total rules applied 120 place count 692 transition count 1774
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 126 place count 686 transition count 1762
Iterating global reduction 1 with 6 rules applied. Total rules applied 132 place count 686 transition count 1762
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 136 place count 682 transition count 1754
Iterating global reduction 1 with 4 rules applied. Total rules applied 140 place count 682 transition count 1754
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 144 place count 678 transition count 1746
Iterating global reduction 1 with 4 rules applied. Total rules applied 148 place count 678 transition count 1746
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 152 place count 674 transition count 1738
Iterating global reduction 1 with 4 rules applied. Total rules applied 156 place count 674 transition count 1738
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 157 place count 673 transition count 1736
Iterating global reduction 1 with 1 rules applied. Total rules applied 158 place count 673 transition count 1736
Applied a total of 158 rules in 353 ms. Remains 673 /749 variables (removed 76) and now considering 1736/1908 (removed 172) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 354 ms. Remains : 673/749 places, 1736/1908 transitions.
RANDOM walk for 40003 steps (8 resets) in 249 ms. (160 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 110 ms. (360 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 251015 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 7
Probabilistic random walk after 251015 steps, saw 162941 distinct states, run finished after 3003 ms. (steps per millisecond=83 ) properties seen :0
[2024-05-23 04:05:03] [INFO ] Flow matrix only has 1163 transitions (discarded 573 similar events)
// Phase 1: matrix 1163 rows 673 cols
[2024-05-23 04:05:03] [INFO ] Computed 2 invariants in 10 ms
[2024-05-23 04:05:03] [INFO ] State equation strengthened by 285 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 19/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 394/422 variables, 28/29 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 10/39 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1193/1615 variables, 492/531 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1615 variables, 275/806 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1615 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 62/1677 variables, 1/807 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1677 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 151/1828 variables, 148/955 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1828 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 5/1833 variables, 3/958 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1833 variables, 0/958 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 3/1836 variables, 2/960 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1836 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/1836 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1836/1836 variables, and 960 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1811 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 673/673 constraints, ReadFeed: 285/285 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 19/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 394/422 variables, 28/29 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 10/39 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/422 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1193/1615 variables, 492/531 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1615 variables, 275/806 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1615 variables, 7/813 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1615 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 62/1677 variables, 1/814 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1677 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 151/1828 variables, 148/962 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 04:05:07] [INFO ] Deduced a trap composed of 139 places in 159 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1828 variables, 1/963 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1828 variables, 0/963 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 5/1833 variables, 3/966 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1833 variables, 0/966 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 3/1836 variables, 2/968 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1836 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 0/1836 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1836/1836 variables, and 968 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4062 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 673/673 constraints, ReadFeed: 285/285 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 5944ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 2598 ms.
Support contains 9 out of 673 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 673/673 places, 1736/1736 transitions.
Applied a total of 0 rules in 88 ms. Remains 673 /673 variables (removed 0) and now considering 1736/1736 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 673/673 places, 1736/1736 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 673/673 places, 1736/1736 transitions.
Applied a total of 0 rules in 87 ms. Remains 673 /673 variables (removed 0) and now considering 1736/1736 (removed 0) transitions.
[2024-05-23 04:05:12] [INFO ] Flow matrix only has 1163 transitions (discarded 573 similar events)
[2024-05-23 04:05:12] [INFO ] Invariant cache hit.
[2024-05-23 04:05:12] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-05-23 04:05:12] [INFO ] Flow matrix only has 1163 transitions (discarded 573 similar events)
[2024-05-23 04:05:12] [INFO ] Invariant cache hit.
[2024-05-23 04:05:13] [INFO ] State equation strengthened by 285 read => feed constraints.
[2024-05-23 04:05:14] [INFO ] Implicit Places using invariants and state equation in 1827 ms returned []
Implicit Place search using SMT with State Equation took 2281 ms to find 0 implicit places.
[2024-05-23 04:05:14] [INFO ] Redundant transitions in 87 ms returned []
Running 1734 sub problems to find dead transitions.
[2024-05-23 04:05:14] [INFO ] Flow matrix only has 1163 transitions (discarded 573 similar events)
[2024-05-23 04:05:14] [INFO ] Invariant cache hit.
[2024-05-23 04:05:14] [INFO ] State equation strengthened by 285 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/673 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/673 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 673/1836 variables, and 2 constraints, problems are : Problem set: 0 solved, 1734 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/673 constraints, ReadFeed: 0/285 constraints, PredecessorRefiner: 1734/1734 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1734 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/673 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/673 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/673 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 3 (OVERLAPS) 1163/1836 variables, 673/675 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1836 variables, 285/960 constraints. Problems are: Problem set: 0 solved, 1734 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1836/1836 variables, and 2694 constraints, problems are : Problem set: 0 solved, 1734 unsolved in 31748 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 673/673 constraints, ReadFeed: 285/285 constraints, PredecessorRefiner: 1734/1734 constraints, Known Traps: 0/0 constraints]
After SMT, in 69962ms problems are : Problem set: 0 solved, 1734 unsolved
Search for dead transitions found 0 dead transitions in 69979ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72443 ms. Remains : 673/673 places, 1736/1736 transitions.
FORMULA FunctionPointer-PT-c004-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FunctionPointer-PT-c004-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 192 stabilizing places and 512 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(F(p0)))'
Support contains 2 out of 791 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 791/791 places, 2050/2050 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 775 transition count 2016
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 775 transition count 2016
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 42 place count 775 transition count 2006
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 58 place count 759 transition count 1972
Iterating global reduction 1 with 16 rules applied. Total rules applied 74 place count 759 transition count 1972
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 78 place count 759 transition count 1968
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 91 place count 746 transition count 1928
Iterating global reduction 2 with 13 rules applied. Total rules applied 104 place count 746 transition count 1928
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 119 place count 731 transition count 1880
Iterating global reduction 2 with 15 rules applied. Total rules applied 134 place count 731 transition count 1880
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 151 place count 714 transition count 1834
Iterating global reduction 2 with 17 rules applied. Total rules applied 168 place count 714 transition count 1834
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 187 place count 695 transition count 1784
Iterating global reduction 2 with 19 rules applied. Total rules applied 206 place count 695 transition count 1784
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 224 place count 677 transition count 1740
Iterating global reduction 2 with 18 rules applied. Total rules applied 242 place count 677 transition count 1740
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 260 place count 659 transition count 1702
Iterating global reduction 2 with 18 rules applied. Total rules applied 278 place count 659 transition count 1702
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 295 place count 642 transition count 1666
Iterating global reduction 2 with 17 rules applied. Total rules applied 312 place count 642 transition count 1666
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 323 place count 631 transition count 1642
Iterating global reduction 2 with 11 rules applied. Total rules applied 334 place count 631 transition count 1642
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 342 place count 623 transition count 1626
Iterating global reduction 2 with 8 rules applied. Total rules applied 350 place count 623 transition count 1626
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 355 place count 618 transition count 1616
Iterating global reduction 2 with 5 rules applied. Total rules applied 360 place count 618 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 362 place count 616 transition count 1612
Iterating global reduction 2 with 2 rules applied. Total rules applied 364 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 365 place count 615 transition count 1610
Iterating global reduction 2 with 1 rules applied. Total rules applied 366 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 367 place count 614 transition count 1608
Iterating global reduction 2 with 1 rules applied. Total rules applied 368 place count 614 transition count 1608
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 372 place count 614 transition count 1604
Applied a total of 372 rules in 758 ms. Remains 614 /791 variables (removed 177) and now considering 1604/2050 (removed 446) transitions.
[2024-05-23 04:06:25] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-23 04:06:25] [INFO ] Computed 2 invariants in 10 ms
[2024-05-23 04:06:26] [INFO ] Implicit Places using invariants in 392 ms returned []
[2024-05-23 04:06:26] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 04:06:26] [INFO ] Invariant cache hit.
[2024-05-23 04:06:26] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 04:06:27] [INFO ] Implicit Places using invariants and state equation in 1710 ms returned []
Implicit Place search using SMT with State Equation took 2105 ms to find 0 implicit places.
[2024-05-23 04:06:28] [INFO ] Redundant transitions in 91 ms returned []
Running 1602 sub problems to find dead transitions.
[2024-05-23 04:06:28] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 04:06:28] [INFO ] Invariant cache hit.
[2024-05-23 04:06:28] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 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 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1685 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2483 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31052 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 68116ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 68131ms
Starting structural reductions in SI_LTL mode, iteration 1 : 614/791 places, 1604/2050 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71104 ms. Remains : 614/791 places, 1604/2050 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 572 ms.
Product exploration explored 100000 steps with 0 reset in 480 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 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 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40003 steps (8 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 540098 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :0 out of 1
Probabilistic random walk after 540098 steps, saw 350557 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
[2024-05-23 04:07:40] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 04:07:40] [INFO ] Invariant cache hit.
[2024-05-23 04:07:40] [INFO ] State equation strengthened by 265 read => feed constraints.
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) 270/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1075/1347 variables, 407/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1347 variables, 201/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1347 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/1409 variables, 1/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1409 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1410 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1410 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1410 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 267/1677 variables, 199/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1677 variables, 64/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1677 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/1682 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/1685 variables, 2/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1685/1685 variables, and 881 constraints, problems are : Problem set: 0 solved, 1 unsolved in 523 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 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) 270/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1075/1347 variables, 407/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1347 variables, 201/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1347 variables, 1/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1347 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1409 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1409 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1410 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1410 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1410 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 267/1677 variables, 199/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1677 variables, 64/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1677 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/1682 variables, 3/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1682 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/1685 variables, 2/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1685 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1685 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 882 constraints, problems are : Problem set: 0 solved, 1 unsolved in 887 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1438ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Graph (complete) has 2680 edges and 614 vertex of which 422 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.2 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 422 transition count 1220
Applied a total of 385 rules in 61 ms. Remains 422 /614 variables (removed 192) and now considering 1220/1604 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 422/614 places, 1220/1604 transitions.
RANDOM walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 642002 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :0 out of 1
Probabilistic random walk after 642002 steps, saw 393662 distinct states, run finished after 3001 ms. (steps per millisecond=213 ) properties seen :0
[2024-05-23 04:07:45] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2024-05-23 04:07:45] [INFO ] Computed 3 invariants in 3 ms
[2024-05-23 04:07:45] [INFO ] State equation strengthened by 75 read => feed constraints.
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) 11/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 347/360 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 607/967 variables, 334/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/967 variables, 72/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/967 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 62/1029 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1029 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 74/1103 variables, 70/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1103 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/1108 variables, 3/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1108 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/1111 variables, 2/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 311 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 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) 11/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 347/360 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 607/967 variables, 334/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/967 variables, 72/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/967 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/967 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1029 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1029 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 74/1103 variables, 70/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1103 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/1108 variables, 3/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1108 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/1111 variables, 2/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1111 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 501 constraints, problems are : Problem set: 0 solved, 1 unsolved in 700 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1035ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 49 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 46 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-23 04:07:46] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 04:07:46] [INFO ] Invariant cache hit.
[2024-05-23 04:07:46] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-23 04:07:46] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 04:07:46] [INFO ] Invariant cache hit.
[2024-05-23 04:07:46] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-23 04:07:47] [INFO ] Implicit Places using invariants and state equation in 982 ms returned []
Implicit Place search using SMT with State Equation took 1243 ms to find 0 implicit places.
[2024-05-23 04:07:47] [INFO ] Redundant transitions in 21 ms returned []
Running 1218 sub problems to find dead transitions.
[2024-05-23 04:07:47] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-23 04:07:47] [INFO ] Invariant cache hit.
[2024-05-23 04:07:47] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
[2024-05-23 04:08:00] [INFO ] Deduced a trap composed of 131 places in 161 ms of which 8 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (OVERLAPS) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
SMT process timed out in 33601ms, After SMT, problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 33612ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34937 ms. Remains : 422/422 places, 1220/1220 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 541 rules applied. Total rules applied 541 place count 422 transition count 679
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 551 place count 412 transition count 679
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 551 place count 412 transition count 606
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 697 place count 339 transition count 606
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 1 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 951 place count 212 transition count 479
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1015 place count 148 transition count 351
Iterating global reduction 2 with 64 rules applied. Total rules applied 1079 place count 148 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1080 place count 148 transition count 350
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1143 place count 85 transition count 224
Iterating global reduction 3 with 63 rules applied. Total rules applied 1206 place count 85 transition count 224
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1269 place count 22 transition count 98
Iterating global reduction 3 with 63 rules applied. Total rules applied 1332 place count 22 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1395 place count 22 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1395 place count 22 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1397 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1399 place count 20 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1401 place count 19 transition count 33
Applied a total of 1401 rules in 53 ms. Remains 19 /422 variables (removed 403) and now considering 33/1220 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 33 rows 19 cols
[2024-05-23 04:08:21] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 04:08:21] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 04:08:21] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 04:08:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 04:08:21] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 04:08:21] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 04:08:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 04:08:21] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 04:08:21] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 04:08:21] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 04:08:21] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 153 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 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 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 97 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-23 04:08:21] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-23 04:08:21] [INFO ] Computed 2 invariants in 11 ms
[2024-05-23 04:08:22] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-23 04:08:22] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 04:08:22] [INFO ] Invariant cache hit.
[2024-05-23 04:08:22] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 04:08:23] [INFO ] Implicit Places using invariants and state equation in 1708 ms returned []
Implicit Place search using SMT with State Equation took 2092 ms to find 0 implicit places.
[2024-05-23 04:08:23] [INFO ] Redundant transitions in 24 ms returned []
Running 1602 sub problems to find dead transitions.
[2024-05-23 04:08:23] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 04:08:23] [INFO ] Invariant cache hit.
[2024-05-23 04:08:23] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 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 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1685 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2483 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31282 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 68480ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 68495ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 70717 ms. Remains : 614/614 places, 1604/1604 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 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 90 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40001 steps (8 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 521929 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :0 out of 1
Probabilistic random walk after 521929 steps, saw 338766 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
[2024-05-23 04:09:35] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 04:09:35] [INFO ] Invariant cache hit.
[2024-05-23 04:09:35] [INFO ] State equation strengthened by 265 read => feed constraints.
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) 270/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1075/1347 variables, 407/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1347 variables, 201/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1347 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/1409 variables, 1/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1409 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1410 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1410 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1410 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 267/1677 variables, 199/812 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1677 variables, 64/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1677 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/1682 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/1685 variables, 2/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1685/1685 variables, and 881 constraints, problems are : Problem set: 0 solved, 1 unsolved in 532 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 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) 270/272 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1075/1347 variables, 407/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1347 variables, 201/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1347 variables, 1/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1347 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1409 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1409 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1410 variables, 1/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1410 variables, 1/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1410 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 267/1677 variables, 199/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1677 variables, 64/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1677 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/1682 variables, 3/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1682 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/1685 variables, 2/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1685 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1685 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 882 constraints, problems are : Problem set: 0 solved, 1 unsolved in 882 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1447ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Graph (complete) has 2680 edges and 614 vertex of which 422 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 422 transition count 1220
Applied a total of 385 rules in 55 ms. Remains 422 /614 variables (removed 192) and now considering 1220/1604 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 422/614 places, 1220/1604 transitions.
RANDOM walk for 40002 steps (8 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
BEST_FIRST walk for 24838 steps (5 resets) in 41 ms. (591 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 94 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 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 380 ms.
Product exploration explored 100000 steps with 0 reset in 457 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 91 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-23 04:09:38] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 04:09:38] [INFO ] Invariant cache hit.
[2024-05-23 04:09:38] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-05-23 04:09:38] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 04:09:38] [INFO ] Invariant cache hit.
[2024-05-23 04:09:39] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 04:09:40] [INFO ] Implicit Places using invariants and state equation in 1675 ms returned []
Implicit Place search using SMT with State Equation took 2061 ms to find 0 implicit places.
[2024-05-23 04:09:40] [INFO ] Redundant transitions in 25 ms returned []
Running 1602 sub problems to find dead transitions.
[2024-05-23 04:09:40] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 04:09:40] [INFO ] Invariant cache hit.
[2024-05-23 04:09:40] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1685 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2483 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 31042 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 68159ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 68173ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 70358 ms. Remains : 614/614 places, 1604/1604 transitions.
Treatment of property FunctionPointer-PT-c004-LTLFireability-00 finished in 263931 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&&X(!p1))||G(!p1)))))'
Support contains 3 out of 791 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 791/791 places, 2050/2050 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 776 transition count 2018
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 776 transition count 2018
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 38 place count 776 transition count 2010
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 53 place count 761 transition count 1978
Iterating global reduction 1 with 15 rules applied. Total rules applied 68 place count 761 transition count 1978
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 72 place count 761 transition count 1974
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 84 place count 749 transition count 1936
Iterating global reduction 2 with 12 rules applied. Total rules applied 96 place count 749 transition count 1936
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 110 place count 735 transition count 1890
Iterating global reduction 2 with 14 rules applied. Total rules applied 124 place count 735 transition count 1890
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 140 place count 719 transition count 1846
Iterating global reduction 2 with 16 rules applied. Total rules applied 156 place count 719 transition count 1846
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 172 place count 703 transition count 1808
Iterating global reduction 2 with 16 rules applied. Total rules applied 188 place count 703 transition count 1808
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 204 place count 687 transition count 1772
Iterating global reduction 2 with 16 rules applied. Total rules applied 220 place count 687 transition count 1772
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 236 place count 671 transition count 1736
Iterating global reduction 2 with 16 rules applied. Total rules applied 252 place count 671 transition count 1736
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 268 place count 655 transition count 1700
Iterating global reduction 2 with 16 rules applied. Total rules applied 284 place count 655 transition count 1700
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 294 place count 645 transition count 1676
Iterating global reduction 2 with 10 rules applied. Total rules applied 304 place count 645 transition count 1676
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 311 place count 638 transition count 1662
Iterating global reduction 2 with 7 rules applied. Total rules applied 318 place count 638 transition count 1662
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 322 place count 634 transition count 1654
Iterating global reduction 2 with 4 rules applied. Total rules applied 326 place count 634 transition count 1654
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 330 place count 630 transition count 1646
Iterating global reduction 2 with 4 rules applied. Total rules applied 334 place count 630 transition count 1646
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 336 place count 628 transition count 1642
Iterating global reduction 2 with 2 rules applied. Total rules applied 338 place count 628 transition count 1642
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 340 place count 626 transition count 1638
Iterating global reduction 2 with 2 rules applied. Total rules applied 342 place count 626 transition count 1638
Applied a total of 342 rules in 291 ms. Remains 626 /791 variables (removed 165) and now considering 1638/2050 (removed 412) transitions.
[2024-05-23 04:10:49] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
// Phase 1: matrix 1092 rows 626 cols
[2024-05-23 04:10:49] [INFO ] Computed 2 invariants in 12 ms
[2024-05-23 04:10:49] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-05-23 04:10:49] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2024-05-23 04:10:49] [INFO ] Invariant cache hit.
[2024-05-23 04:10:49] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 04:10:51] [INFO ] Implicit Places using invariants and state equation in 1674 ms returned []
Implicit Place search using SMT with State Equation took 2031 ms to find 0 implicit places.
Running 1636 sub problems to find dead transitions.
[2024-05-23 04:10:51] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2024-05-23 04:10:51] [INFO ] Invariant cache hit.
[2024-05-23 04:10:51] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/1718 variables, and 2 constraints, problems are : Problem set: 0 solved, 1636 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/626 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1636/1636 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1636 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/626 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
At refinement iteration 3 (OVERLAPS) 1092/1718 variables, 626/628 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1718 variables, 268/896 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1718/1718 variables, and 2532 constraints, problems are : Problem set: 0 solved, 1636 unsolved in 31346 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 626/626 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1636/1636 constraints, Known Traps: 0/0 constraints]
After SMT, in 68628ms problems are : Problem set: 0 solved, 1636 unsolved
Search for dead transitions found 0 dead transitions in 68644ms
Starting structural reductions in LTL mode, iteration 1 : 626/791 places, 1638/2050 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70973 ms. Remains : 626/791 places, 1638/2050 transitions.
Stuttering acceptance computed with spot in 135 ms :[p1, p1, p1]
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 414 ms.
Product exploration explored 100000 steps with 0 reset in 403 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 107 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[p1, p1, p1]
RANDOM walk for 40003 steps (8 resets) in 292 ms. (136 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 364 ms. (109 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 183 ms. (217 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 352 ms. (113 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 156310 steps, run timeout after 3004 ms. (steps per millisecond=52 ) properties seen :0 out of 6
Probabilistic random walk after 156310 steps, saw 101475 distinct states, run finished after 3004 ms. (steps per millisecond=52 ) properties seen :0
[2024-05-23 04:12:04] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2024-05-23 04:12:04] [INFO ] Invariant cache hit.
[2024-05-23 04:12:04] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 339/342 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1156/1498 variables, 477/480 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1498 variables, 268/748 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 62/1560 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1560 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/1561 variables, 1/750 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1561 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1561 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 145/1706 variables, 138/889 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1706 variables, 0/889 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 8/1714 variables, 4/893 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1714 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 4/1718 variables, 3/896 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1718 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/1718 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1718/1718 variables, and 896 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1677 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 626/626 constraints, ReadFeed: 268/268 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 339/342 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1156/1498 variables, 477/480 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1498 variables, 268/748 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 6/754 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1498 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 62/1560 variables, 1/755 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1560 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1/1561 variables, 1/756 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1561 variables, 1/757 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1561 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 145/1706 variables, 138/895 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 04:12:08] [INFO ] Deduced a trap composed of 131 places in 149 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1706 variables, 1/896 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1706 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 8/1714 variables, 4/900 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1714 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 4/1718 variables, 3/903 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1718 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/1718 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1718/1718 variables, and 903 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4235 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 626/626 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 5956ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 3 properties in 1794 ms.
Support contains 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1638/1638 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 1632
Applied a total of 6 rules in 157 ms. Remains 626 /626 variables (removed 0) and now considering 1632/1638 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 626/626 places, 1632/1638 transitions.
RANDOM walk for 40004 steps (8 resets) in 488 ms. (81 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 236297 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 3
Probabilistic random walk after 236297 steps, saw 153388 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
[2024-05-23 04:12:15] [INFO ] Flow matrix only has 1089 transitions (discarded 543 similar events)
// Phase 1: matrix 1089 rows 626 cols
[2024-05-23 04:12:15] [INFO ] Computed 2 invariants in 7 ms
[2024-05-23 04:12:15] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 339/342 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1153/1495 variables, 477/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 268/748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1495 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 62/1557 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1557 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/1558 variables, 1/750 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1558 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1558 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 142/1700 variables, 136/887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1700 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 9/1709 variables, 5/892 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1709 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 6/1715 variables, 4/896 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1715 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1715 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1715/1715 variables, and 896 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 626/626 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 339/342 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1153/1495 variables, 477/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 268/748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1495 variables, 3/751 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1495 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 62/1557 variables, 1/752 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1557 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/1558 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1558 variables, 1/754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1558 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 142/1700 variables, 136/890 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 04:12:18] [INFO ] Deduced a trap composed of 131 places in 159 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1700 variables, 1/891 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1700 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 9/1709 variables, 5/896 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1709 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 6/1715 variables, 4/900 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1715 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1715 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1715/1715 variables, and 900 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2269 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 626/626 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 3327ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 994 ms.
Support contains 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1632/1632 transitions.
Applied a total of 0 rules in 76 ms. Remains 626 /626 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 626/626 places, 1632/1632 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1632/1632 transitions.
Applied a total of 0 rules in 76 ms. Remains 626 /626 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
[2024-05-23 04:12:20] [INFO ] Flow matrix only has 1089 transitions (discarded 543 similar events)
[2024-05-23 04:12:20] [INFO ] Invariant cache hit.
[2024-05-23 04:12:20] [INFO ] Implicit Places using invariants in 362 ms returned []
[2024-05-23 04:12:20] [INFO ] Flow matrix only has 1089 transitions (discarded 543 similar events)
[2024-05-23 04:12:20] [INFO ] Invariant cache hit.
[2024-05-23 04:12:21] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 04:12:22] [INFO ] Implicit Places using invariants and state equation in 1640 ms returned []
Implicit Place search using SMT with State Equation took 2002 ms to find 0 implicit places.
[2024-05-23 04:12:22] [INFO ] Redundant transitions in 27 ms returned []
Running 1630 sub problems to find dead transitions.
[2024-05-23 04:12:22] [INFO ] Flow matrix only has 1089 transitions (discarded 543 similar events)
[2024-05-23 04:12:22] [INFO ] Invariant cache hit.
[2024-05-23 04:12:22] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/1715 variables, and 2 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/626 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/626 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 3 (OVERLAPS) 1089/1715 variables, 626/628 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1715 variables, 268/896 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1715/1715 variables, and 2526 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 31558 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 626/626 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 0/0 constraints]
After SMT, in 68693ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 68708ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70829 ms. Remains : 626/626 places, 1632/1632 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 964 edges and 626 vertex of which 192 / 626 are part of one of the 64 SCC in 10 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 415 transitions
Reduce isomorphic transitions removed 735 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 498 transition count 884
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 485 transition count 884
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 27 place count 485 transition count 808
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 179 place count 409 transition count 808
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 242 place count 346 transition count 745
Iterating global reduction 2 with 63 rules applied. Total rules applied 305 place count 346 transition count 745
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 431 place count 346 transition count 619
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 687 place count 218 transition count 491
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 751 place count 154 transition count 363
Iterating global reduction 3 with 64 rules applied. Total rules applied 815 place count 154 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 816 place count 154 transition count 362
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 879 place count 91 transition count 236
Iterating global reduction 4 with 63 rules applied. Total rules applied 942 place count 91 transition count 236
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1005 place count 28 transition count 110
Iterating global reduction 4 with 63 rules applied. Total rules applied 1068 place count 28 transition count 110
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1131 place count 28 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1131 place count 28 transition count 46
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1133 place count 27 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1135 place count 26 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1139 place count 24 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1142 place count 24 transition count 42
Applied a total of 1142 rules in 67 ms. Remains 24 /626 variables (removed 602) and now considering 42/1632 (removed 1590) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 42 rows 24 cols
[2024-05-23 04:13:31] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 04:13:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 04:13:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:13:31] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-23 04:13:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 04:13:31] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 04:13:31] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 04:13:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 04:13:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:13:31] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-23 04:13:31] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-23 04:13:31] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-23 04:13:31] [INFO ] After 65ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 186 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 271 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 128 ms :[p1, p1, p1]
Support contains 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 1638/1638 transitions.
Applied a total of 0 rules in 17 ms. Remains 626 /626 variables (removed 0) and now considering 1638/1638 (removed 0) transitions.
[2024-05-23 04:13:31] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
// Phase 1: matrix 1092 rows 626 cols
[2024-05-23 04:13:31] [INFO ] Computed 2 invariants in 16 ms
[2024-05-23 04:13:32] [INFO ] Implicit Places using invariants in 386 ms returned []
[2024-05-23 04:13:32] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2024-05-23 04:13:32] [INFO ] Invariant cache hit.
[2024-05-23 04:13:32] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 04:13:33] [INFO ] Implicit Places using invariants and state equation in 1677 ms returned []
Implicit Place search using SMT with State Equation took 2067 ms to find 0 implicit places.
Running 1636 sub problems to find dead transitions.
[2024-05-23 04:13:34] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2024-05-23 04:13:34] [INFO ] Invariant cache hit.
[2024-05-23 04:13:34] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1636 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 626/1718 variables, and 2 constraints, problems are : Problem set: 0 solved, 1636 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/626 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1636/1636 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1636 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/626 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
At refinement iteration 3 (OVERLAPS) 1092/1718 variables, 626/628 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1718 variables, 268/896 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1718/1718 variables, and 2532 constraints, problems are : Problem set: 0 solved, 1636 unsolved in 31296 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 626/626 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1636/1636 constraints, Known Traps: 0/0 constraints]
After SMT, in 68666ms problems are : Problem set: 0 solved, 1636 unsolved
Search for dead transitions found 0 dead transitions in 68680ms
Finished structural reductions in LTL mode , in 1 iterations and 70775 ms. Remains : 626/626 places, 1638/1638 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 118 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[p1, p1, p1]
RANDOM walk for 40003 steps (8 resets) in 622 ms. (64 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 88 ms. (449 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 127 ms. (312 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 40 ms. (975 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 154093 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 6
Probabilistic random walk after 154093 steps, saw 100038 distinct states, run finished after 3002 ms. (steps per millisecond=51 ) properties seen :0
[2024-05-23 04:14:46] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2024-05-23 04:14:46] [INFO ] Invariant cache hit.
[2024-05-23 04:14:46] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 339/342 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1156/1498 variables, 477/480 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1498 variables, 268/748 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 62/1560 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1560 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/1561 variables, 1/750 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1561 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1561 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 145/1706 variables, 138/889 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1706 variables, 0/889 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 8/1714 variables, 4/893 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1714 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 4/1718 variables, 3/896 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1718 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/1718 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1718/1718 variables, and 896 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1741 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 626/626 constraints, ReadFeed: 268/268 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 339/342 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1156/1498 variables, 477/480 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1498 variables, 268/748 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 6/754 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1498 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 62/1560 variables, 1/755 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1560 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1/1561 variables, 1/756 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1561 variables, 1/757 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1561 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 145/1706 variables, 138/895 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 04:14:50] [INFO ] Deduced a trap composed of 131 places in 150 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1706 variables, 1/896 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1706 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 8/1714 variables, 4/900 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1714 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 4/1718 variables, 3/903 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1718 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/1718 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1718/1718 variables, and 903 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4365 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 626/626 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 6151ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 3 properties in 2195 ms.
Support contains 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1638/1638 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 1632
Applied a total of 6 rules in 169 ms. Remains 626 /626 variables (removed 0) and now considering 1632/1638 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 626/626 places, 1632/1638 transitions.
RANDOM walk for 40003 steps (8 resets) in 568 ms. (70 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 117 ms. (339 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 184084 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 3
Probabilistic random walk after 184084 steps, saw 119501 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
[2024-05-23 04:14:58] [INFO ] Flow matrix only has 1089 transitions (discarded 543 similar events)
// Phase 1: matrix 1089 rows 626 cols
[2024-05-23 04:14:58] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 04:14:58] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 339/342 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1153/1495 variables, 477/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 268/748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1495 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 62/1557 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1557 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/1558 variables, 1/750 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1558 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1558 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 142/1700 variables, 136/887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1700 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 9/1709 variables, 5/892 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1709 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 6/1715 variables, 4/896 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1715 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1715 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1715/1715 variables, and 896 constraints, problems are : Problem set: 0 solved, 3 unsolved in 945 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 626/626 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 339/342 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1153/1495 variables, 477/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 268/748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1495 variables, 3/751 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1495 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 62/1557 variables, 1/752 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1557 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/1558 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1558 variables, 1/754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1558 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 142/1700 variables, 136/890 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 04:15:00] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1700 variables, 1/891 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1700 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 9/1709 variables, 5/896 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1709 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 6/1715 variables, 4/900 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1715 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1715 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1715/1715 variables, and 900 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2274 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 626/626 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 3273ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1159 ms.
Support contains 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1632/1632 transitions.
Applied a total of 0 rules in 76 ms. Remains 626 /626 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 626/626 places, 1632/1632 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1632/1632 transitions.
Applied a total of 0 rules in 76 ms. Remains 626 /626 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
[2024-05-23 04:15:02] [INFO ] Flow matrix only has 1089 transitions (discarded 543 similar events)
[2024-05-23 04:15:02] [INFO ] Invariant cache hit.
[2024-05-23 04:15:03] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-05-23 04:15:03] [INFO ] Flow matrix only has 1089 transitions (discarded 543 similar events)
[2024-05-23 04:15:03] [INFO ] Invariant cache hit.
[2024-05-23 04:15:03] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 04:15:04] [INFO ] Implicit Places using invariants and state equation in 1674 ms returned []
Implicit Place search using SMT with State Equation took 2022 ms to find 0 implicit places.
[2024-05-23 04:15:04] [INFO ] Redundant transitions in 26 ms returned []
Running 1630 sub problems to find dead transitions.
[2024-05-23 04:15:04] [INFO ] Flow matrix only has 1089 transitions (discarded 543 similar events)
[2024-05-23 04:15:04] [INFO ] Invariant cache hit.
[2024-05-23 04:15:04] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
(s152 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 7.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 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 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 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.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.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/1715 variables, and 2 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/626 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1630 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/626 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 3 (OVERLAPS) 1089/1715 variables, 626/628 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1715 variables, 268/896 constraints. Problems are: Problem set: 0 solved, 1630 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1715/1715 variables, and 2526 constraints, problems are : Problem set: 0 solved, 1630 unsolved in 31276 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 626/626 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1630/1630 constraints, Known Traps: 0/0 constraints]
After SMT, in 68361ms problems are : Problem set: 0 solved, 1630 unsolved
Search for dead transitions found 0 dead transitions in 68376ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70513 ms. Remains : 626/626 places, 1632/1632 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 964 edges and 626 vertex of which 192 / 626 are part of one of the 64 SCC in 0 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 415 transitions
Reduce isomorphic transitions removed 735 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 498 transition count 884
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 485 transition count 884
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 27 place count 485 transition count 808
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 179 place count 409 transition count 808
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 242 place count 346 transition count 745
Iterating global reduction 2 with 63 rules applied. Total rules applied 305 place count 346 transition count 745
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 431 place count 346 transition count 619
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 687 place count 218 transition count 491
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 751 place count 154 transition count 363
Iterating global reduction 3 with 64 rules applied. Total rules applied 815 place count 154 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 816 place count 154 transition count 362
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 879 place count 91 transition count 236
Iterating global reduction 4 with 63 rules applied. Total rules applied 942 place count 91 transition count 236
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1005 place count 28 transition count 110
Iterating global reduction 4 with 63 rules applied. Total rules applied 1068 place count 28 transition count 110
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1131 place count 28 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1131 place count 28 transition count 46
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1133 place count 27 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1135 place count 26 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1139 place count 24 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1142 place count 24 transition count 42
Applied a total of 1142 rules in 32 ms. Remains 24 /626 variables (removed 602) and now considering 42/1632 (removed 1590) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 42 rows 24 cols
[2024-05-23 04:16:13] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 04:16:13] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 04:16:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:16:13] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-23 04:16:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 04:16:13] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 04:16:13] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 04:16:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 04:16:13] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:16:13] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-23 04:16:13] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-23 04:16:13] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-23 04:16:13] [INFO ] After 70ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 163 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 13 factoid took 208 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 108 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 116 ms :[p1, p1, p1]
Product exploration explored 100000 steps with 0 reset in 418 ms.
Product exploration explored 100000 steps with 0 reset in 450 ms.
Support contains 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 1638/1638 transitions.
Applied a total of 0 rules in 33 ms. Remains 626 /626 variables (removed 0) and now considering 1638/1638 (removed 0) transitions.
[2024-05-23 04:16:14] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
// Phase 1: matrix 1092 rows 626 cols
[2024-05-23 04:16:14] [INFO ] Computed 2 invariants in 7 ms
[2024-05-23 04:16:15] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-05-23 04:16:15] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2024-05-23 04:16:15] [INFO ] Invariant cache hit.
[2024-05-23 04:16:15] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 04:16:16] [INFO ] Implicit Places using invariants and state equation in 1612 ms returned []
Implicit Place search using SMT with State Equation took 1967 ms to find 0 implicit places.
Running 1636 sub problems to find dead transitions.
[2024-05-23 04:16:16] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2024-05-23 04:16:16] [INFO ] Invariant cache hit.
[2024-05-23 04:16:16] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/1718 variables, and 2 constraints, problems are : Problem set: 0 solved, 1636 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/626 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1636/1636 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1636 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/626 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
At refinement iteration 3 (OVERLAPS) 1092/1718 variables, 626/628 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1718 variables, 268/896 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1718/1718 variables, and 2532 constraints, problems are : Problem set: 0 solved, 1636 unsolved in 31474 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 626/626 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1636/1636 constraints, Known Traps: 0/0 constraints]
After SMT, in 69041ms problems are : Problem set: 0 solved, 1636 unsolved
Search for dead transitions found 0 dead transitions in 69057ms
Finished structural reductions in LTL mode , in 1 iterations and 71065 ms. Remains : 626/626 places, 1638/1638 transitions.
Treatment of property FunctionPointer-PT-c004-LTLFireability-02 finished in 397065 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((F((p1&&F(G(p1))))&&p0)))'
Support contains 4 out of 791 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 791/791 places, 2050/2050 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 774 transition count 2014
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 774 transition count 2014
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 44 place count 774 transition count 2004
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 61 place count 757 transition count 1968
Iterating global reduction 1 with 17 rules applied. Total rules applied 78 place count 757 transition count 1968
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 82 place count 757 transition count 1964
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 96 place count 743 transition count 1920
Iterating global reduction 2 with 14 rules applied. Total rules applied 110 place count 743 transition count 1920
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 126 place count 727 transition count 1868
Iterating global reduction 2 with 16 rules applied. Total rules applied 142 place count 727 transition count 1868
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 160 place count 709 transition count 1820
Iterating global reduction 2 with 18 rules applied. Total rules applied 178 place count 709 transition count 1820
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 198 place count 689 transition count 1768
Iterating global reduction 2 with 20 rules applied. Total rules applied 218 place count 689 transition count 1768
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 237 place count 670 transition count 1722
Iterating global reduction 2 with 19 rules applied. Total rules applied 256 place count 670 transition count 1722
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 275 place count 651 transition count 1682
Iterating global reduction 2 with 19 rules applied. Total rules applied 294 place count 651 transition count 1682
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 312 place count 633 transition count 1644
Iterating global reduction 2 with 18 rules applied. Total rules applied 330 place count 633 transition count 1644
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 341 place count 622 transition count 1620
Iterating global reduction 2 with 11 rules applied. Total rules applied 352 place count 622 transition count 1620
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 360 place count 614 transition count 1604
Iterating global reduction 2 with 8 rules applied. Total rules applied 368 place count 614 transition count 1604
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 373 place count 609 transition count 1594
Iterating global reduction 2 with 5 rules applied. Total rules applied 378 place count 609 transition count 1594
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 380 place count 607 transition count 1590
Iterating global reduction 2 with 2 rules applied. Total rules applied 382 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 383 place count 606 transition count 1588
Iterating global reduction 2 with 1 rules applied. Total rules applied 384 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 385 place count 605 transition count 1586
Iterating global reduction 2 with 1 rules applied. Total rules applied 386 place count 605 transition count 1586
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 388 place count 605 transition count 1584
Applied a total of 388 rules in 437 ms. Remains 605 /791 variables (removed 186) and now considering 1584/2050 (removed 466) transitions.
[2024-05-23 04:17:26] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2024-05-23 04:17:26] [INFO ] Computed 2 invariants in 12 ms
[2024-05-23 04:17:26] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-05-23 04:17:26] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 04:17:26] [INFO ] Invariant cache hit.
[2024-05-23 04:17:27] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-23 04:17:28] [INFO ] Implicit Places using invariants and state equation in 1412 ms returned []
Implicit Place search using SMT with State Equation took 1716 ms to find 0 implicit places.
[2024-05-23 04:17:28] [INFO ] Redundant transitions in 28 ms returned []
Running 1582 sub problems to find dead transitions.
[2024-05-23 04:17:28] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 04:17:28] [INFO ] Invariant cache hit.
[2024-05-23 04:17:28] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1662 variables, and 2 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 3 (OVERLAPS) 1057/1662 variables, 605/607 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1662 variables, 262/869 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 2451 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 31035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
After SMT, in 69093ms problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 69111ms
Starting structural reductions in SI_LTL mode, iteration 1 : 605/791 places, 1584/2050 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71301 ms. Remains : 605/791 places, 1584/2050 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 358 ms.
Product exploration explored 100000 steps with 0 reset in 446 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 205 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), false, false]
RANDOM walk for 40001 steps (8 resets) in 359 ms. (111 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
[2024-05-23 04:18:38] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 04:18:38] [INFO ] Invariant cache hit.
[2024-05-23 04:18:38] [INFO ] State equation strengthened by 262 read => feed constraints.
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) 382/386 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 845/1231 variables, 386/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1231 variables, 194/581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1231 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 345/1576 variables, 143/724 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1576 variables, 1/725 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1576 variables, 68/793 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1576 variables, 0/793 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 72/1648 variables, 68/861 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1648 variables, 0/861 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/1656 variables, 4/865 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1656 variables, 0/865 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/1662 variables, 4/869 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1662/1662 variables, and 869 constraints, problems are : Problem set: 1 solved, 1 unsolved in 476 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/385 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 776/1161 variables, 385/386 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1161 variables, 65/451 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1161 variables, 0/451 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 414/1575 variables, 143/594 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1575 variables, 197/791 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1575 variables, 1/792 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1575 variables, 0/792 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1576 variables, 1/793 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1576 variables, 1/794 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-23 04:18:40] [INFO ] Deduced a trap composed of 131 places in 135 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1576 variables, 1/795 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1576 variables, 0/795 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 72/1648 variables, 68/863 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1648 variables, 0/863 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1656 variables, 4/867 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1656 variables, 0/867 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1662 variables, 4/871 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1662 variables, 0/871 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1662 variables, 0/871 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 871 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1161 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1661ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 605/605 places, 1584/1584 transitions.
Applied a total of 0 rules in 77 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 605/605 places, 1584/1584 transitions.
RANDOM walk for 40002 steps (8 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 550068 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :0 out of 1
Probabilistic random walk after 550068 steps, saw 357026 distinct states, run finished after 3001 ms. (steps per millisecond=183 ) properties seen :0
[2024-05-23 04:18:43] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 04:18:43] [INFO ] Invariant cache hit.
[2024-05-23 04:18:43] [INFO ] State equation strengthened by 262 read => feed constraints.
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) 383/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 776/1161 variables, 385/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1161 variables, 65/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1161 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 414/1575 variables, 143/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1575 variables, 197/791 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1575 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1576 variables, 1/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1576 variables, 1/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1576 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 72/1648 variables, 68/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1648 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/1656 variables, 4/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1656 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/1662 variables, 4/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1662/1662 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 483 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 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) 383/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 776/1161 variables, 385/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1161 variables, 65/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1161 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 414/1575 variables, 143/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1575 variables, 197/791 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1575 variables, 1/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1575 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1576 variables, 1/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1576 variables, 1/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 04:18:44] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1576 variables, 1/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1576 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 72/1648 variables, 68/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1648 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1656 variables, 4/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1656 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1662 variables, 4/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1662 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1662 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1136 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1635ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 605/605 places, 1584/1584 transitions.
Applied a total of 0 rules in 103 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 605/605 places, 1584/1584 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 605/605 places, 1584/1584 transitions.
Applied a total of 0 rules in 77 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1584 (removed 0) transitions.
[2024-05-23 04:18:45] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 04:18:45] [INFO ] Invariant cache hit.
[2024-05-23 04:18:45] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-23 04:18:45] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 04:18:45] [INFO ] Invariant cache hit.
[2024-05-23 04:18:46] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-23 04:18:47] [INFO ] Implicit Places using invariants and state equation in 1610 ms returned []
Implicit Place search using SMT with State Equation took 1949 ms to find 0 implicit places.
[2024-05-23 04:18:47] [INFO ] Redundant transitions in 25 ms returned []
Running 1582 sub problems to find dead transitions.
[2024-05-23 04:18:47] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 04:18:47] [INFO ] Invariant cache hit.
[2024-05-23 04:18:47] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 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 605/1662 variables, and 2 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 3 (OVERLAPS) 1057/1662 variables, 605/607 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1662 variables, 262/869 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 2451 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 31070 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
After SMT, in 68716ms problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 68730ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70794 ms. Remains : 605/605 places, 1584/1584 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 930 edges and 605 vertex of which 192 / 605 are part of one of the 64 SCC in 0 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 399 transitions
Reduce isomorphic transitions removed 719 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 477 transition count 854
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 466 transition count 854
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 23 place count 466 transition count 787
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 157 place count 399 transition count 787
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 220 place count 336 transition count 724
Iterating global reduction 2 with 63 rules applied. Total rules applied 283 place count 336 transition count 724
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 409 place count 336 transition count 598
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 663 place count 209 transition count 471
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 726 place count 146 transition count 345
Iterating global reduction 3 with 63 rules applied. Total rules applied 789 place count 146 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 790 place count 146 transition count 344
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 790 place count 146 transition count 343
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 792 place count 145 transition count 343
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 854 place count 83 transition count 219
Iterating global reduction 4 with 62 rules applied. Total rules applied 916 place count 83 transition count 219
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 978 place count 21 transition count 95
Iterating global reduction 4 with 62 rules applied. Total rules applied 1040 place count 21 transition count 95
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 4 with 62 rules applied. Total rules applied 1102 place count 21 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1104 place count 20 transition count 34
Applied a total of 1104 rules in 33 ms. Remains 20 /605 variables (removed 585) and now considering 34/1584 (removed 1550) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 34 rows 20 cols
[2024-05-23 04:19:56] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 04:19:56] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 04:19:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:19:56] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 04:19:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 04:19:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:19:56] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 04:19:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 04:19:56] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 04:19:56] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 04:19:56] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 113 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 6 factoid took 159 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), false, false]
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), false, false]
[2024-05-23 04:19:56] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2024-05-23 04:19:56] [INFO ] Computed 2 invariants in 7 ms
[2024-05-23 04:19:57] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-23 04:19:57] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:19:58] [INFO ] [Real]Absence check using state equation in 881 ms returned sat
[2024-05-23 04:19:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 04:19:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 35 ms returned sat
[2024-05-23 04:19:59] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:19:59] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2024-05-23 04:19:59] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-23 04:19:59] [INFO ] [Nat]Added 262 Read/Feed constraints in 53 ms returned sat
[2024-05-23 04:20:00] [INFO ] Computed and/alt/rep : 204/290/202 causal constraints (skipped 853 transitions) in 181 ms.
[2024-05-23 04:20:00] [INFO ] Added : 10 causal constraints over 3 iterations in 427 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 605/605 places, 1584/1584 transitions.
Applied a total of 0 rules in 91 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1584 (removed 0) transitions.
[2024-05-23 04:20:00] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 04:20:00] [INFO ] Invariant cache hit.
[2024-05-23 04:20:00] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-05-23 04:20:00] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 04:20:00] [INFO ] Invariant cache hit.
[2024-05-23 04:20:01] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-23 04:20:02] [INFO ] Implicit Places using invariants and state equation in 1426 ms returned []
Implicit Place search using SMT with State Equation took 1760 ms to find 0 implicit places.
[2024-05-23 04:20:02] [INFO ] Redundant transitions in 25 ms returned []
Running 1582 sub problems to find dead transitions.
[2024-05-23 04:20:02] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 04:20:02] [INFO ] Invariant cache hit.
[2024-05-23 04:20:02] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1662 variables, and 2 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 3 (OVERLAPS) 1057/1662 variables, 605/607 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1662 variables, 262/869 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 2451 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 31089 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
After SMT, in 68293ms problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 68308ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 70194 ms. Remains : 605/605 places, 1584/1584 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 84 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), false, false]
RANDOM walk for 40002 steps (8 resets) in 254 ms. (156 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
[2024-05-23 04:21:11] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 04:21:11] [INFO ] Invariant cache hit.
[2024-05-23 04:21:11] [INFO ] State equation strengthened by 262 read => feed constraints.
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) 382/386 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 845/1231 variables, 386/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1231 variables, 194/581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1231 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf2 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 345/1576 variables, 143/724 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1576 variables, 1/725 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1576 variables, 68/793 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1576 variables, 0/793 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 72/1648 variables, 68/861 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1648 variables, 0/861 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/1656 variables, 4/865 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1656 variables, 0/865 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/1662 variables, 4/869 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1662/1662 variables, and 869 constraints, problems are : Problem set: 1 solved, 1 unsolved in 451 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 383/385 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 776/1161 variables, 385/386 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1161 variables, 65/451 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1161 variables, 0/451 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 414/1575 variables, 143/594 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1575 variables, 197/791 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1575 variables, 1/792 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1575 variables, 0/792 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1576 variables, 1/793 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1576 variables, 1/794 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-23 04:21:12] [INFO ] Deduced a trap composed of 131 places in 150 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1576 variables, 1/795 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1576 variables, 0/795 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 72/1648 variables, 68/863 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1648 variables, 0/863 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1656 variables, 4/867 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1656 variables, 0/867 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1662 variables, 4/871 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1662 variables, 0/871 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1662 variables, 0/871 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 871 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1086 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1563ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 605/605 places, 1584/1584 transitions.
Applied a total of 0 rules in 76 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 605/605 places, 1584/1584 transitions.
RANDOM walk for 40003 steps (8 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 561959 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :0 out of 1
Probabilistic random walk after 561959 steps, saw 364745 distinct states, run finished after 3001 ms. (steps per millisecond=187 ) properties seen :0
[2024-05-23 04:21:15] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 04:21:15] [INFO ] Invariant cache hit.
[2024-05-23 04:21:15] [INFO ] State equation strengthened by 262 read => feed constraints.
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) 383/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 776/1161 variables, 385/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1161 variables, 65/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1161 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 414/1575 variables, 143/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1575 variables, 197/791 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1575 variables, 0/791 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1576 variables, 1/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1576 variables, 1/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1576 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 72/1648 variables, 68/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1648 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/1656 variables, 4/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1656 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/1662 variables, 4/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1662/1662 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 461 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 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) 383/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 776/1161 variables, 385/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1161 variables, 65/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1161 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 414/1575 variables, 143/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1575 variables, 197/791 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1575 variables, 1/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1575 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1576 variables, 1/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1576 variables, 1/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 04:21:16] [INFO ] Deduced a trap composed of 131 places in 143 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1576 variables, 1/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1576 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 72/1648 variables, 68/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1648 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/1656 variables, 4/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1656 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 6/1662 variables, 4/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1662 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1662 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1102 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1580ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 605/605 places, 1584/1584 transitions.
Applied a total of 0 rules in 79 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 605/605 places, 1584/1584 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 605/605 places, 1584/1584 transitions.
Applied a total of 0 rules in 71 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1584 (removed 0) transitions.
[2024-05-23 04:21:17] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 04:21:17] [INFO ] Invariant cache hit.
[2024-05-23 04:21:17] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-23 04:21:17] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 04:21:17] [INFO ] Invariant cache hit.
[2024-05-23 04:21:18] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-23 04:21:19] [INFO ] Implicit Places using invariants and state equation in 1599 ms returned []
Implicit Place search using SMT with State Equation took 1943 ms to find 0 implicit places.
[2024-05-23 04:21:19] [INFO ] Redundant transitions in 24 ms returned []
Running 1582 sub problems to find dead transitions.
[2024-05-23 04:21:19] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-23 04:21:19] [INFO ] Invariant cache hit.
[2024-05-23 04:21:19] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1662 variables, and 2 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 3 (OVERLAPS) 1057/1662 variables, 605/607 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1662 variables, 262/869 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 2451 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 31162 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints]
After SMT, in 68438ms problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 68452ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70503 ms. Remains : 605/605 places, 1584/1584 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 930 edges and 605 vertex of which 192 / 605 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 399 transitions
Reduce isomorphic transitions removed 719 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 477 transition count 854
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 466 transition count 854
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 23 place count 466 transition count 787
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 157 place count 399 transition count 787
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 220 place count 336 transition count 724
Iterating global reduction 2 with 63 rules applied. Total rules applied 283 place count 336 transition count 724
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 409 place count 336 transition count 598
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 663 place count 209 transition count 471
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 726 place count 146 transition count 345
Iterating global reduction 3 with 63 rules applied. Total rules applied 789 place count 146 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 790 place count 146 transition count 344
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 790 place count 146 transition count 343
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 792 place count 145 transition count 343
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 854 place count 83 transition count 219
Iterating global reduction 4 with 62 rules applied. Total rules applied 916 place count 83 transition count 219
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 978 place count 21 transition count 95
Iterating global reduction 4 with 62 rules applied. Total rules applied 1040 place count 21 transition count 95
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 4 with 62 rules applied. Total rules applied 1102 place count 21 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1104 place count 20 transition count 34
Applied a total of 1104 rules in 34 ms. Remains 20 /605 variables (removed 585) and now considering 34/1584 (removed 1550) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 34 rows 20 cols
[2024-05-23 04:22:28] [INFO ] Computed 2 invariants in 0 ms
[2024-05-23 04:22:28] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 04:22:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:22:28] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 04:22:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 04:22:28] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:22:28] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 04:22:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 04:22:28] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 04:22:28] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 04:22:28] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 116 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 10 factoid took 147 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), false, false]
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), false, false]
[2024-05-23 04:22:28] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2024-05-23 04:22:28] [INFO ] Computed 2 invariants in 19 ms
[2024-05-23 04:22:29] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-23 04:22:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-23 04:22:30] [INFO ] [Real]Absence check using state equation in 875 ms returned sat
[2024-05-23 04:22:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 04:22:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 35 ms returned sat
[2024-05-23 04:22:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:22:31] [INFO ] [Nat]Absence check using state equation in 409 ms returned sat
[2024-05-23 04:22:31] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-23 04:22:31] [INFO ] [Nat]Added 262 Read/Feed constraints in 49 ms returned sat
[2024-05-23 04:22:31] [INFO ] Computed and/alt/rep : 204/290/202 causal constraints (skipped 853 transitions) in 95 ms.
[2024-05-23 04:22:32] [INFO ] Added : 10 causal constraints over 3 iterations in 336 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), false, false]
Product exploration explored 100000 steps with 0 reset in 360 ms.
Stack based approach found an accepted trace after 4587 steps with 0 reset with depth 4588 and stack size 4588 in 24 ms.
FORMULA FunctionPointer-PT-c004-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c004-LTLFireability-03 finished in 306616 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((X((p1||G(p2)))||F(p2)||p0))))'
Support contains 4 out of 791 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 791/791 places, 2050/2050 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 777 transition count 2020
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 777 transition count 2020
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 36 place count 777 transition count 2012
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 50 place count 763 transition count 1982
Iterating global reduction 1 with 14 rules applied. Total rules applied 64 place count 763 transition count 1982
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 68 place count 763 transition count 1978
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 79 place count 752 transition count 1944
Iterating global reduction 2 with 11 rules applied. Total rules applied 90 place count 752 transition count 1944
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 101 place count 741 transition count 1912
Iterating global reduction 2 with 11 rules applied. Total rules applied 112 place count 741 transition count 1912
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 126 place count 727 transition count 1876
Iterating global reduction 2 with 14 rules applied. Total rules applied 140 place count 727 transition count 1876
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 157 place count 710 transition count 1826
Iterating global reduction 2 with 17 rules applied. Total rules applied 174 place count 710 transition count 1826
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 190 place count 694 transition count 1784
Iterating global reduction 2 with 16 rules applied. Total rules applied 206 place count 694 transition count 1784
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 222 place count 678 transition count 1750
Iterating global reduction 2 with 16 rules applied. Total rules applied 238 place count 678 transition count 1750
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 253 place count 663 transition count 1718
Iterating global reduction 2 with 15 rules applied. Total rules applied 268 place count 663 transition count 1718
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 278 place count 653 transition count 1696
Iterating global reduction 2 with 10 rules applied. Total rules applied 288 place count 653 transition count 1696
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 298 place count 643 transition count 1676
Iterating global reduction 2 with 10 rules applied. Total rules applied 308 place count 643 transition count 1676
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 314 place count 637 transition count 1664
Iterating global reduction 2 with 6 rules applied. Total rules applied 320 place count 637 transition count 1664
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 322 place count 635 transition count 1660
Iterating global reduction 2 with 2 rules applied. Total rules applied 324 place count 635 transition count 1660
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 325 place count 634 transition count 1658
Iterating global reduction 2 with 1 rules applied. Total rules applied 326 place count 634 transition count 1658
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 327 place count 633 transition count 1656
Iterating global reduction 2 with 1 rules applied. Total rules applied 328 place count 633 transition count 1656
Applied a total of 328 rules in 268 ms. Remains 633 /791 variables (removed 158) and now considering 1656/2050 (removed 394) transitions.
[2024-05-23 04:22:32] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
// Phase 1: matrix 1105 rows 633 cols
[2024-05-23 04:22:32] [INFO ] Computed 2 invariants in 15 ms
[2024-05-23 04:22:33] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-05-23 04:22:33] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2024-05-23 04:22:33] [INFO ] Invariant cache hit.
[2024-05-23 04:22:33] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-23 04:22:35] [INFO ] Implicit Places using invariants and state equation in 1728 ms returned []
Implicit Place search using SMT with State Equation took 2117 ms to find 0 implicit places.
Running 1654 sub problems to find dead transitions.
[2024-05-23 04:22:35] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2024-05-23 04:22:35] [INFO ] Invariant cache hit.
[2024-05-23 04:22:35] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/633 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/633 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 633/1738 variables, and 2 constraints, problems are : Problem set: 0 solved, 1654 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/633 constraints, ReadFeed: 0/271 constraints, PredecessorRefiner: 1654/1654 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1654 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/633 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/633 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/633 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
At refinement iteration 3 (OVERLAPS) 1105/1738 variables, 633/635 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1738 variables, 271/906 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1738/1738 variables, and 2560 constraints, problems are : Problem set: 0 solved, 1654 unsolved in 31511 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 633/633 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 1654/1654 constraints, Known Traps: 0/0 constraints]
After SMT, in 69529ms problems are : Problem set: 0 solved, 1654 unsolved
Search for dead transitions found 0 dead transitions in 69550ms
Starting structural reductions in LTL mode, iteration 1 : 633/791 places, 1656/2050 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71941 ms. Remains : 633/791 places, 1656/2050 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 414 ms.
Product exploration explored 100000 steps with 0 reset in 425 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 139 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 40002 steps (8 resets) in 412 ms. (96 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 148 ms. (268 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 72 ms. (547 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 124988 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 9
Probabilistic random walk after 124988 steps, saw 81148 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
[2024-05-23 04:23:49] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2024-05-23 04:23:49] [INFO ] Invariant cache hit.
[2024-05-23 04:23:49] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 344/348 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1177/1525 variables, 485/489 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1525 variables, 271/760 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1525 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 62/1587 variables, 1/761 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1587 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1/1588 variables, 1/762 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1588 variables, 1/763 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1588 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 149/1737 variables, 142/905 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1737 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 1/1738 variables, 1/906 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1738 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 0/1738 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1738/1738 variables, and 906 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2327 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 633/633 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 344/348 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1177/1525 variables, 485/489 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1525 variables, 271/760 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1525 variables, 9/769 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1525 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 62/1587 variables, 1/770 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1587 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/1588 variables, 1/771 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1588 variables, 1/772 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1588 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 149/1737 variables, 142/914 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 04:23:54] [INFO ] Deduced a trap composed of 131 places in 144 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1737 variables, 1/915 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1737 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 1/1738 variables, 1/916 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1738 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 0/1738 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1738/1738 variables, and 916 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5005 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 633/633 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 7391ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1656/1656 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 633 transition count 1648
Applied a total of 8 rules in 172 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1656 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 633/633 places, 1648/1656 transitions.
RANDOM walk for 40005 steps (8 resets) in 622 ms. (64 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 142 ms. (279 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 70 ms. (563 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 61 ms. (645 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 124044 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 9
Probabilistic random walk after 124044 steps, saw 80536 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
[2024-05-23 04:24:00] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
// Phase 1: matrix 1101 rows 633 cols
[2024-05-23 04:24:00] [INFO ] Computed 2 invariants in 5 ms
[2024-05-23 04:24:00] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 344/348 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1173/1521 variables, 485/489 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1521 variables, 271/760 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1521 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 62/1583 variables, 1/761 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1583 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1/1584 variables, 1/762 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1584 variables, 1/763 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1584 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 148/1732 variables, 141/904 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1732 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 2/1734 variables, 2/906 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1734 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 0/1734 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1734/1734 variables, and 906 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1963 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 633/633 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 344/348 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1173/1521 variables, 485/489 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1521 variables, 271/760 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1521 variables, 9/769 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1521 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 62/1583 variables, 1/770 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1583 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/1584 variables, 1/771 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1584 variables, 1/772 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1584 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 148/1732 variables, 141/913 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 04:24:05] [INFO ] Deduced a trap composed of 131 places in 157 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1732 variables, 1/914 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1732 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 2/1734 variables, 2/916 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1734 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 0/1734 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1734/1734 variables, and 916 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5229 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 633/633 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 7282ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 5762 ms.
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1648/1648 transitions.
Applied a total of 0 rules in 84 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1648 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 633/633 places, 1648/1648 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1648/1648 transitions.
Applied a total of 0 rules in 79 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1648 (removed 0) transitions.
[2024-05-23 04:24:13] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2024-05-23 04:24:13] [INFO ] Invariant cache hit.
[2024-05-23 04:24:14] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-05-23 04:24:14] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2024-05-23 04:24:14] [INFO ] Invariant cache hit.
[2024-05-23 04:24:14] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-23 04:24:16] [INFO ] Implicit Places using invariants and state equation in 1761 ms returned []
Implicit Place search using SMT with State Equation took 2120 ms to find 0 implicit places.
[2024-05-23 04:24:16] [INFO ] Redundant transitions in 25 ms returned []
Running 1646 sub problems to find dead transitions.
[2024-05-23 04:24:16] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2024-05-23 04:24:16] [INFO ] Invariant cache hit.
[2024-05-23 04:24:16] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/633 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/633 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 633/1734 variables, and 2 constraints, problems are : Problem set: 0 solved, 1646 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/633 constraints, ReadFeed: 0/271 constraints, PredecessorRefiner: 1646/1646 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1646 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/633 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/633 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/633 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 3 (OVERLAPS) 1101/1734 variables, 633/635 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1734 variables, 271/906 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1734/1734 variables, and 2552 constraints, problems are : Problem set: 0 solved, 1646 unsolved in 31810 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 633/633 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 1646/1646 constraints, Known Traps: 0/0 constraints]
After SMT, in 69828ms problems are : Problem set: 0 solved, 1646 unsolved
Search for dead transitions found 0 dead transitions in 69843ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72074 ms. Remains : 633/633 places, 1648/1648 transitions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 138 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 1656/1656 transitions.
Applied a total of 0 rules in 17 ms. Remains 633 /633 variables (removed 0) and now considering 1656/1656 (removed 0) transitions.
[2024-05-23 04:25:26] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
// Phase 1: matrix 1105 rows 633 cols
[2024-05-23 04:25:26] [INFO ] Computed 2 invariants in 11 ms
[2024-05-23 04:25:26] [INFO ] Implicit Places using invariants in 405 ms returned []
[2024-05-23 04:25:26] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2024-05-23 04:25:26] [INFO ] Invariant cache hit.
[2024-05-23 04:25:27] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-23 04:25:28] [INFO ] Implicit Places using invariants and state equation in 1741 ms returned []
Implicit Place search using SMT with State Equation took 2149 ms to find 0 implicit places.
Running 1654 sub problems to find dead transitions.
[2024-05-23 04:25:28] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2024-05-23 04:25:28] [INFO ] Invariant cache hit.
[2024-05-23 04:25:28] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/633 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/633 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 633/1738 variables, and 2 constraints, problems are : Problem set: 0 solved, 1654 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/633 constraints, ReadFeed: 0/271 constraints, PredecessorRefiner: 1654/1654 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1654 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/633 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/633 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/633 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
At refinement iteration 3 (OVERLAPS) 1105/1738 variables, 633/635 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1738 variables, 271/906 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1738/1738 variables, and 2560 constraints, problems are : Problem set: 0 solved, 1654 unsolved in 31485 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 633/633 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 1654/1654 constraints, Known Traps: 0/0 constraints]
After SMT, in 70796ms problems are : Problem set: 0 solved, 1654 unsolved
Search for dead transitions found 0 dead transitions in 70814ms
Finished structural reductions in LTL mode , in 1 iterations and 72985 ms. Remains : 633/633 places, 1656/1656 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 145 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 40004 steps (8 resets) in 380 ms. (104 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 143 ms. (277 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 115 ms. (344 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 131072 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 9
Probabilistic random walk after 131072 steps, saw 85096 distinct states, run finished after 3002 ms. (steps per millisecond=43 ) properties seen :0
[2024-05-23 04:26:43] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2024-05-23 04:26:43] [INFO ] Invariant cache hit.
[2024-05-23 04:26:43] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 344/348 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1177/1525 variables, 485/489 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1525 variables, 271/760 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1525 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 62/1587 variables, 1/761 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1587 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1/1588 variables, 1/762 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1588 variables, 1/763 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1588 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 149/1737 variables, 142/905 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1737 variables, 0/905 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 1/1738 variables, 1/906 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1738 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 0/1738 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1738/1738 variables, and 906 constraints, problems are : Problem set: 0 solved, 9 unsolved in 2287 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 633/633 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 344/348 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1177/1525 variables, 485/489 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1525 variables, 271/760 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1525 variables, 9/769 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1525 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 62/1587 variables, 1/770 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1587 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/1588 variables, 1/771 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1588 variables, 1/772 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1588 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 149/1737 variables, 142/914 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 04:26:48] [INFO ] Deduced a trap composed of 131 places in 158 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1737 variables, 1/915 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1737 variables, 0/915 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 1/1738 variables, 1/916 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1738 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 0/1738 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
After SMT solving in domain Int declared 1738/1738 variables, and 916 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 633/633 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 7373ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1656/1656 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 633 transition count 1648
Applied a total of 8 rules in 165 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1656 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 633/633 places, 1648/1656 transitions.
RANDOM walk for 40006 steps (8 resets) in 711 ms. (56 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 128 ms. (310 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 135 ms. (294 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 144942 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 9
Probabilistic random walk after 144942 steps, saw 94098 distinct states, run finished after 3002 ms. (steps per millisecond=48 ) properties seen :0
[2024-05-23 04:26:54] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
// Phase 1: matrix 1101 rows 633 cols
[2024-05-23 04:26:54] [INFO ] Computed 2 invariants in 11 ms
[2024-05-23 04:26:54] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 344/348 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1173/1521 variables, 485/489 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1521 variables, 271/760 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1521 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 62/1583 variables, 1/761 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1583 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1/1584 variables, 1/762 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1584 variables, 1/763 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1584 variables, 0/763 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 148/1732 variables, 141/904 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1732 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 2/1734 variables, 2/906 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1734 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 0/1734 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1734/1734 variables, and 906 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1961 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 633/633 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 344/348 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1173/1521 variables, 485/489 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1521 variables, 271/760 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1521 variables, 9/769 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1521 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 62/1583 variables, 1/770 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1583 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1/1584 variables, 1/771 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1584 variables, 1/772 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1584 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 148/1732 variables, 141/913 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-23 04:26:59] [INFO ] Deduced a trap composed of 131 places in 152 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1732 variables, 1/914 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1732 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 2/1734 variables, 2/916 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1734 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 0/1734 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1734/1734 variables, and 916 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5206 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 633/633 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 7243ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 0 properties in 4803 ms.
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1648/1648 transitions.
Applied a total of 0 rules in 86 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1648 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 633/633 places, 1648/1648 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1648/1648 transitions.
Applied a total of 0 rules in 90 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1648 (removed 0) transitions.
[2024-05-23 04:27:06] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2024-05-23 04:27:06] [INFO ] Invariant cache hit.
[2024-05-23 04:27:06] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-05-23 04:27:06] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2024-05-23 04:27:06] [INFO ] Invariant cache hit.
[2024-05-23 04:27:07] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-23 04:27:08] [INFO ] Implicit Places using invariants and state equation in 1791 ms returned []
Implicit Place search using SMT with State Equation took 2170 ms to find 0 implicit places.
[2024-05-23 04:27:08] [INFO ] Redundant transitions in 27 ms returned []
Running 1646 sub problems to find dead transitions.
[2024-05-23 04:27:08] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2024-05-23 04:27:08] [INFO ] Invariant cache hit.
[2024-05-23 04:27:08] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/633 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/633 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 9.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 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 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 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.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 0.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 1.0)
(s177 0.0)
(s178 1.0)
(s179 1.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 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 633/1734 variables, and 2 constraints, problems are : Problem set: 0 solved, 1646 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/633 constraints, ReadFeed: 0/271 constraints, PredecessorRefiner: 1646/1646 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1646 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/633 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/633 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/633 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 3 (OVERLAPS) 1101/1734 variables, 633/635 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1734 variables, 271/906 constraints. Problems are: Problem set: 0 solved, 1646 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1734/1734 variables, and 2552 constraints, problems are : Problem set: 0 solved, 1646 unsolved in 31612 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 633/633 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 1646/1646 constraints, Known Traps: 0/0 constraints]
After SMT, in 70680ms problems are : Problem set: 0 solved, 1646 unsolved
Search for dead transitions found 0 dead transitions in 70697ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72997 ms. Remains : 633/633 places, 1648/1648 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 972 edges and 633 vertex of which 192 / 633 are part of one of the 64 SCC in 0 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 419 transitions
Reduce isomorphic transitions removed 739 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 505 transition count 899
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 495 transition count 899
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 21 place count 495 transition count 819
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 181 place count 415 transition count 819
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 244 place count 352 transition count 756
Iterating global reduction 2 with 63 rules applied. Total rules applied 307 place count 352 transition count 756
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 433 place count 352 transition count 630
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 691 place count 223 transition count 501
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 755 place count 159 transition count 373
Iterating global reduction 3 with 64 rules applied. Total rules applied 819 place count 159 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 820 place count 159 transition count 372
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 883 place count 96 transition count 246
Iterating global reduction 4 with 63 rules applied. Total rules applied 946 place count 96 transition count 246
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1009 place count 33 transition count 120
Iterating global reduction 4 with 63 rules applied. Total rules applied 1072 place count 33 transition count 120
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1135 place count 33 transition count 57
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1135 place count 33 transition count 56
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1137 place count 32 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1139 place count 31 transition count 55
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1145 place count 28 transition count 55
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1148 place count 28 transition count 52
Applied a total of 1148 rules in 40 ms. Remains 28 /633 variables (removed 605) and now considering 52/1648 (removed 1596) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 52 rows 28 cols
[2024-05-23 04:28:19] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 04:28:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 04:28:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:28:19] [INFO ] After 18ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:8
[2024-05-23 04:28:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 04:28:19] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-23 04:28:19] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-23 04:28:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 04:28:19] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 04:28:19] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-23 04:28:19] [INFO ] After 27ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :9
TRAPS : Iteration 0
[2024-05-23 04:28:19] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
[2024-05-23 04:28:19] [INFO ] After 165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Over-approximation ignoring read arcs solved 0 properties in 285 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 131 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 387 ms.
Product exploration explored 100000 steps with 0 reset in 452 ms.
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 1656/1656 transitions.
Applied a total of 0 rules in 13 ms. Remains 633 /633 variables (removed 0) and now considering 1656/1656 (removed 0) transitions.
[2024-05-23 04:28:21] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
// Phase 1: matrix 1105 rows 633 cols
[2024-05-23 04:28:21] [INFO ] Computed 2 invariants in 10 ms
[2024-05-23 04:28:21] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-05-23 04:28:21] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2024-05-23 04:28:21] [INFO ] Invariant cache hit.
[2024-05-23 04:28:21] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-23 04:28:23] [INFO ] Implicit Places using invariants and state equation in 1736 ms returned []
Implicit Place search using SMT with State Equation took 2106 ms to find 0 implicit places.
Running 1654 sub problems to find dead transitions.
[2024-05-23 04:28:23] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2024-05-23 04:28:23] [INFO ] Invariant cache hit.
[2024-05-23 04:28:23] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/633 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/633 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 633/1738 variables, and 2 constraints, problems are : Problem set: 0 solved, 1654 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/633 constraints, ReadFeed: 0/271 constraints, PredecessorRefiner: 1654/1654 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1654 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/633 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/633 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/633 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
At refinement iteration 3 (OVERLAPS) 1105/1738 variables, 633/635 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1738 variables, 271/906 constraints. Problems are: Problem set: 0 solved, 1654 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1738/1738 variables, and 2560 constraints, problems are : Problem set: 0 solved, 1654 unsolved in 31708 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 633/633 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 1654/1654 constraints, Known Traps: 0/0 constraints]
After SMT, in 70342ms problems are : Problem set: 0 solved, 1654 unsolved
Search for dead transitions found 0 dead transitions in 70361ms
Finished structural reductions in LTL mode , in 1 iterations and 72487 ms. Remains : 633/633 places, 1656/1656 transitions.
Treatment of property FunctionPointer-PT-c004-LTLFireability-04 finished in 420949 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p1)||p0))||F(G((p2&&(p2 U (!p3||G(p2))))))))'
Support contains 6 out of 791 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 791/791 places, 2050/2050 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 778 transition count 2022
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 778 transition count 2022
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 36 place count 778 transition count 2012
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 49 place count 765 transition count 1984
Iterating global reduction 1 with 13 rules applied. Total rules applied 62 place count 765 transition count 1984
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 66 place count 765 transition count 1980
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 77 place count 754 transition count 1944
Iterating global reduction 2 with 11 rules applied. Total rules applied 88 place count 754 transition count 1944
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 101 place count 741 transition count 1900
Iterating global reduction 2 with 13 rules applied. Total rules applied 114 place count 741 transition count 1900
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 129 place count 726 transition count 1858
Iterating global reduction 2 with 15 rules applied. Total rules applied 144 place count 726 transition count 1858
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 160 place count 710 transition count 1816
Iterating global reduction 2 with 16 rules applied. Total rules applied 176 place count 710 transition count 1816
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 191 place count 695 transition count 1782
Iterating global reduction 2 with 15 rules applied. Total rules applied 206 place count 695 transition count 1782
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 221 place count 680 transition count 1752
Iterating global reduction 2 with 15 rules applied. Total rules applied 236 place count 680 transition count 1752
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 250 place count 666 transition count 1724
Iterating global reduction 2 with 14 rules applied. Total rules applied 264 place count 666 transition count 1724
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 272 place count 658 transition count 1708
Iterating global reduction 2 with 8 rules applied. Total rules applied 280 place count 658 transition count 1708
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 285 place count 653 transition count 1698
Iterating global reduction 2 with 5 rules applied. Total rules applied 290 place count 653 transition count 1698
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 292 place count 651 transition count 1694
Iterating global reduction 2 with 2 rules applied. Total rules applied 294 place count 651 transition count 1694
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 304 place count 651 transition count 1684
Applied a total of 304 rules in 438 ms. Remains 651 /791 variables (removed 140) and now considering 1684/2050 (removed 366) transitions.
[2024-05-23 04:29:34] [INFO ] Flow matrix only has 1126 transitions (discarded 558 similar events)
// Phase 1: matrix 1126 rows 651 cols
[2024-05-23 04:29:34] [INFO ] Computed 2 invariants in 19 ms
[2024-05-23 04:29:34] [INFO ] Implicit Places using invariants in 333 ms returned []
[2024-05-23 04:29:34] [INFO ] Flow matrix only has 1126 transitions (discarded 558 similar events)
[2024-05-23 04:29:34] [INFO ] Invariant cache hit.
[2024-05-23 04:29:34] [INFO ] State equation strengthened by 277 read => feed constraints.
[2024-05-23 04:29:36] [INFO ] Implicit Places using invariants and state equation in 1622 ms returned []
Implicit Place search using SMT with State Equation took 1957 ms to find 0 implicit places.
[2024-05-23 04:29:36] [INFO ] Redundant transitions in 28 ms returned []
Running 1682 sub problems to find dead transitions.
[2024-05-23 04:29:36] [INFO ] Flow matrix only has 1126 transitions (discarded 558 similar events)
[2024-05-23 04:29:36] [INFO ] Invariant cache hit.
[2024-05-23 04:29:36] [INFO ] State equation strengthened by 277 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/651 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1682 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/651 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1682 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 651/1777 variables, and 2 constraints, problems are : Problem set: 0 solved, 1682 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/651 constraints, ReadFeed: 0/277 constraints, PredecessorRefiner: 1682/1682 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1682 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/651 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1682 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/651 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1682 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/651 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1682 unsolved
At refinement iteration 3 (OVERLAPS) 1126/1777 variables, 651/653 constraints. Problems are: Problem set: 0 solved, 1682 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1777 variables, 277/930 constraints. Problems are: Problem set: 0 solved, 1682 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1777/1777 variables, and 2612 constraints, problems are : Problem set: 0 solved, 1682 unsolved in 31650 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 651/651 constraints, ReadFeed: 277/277 constraints, PredecessorRefiner: 1682/1682 constraints, Known Traps: 0/0 constraints]
After SMT, in 70334ms problems are : Problem set: 0 solved, 1682 unsolved
Search for dead transitions found 0 dead transitions in 70352ms
Starting structural reductions in SI_LTL mode, iteration 1 : 651/791 places, 1684/2050 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72788 ms. Remains : 651/791 places, 1684/2050 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 445 ms.
Product exploration explored 100000 steps with 0 reset in 458 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 123 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1))]
RANDOM walk for 40008 steps (8 resets) in 201 ms. (198 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (9 resets) in 98 ms. (404 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 119 ms. (333 steps per ms) remains 4/4 properties
[2024-05-23 04:30:47] [INFO ] Flow matrix only has 1126 transitions (discarded 558 similar events)
[2024-05-23 04:30:47] [INFO ] Invariant cache hit.
[2024-05-23 04:30:47] [INFO ] State equation strengthened by 277 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 366/383 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1145/1528 variables, 474/499 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1528 variables, 270/769 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1528 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 62/1590 variables, 1/770 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1590 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf2 is UNSAT
At refinement iteration 11 (OVERLAPS) 153/1743 variables, 141/911 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1743 variables, 0/911 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 21/1764 variables, 10/921 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1764 variables, 0/921 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 13/1777 variables, 9/930 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1777 variables, 0/930 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1777 variables, 0/930 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1777/1777 variables, and 930 constraints, problems are : Problem set: 1 solved, 3 unsolved in 880 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 651/651 constraints, ReadFeed: 277/277 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 366/383 variables, 17/18 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 7/25 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1145/1528 variables, 474/499 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1528 variables, 270/769 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1528 variables, 3/772 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1528 variables, 0/772 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 62/1590 variables, 1/773 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1590 variables, 0/773 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 153/1743 variables, 141/914 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1743 variables, 0/914 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 21/1764 variables, 10/924 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1764 variables, 0/924 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 13/1777 variables, 9/933 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1777 variables, 0/933 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1777 variables, 0/933 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1777/1777 variables, and 933 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1573 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 651/651 constraints, ReadFeed: 277/277 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 2479ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 548 ms.
Support contains 2 out of 651 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 651/651 places, 1684/1684 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 648 transition count 1678
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 648 transition count 1678
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 645 transition count 1672
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 645 transition count 1672
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 642 transition count 1662
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 642 transition count 1662
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 639 transition count 1656
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 639 transition count 1656
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 636 transition count 1650
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 636 transition count 1650
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 633 transition count 1644
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 633 transition count 1644
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 630 transition count 1638
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 630 transition count 1638
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 627 transition count 1632
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 627 transition count 1632
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 624 transition count 1624
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 624 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 623 transition count 1622
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 623 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 622 transition count 1620
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 622 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 621 transition count 1618
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 621 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 620 transition count 1616
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 620 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 619 transition count 1614
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 619 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 618 transition count 1612
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 618 transition count 1612
Applied a total of 66 rules in 305 ms. Remains 618 /651 variables (removed 33) and now considering 1612/1684 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 307 ms. Remains : 618/651 places, 1612/1684 transitions.
RANDOM walk for 40001 steps (8 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 538452 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :0 out of 1
Probabilistic random walk after 538452 steps, saw 349487 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
[2024-05-23 04:30:54] [INFO ] Flow matrix only has 1076 transitions (discarded 536 similar events)
// Phase 1: matrix 1076 rows 618 cols
[2024-05-23 04:30:54] [INFO ] Computed 2 invariants in 8 ms
[2024-05-23 04:30:54] [INFO ] State equation strengthened by 266 read => feed constraints.
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) 335/337 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1136/1473 variables, 470/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1473 variables, 266/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1473 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/1535 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1535 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1536 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1536 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1536 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 139/1675 variables, 134/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1675 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/1687 variables, 6/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1687 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 7/1694 variables, 5/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1694 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1694 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1694/1694 variables, and 886 constraints, problems are : Problem set: 0 solved, 1 unsolved in 542 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 266/266 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) 335/337 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1136/1473 variables, 470/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1473 variables, 266/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1473 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1473 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1535 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1535 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1536 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1536 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1536 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 139/1675 variables, 134/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 04:30:55] [INFO ] Deduced a trap composed of 131 places in 152 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1675 variables, 1/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1675 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 12/1687 variables, 6/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1687 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 7/1694 variables, 5/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1694 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1694 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 888 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1254 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1829ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 16053 steps, including 763 resets, run visited all 1 properties in 39 ms. (steps per millisecond=411 )
Parikh walk visited 1 properties in 43 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 12 factoid took 262 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 4 out of 651 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 651/651 places, 1684/1684 transitions.
Applied a total of 0 rules in 87 ms. Remains 651 /651 variables (removed 0) and now considering 1684/1684 (removed 0) transitions.
[2024-05-23 04:30:56] [INFO ] Flow matrix only has 1126 transitions (discarded 558 similar events)
// Phase 1: matrix 1126 rows 651 cols
[2024-05-23 04:30:56] [INFO ] Computed 2 invariants in 14 ms
[2024-05-23 04:30:57] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-23 04:30:57] [INFO ] Flow matrix only has 1126 transitions (discarded 558 similar events)
[2024-05-23 04:30:57] [INFO ] Invariant cache hit.
[2024-05-23 04:30:57] [INFO ] State equation strengthened by 277 read => feed constraints.
[2024-05-23 04:30:58] [INFO ] Implicit Places using invariants and state equation in 1591 ms returned []
Implicit Place search using SMT with State Equation took 1899 ms to find 0 implicit places.
[2024-05-23 04:30:58] [INFO ] Redundant transitions in 25 ms returned []
Running 1682 sub problems to find dead transitions.
[2024-05-23 04:30:58] [INFO ] Flow matrix only has 1126 transitions (discarded 558 similar events)
[2024-05-23 04:30:58] [INFO ] Invariant cache hit.
[2024-05-23 04:30:58] [INFO ] State equation strengthened by 277 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/651 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1682 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/651 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1682 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 651/1777 variables, and 2 constraints, problems are : Problem set: 0 solved, 1682 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/651 constraints, ReadFeed: 0/277 constraints, PredecessorRefiner: 1682/1682 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1682 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/651 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1682 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/651 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1682 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/651 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1682 unsolved
At refinement iteration 3 (OVERLAPS) 1126/1777 variables, 651/653 constraints. Problems are: Problem set: 0 solved, 1682 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1777 variables, 277/930 constraints. Problems are: Problem set: 0 solved, 1682 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1777/1777 variables, and 2612 constraints, problems are : Problem set: 0 solved, 1682 unsolved in 31667 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 651/651 constraints, ReadFeed: 277/277 constraints, PredecessorRefiner: 1682/1682 constraints, Known Traps: 0/0 constraints]
After SMT, in 70920ms problems are : Problem set: 0 solved, 1682 unsolved
Search for dead transitions found 0 dead transitions in 70938ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 72959 ms. Remains : 651/651 places, 1684/1684 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 p2), (X p2), (X p0), (X (X p2)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 90 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
RANDOM walk for 40001 steps (9 resets) in 418 ms. (95 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 1/2 properties
[2024-05-23 04:32:10] [INFO ] Flow matrix only has 1126 transitions (discarded 558 similar events)
[2024-05-23 04:32:10] [INFO ] Invariant cache hit.
[2024-05-23 04:32:10] [INFO ] State equation strengthened by 277 read => feed constraints.
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) 13/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/48 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 556/604 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/604 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/604 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 943/1547 variables, 472/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1547 variables, 267/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1547 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1609 variables, 1/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1609 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 144/1753 variables, 136/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1753 variables, 0/916 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 20/1773 variables, 10/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1773 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/1777 variables, 4/930 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1777 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1777 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1777/1777 variables, and 930 constraints, problems are : Problem set: 0 solved, 1 unsolved in 492 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 651/651 constraints, ReadFeed: 277/277 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) 13/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/48 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 556/604 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/604 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/604 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/604 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 943/1547 variables, 472/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1547 variables, 267/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1547 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1609 variables, 1/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1609 variables, 0/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 144/1753 variables, 136/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1753 variables, 0/917 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 20/1773 variables, 10/927 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1773 variables, 0/927 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/1777 variables, 4/931 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1777 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1777 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1777/1777 variables, and 931 constraints, problems are : Problem set: 0 solved, 1 unsolved in 548 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 651/651 constraints, ReadFeed: 277/277 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1054ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 651 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 651/651 places, 1684/1684 transitions.
Graph (complete) has 2810 edges and 651 vertex of which 459 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 459 transition count 1300
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 388 place count 456 transition count 1294
Iterating global reduction 1 with 3 rules applied. Total rules applied 391 place count 456 transition count 1294
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 394 place count 453 transition count 1288
Iterating global reduction 1 with 3 rules applied. Total rules applied 397 place count 453 transition count 1288
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 400 place count 450 transition count 1278
Iterating global reduction 1 with 3 rules applied. Total rules applied 403 place count 450 transition count 1278
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 406 place count 447 transition count 1272
Iterating global reduction 1 with 3 rules applied. Total rules applied 409 place count 447 transition count 1272
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 412 place count 444 transition count 1266
Iterating global reduction 1 with 3 rules applied. Total rules applied 415 place count 444 transition count 1266
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 418 place count 441 transition count 1260
Iterating global reduction 1 with 3 rules applied. Total rules applied 421 place count 441 transition count 1260
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 424 place count 438 transition count 1252
Iterating global reduction 1 with 3 rules applied. Total rules applied 427 place count 438 transition count 1252
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 430 place count 435 transition count 1246
Iterating global reduction 1 with 3 rules applied. Total rules applied 433 place count 435 transition count 1246
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 436 place count 432 transition count 1240
Iterating global reduction 1 with 3 rules applied. Total rules applied 439 place count 432 transition count 1240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 440 place count 431 transition count 1238
Iterating global reduction 1 with 1 rules applied. Total rules applied 441 place count 431 transition count 1238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 442 place count 430 transition count 1236
Iterating global reduction 1 with 1 rules applied. Total rules applied 443 place count 430 transition count 1236
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 444 place count 429 transition count 1234
Iterating global reduction 1 with 1 rules applied. Total rules applied 445 place count 429 transition count 1234
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 446 place count 428 transition count 1232
Iterating global reduction 1 with 1 rules applied. Total rules applied 447 place count 428 transition count 1232
Applied a total of 447 rules in 168 ms. Remains 428 /651 variables (removed 223) and now considering 1232/1684 (removed 452) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 428/651 places, 1232/1684 transitions.
RANDOM walk for 40006 steps (8 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 601092 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :0 out of 1
Probabilistic random walk after 601092 steps, saw 368579 distinct states, run finished after 3002 ms. (steps per millisecond=200 ) properties seen :0
[2024-05-23 04:32:14] [INFO ] Flow matrix only has 697 transitions (discarded 535 similar events)
// Phase 1: matrix 697 rows 428 cols
[2024-05-23 04:32:14] [INFO ] Computed 3 invariants in 7 ms
[2024-05-23 04:32:14] [INFO ] State equation strengthened by 77 read => feed constraints.
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) 11/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 349/362 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 606/968 variables, 334/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/968 variables, 73/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/968 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 62/1030 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1030 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 74/1104 variables, 69/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1104 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/1116 variables, 6/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1116 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 9/1125 variables, 6/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1125 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1125 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1125/1125 variables, and 508 constraints, problems are : Problem set: 0 solved, 1 unsolved in 317 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 428/428 constraints, ReadFeed: 77/77 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) 11/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 349/362 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/362 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 606/968 variables, 334/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/968 variables, 73/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/968 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/968 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 62/1030 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1030 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 74/1104 variables, 69/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1104 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/1116 variables, 6/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1116 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 9/1125 variables, 6/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1125 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1125 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1125/1125 variables, and 509 constraints, problems are : Problem set: 0 solved, 1 unsolved in 334 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 428/428 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 669ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1232/1232 transitions.
Applied a total of 0 rules in 51 ms. Remains 428 /428 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 428/428 places, 1232/1232 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 1232/1232 transitions.
Applied a total of 0 rules in 56 ms. Remains 428 /428 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
[2024-05-23 04:32:15] [INFO ] Flow matrix only has 697 transitions (discarded 535 similar events)
[2024-05-23 04:32:15] [INFO ] Invariant cache hit.
[2024-05-23 04:32:15] [INFO ] Implicit Places using invariants in 323 ms returned []
[2024-05-23 04:32:15] [INFO ] Flow matrix only has 697 transitions (discarded 535 similar events)
[2024-05-23 04:32:15] [INFO ] Invariant cache hit.
[2024-05-23 04:32:15] [INFO ] State equation strengthened by 77 read => feed constraints.
[2024-05-23 04:32:16] [INFO ] Implicit Places using invariants and state equation in 1285 ms returned []
Implicit Place search using SMT with State Equation took 1610 ms to find 0 implicit places.
[2024-05-23 04:32:16] [INFO ] Redundant transitions in 17 ms returned []
Running 1230 sub problems to find dead transitions.
[2024-05-23 04:32:16] [INFO ] Flow matrix only has 697 transitions (discarded 535 similar events)
[2024-05-23 04:32:16] [INFO ] Invariant cache hit.
[2024-05-23 04:32:16] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
[2024-05-23 04:32:30] [INFO ] Deduced a trap composed of 131 places in 148 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/428 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
At refinement iteration 3 (OVERLAPS) 697/1125 variables, 428/432 constraints. Problems are: Problem set: 0 solved, 1230 unsolved
SMT process timed out in 34324ms, After SMT, problems are : Problem set: 0 solved, 1230 unsolved
Search for dead transitions found 0 dead transitions in 34335ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36031 ms. Remains : 428/428 places, 1232/1232 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 535 transitions
Reduce isomorphic transitions removed 535 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 551 rules applied. Total rules applied 551 place count 428 transition count 681
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 567 place count 412 transition count 681
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 71 Pre rules applied. Total rules applied 567 place count 412 transition count 610
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 709 place count 341 transition count 610
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 256 rules applied. Total rules applied 965 place count 213 transition count 482
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1029 place count 149 transition count 354
Iterating global reduction 2 with 64 rules applied. Total rules applied 1093 place count 149 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1094 place count 149 transition count 353
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1157 place count 86 transition count 227
Iterating global reduction 3 with 63 rules applied. Total rules applied 1220 place count 86 transition count 227
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1283 place count 23 transition count 101
Iterating global reduction 3 with 63 rules applied. Total rules applied 1346 place count 23 transition count 101
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1409 place count 23 transition count 38
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1409 place count 23 transition count 37
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1411 place count 22 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1413 place count 21 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1415 place count 20 transition count 36
Applied a total of 1415 rules in 23 ms. Remains 20 /428 variables (removed 408) and now considering 36/1232 (removed 1196) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 36 rows 20 cols
[2024-05-23 04:32:51] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 04:32:51] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 04:32:51] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 04:32:51] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 04:32:51] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 04:32:51] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 04:32:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 04:32:51] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 04:32:51] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 04:32:51] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 04:32:51] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 103 ms.
Knowledge obtained : [(AND p0 p2), (X p2), (X p0), (X (X p2)), (X (X p0))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 5 factoid took 116 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 437 ms.
Product exploration explored 100000 steps with 0 reset in 493 ms.
Support contains 4 out of 651 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 651/651 places, 1684/1684 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 649 transition count 1680
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 649 transition count 1680
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 647 transition count 1676
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 647 transition count 1676
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 645 transition count 1670
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 645 transition count 1670
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 643 transition count 1666
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 643 transition count 1666
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 641 transition count 1662
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 641 transition count 1662
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 639 transition count 1658
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 639 transition count 1658
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 637 transition count 1652
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 637 transition count 1652
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 635 transition count 1648
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 635 transition count 1648
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 633 transition count 1644
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 633 transition count 1644
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 632 transition count 1642
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 632 transition count 1642
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 631 transition count 1640
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 631 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 630 transition count 1638
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 630 transition count 1638
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 629 transition count 1636
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 629 transition count 1636
Applied a total of 44 rules in 294 ms. Remains 629 /651 variables (removed 22) and now considering 1636/1684 (removed 48) transitions.
[2024-05-23 04:32:52] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
// Phase 1: matrix 1093 rows 629 cols
[2024-05-23 04:32:52] [INFO ] Computed 2 invariants in 10 ms
[2024-05-23 04:32:53] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-05-23 04:32:53] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
[2024-05-23 04:32:53] [INFO ] Invariant cache hit.
[2024-05-23 04:32:53] [INFO ] State equation strengthened by 270 read => feed constraints.
[2024-05-23 04:32:54] [INFO ] Implicit Places using invariants and state equation in 1719 ms returned []
Implicit Place search using SMT with State Equation took 2110 ms to find 0 implicit places.
[2024-05-23 04:32:54] [INFO ] Redundant transitions in 24 ms returned []
Running 1634 sub problems to find dead transitions.
[2024-05-23 04:32:54] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
[2024-05-23 04:32:54] [INFO ] Invariant cache hit.
[2024-05-23 04:32:54] [INFO ] State equation strengthened by 270 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/629 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/629 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 629/1722 variables, and 2 constraints, problems are : Problem set: 0 solved, 1634 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/629 constraints, ReadFeed: 0/270 constraints, PredecessorRefiner: 1634/1634 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1634 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/629 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/629 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/629 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 3 (OVERLAPS) 1093/1722 variables, 629/631 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1722 variables, 270/901 constraints. Problems are: Problem set: 0 solved, 1634 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1722/1722 variables, and 2535 constraints, problems are : Problem set: 0 solved, 1634 unsolved in 31623 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 629/629 constraints, ReadFeed: 270/270 constraints, PredecessorRefiner: 1634/1634 constraints, Known Traps: 0/0 constraints]
After SMT, in 70120ms problems are : Problem set: 0 solved, 1634 unsolved
Search for dead transitions found 0 dead transitions in 70137ms
Starting structural reductions in SI_LTL mode, iteration 1 : 629/651 places, 1636/1684 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72573 ms. Remains : 629/651 places, 1636/1684 transitions.
Treatment of property FunctionPointer-PT-c004-LTLFireability-06 finished in 271483 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)||X(X(G(p1))))))'
Support contains 4 out of 791 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 791/791 places, 2050/2050 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 775 transition count 2016
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 775 transition count 2016
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 42 place count 775 transition count 2006
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 58 place count 759 transition count 1974
Iterating global reduction 1 with 16 rules applied. Total rules applied 74 place count 759 transition count 1974
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 78 place count 759 transition count 1970
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 91 place count 746 transition count 1930
Iterating global reduction 2 with 13 rules applied. Total rules applied 104 place count 746 transition count 1930
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 119 place count 731 transition count 1880
Iterating global reduction 2 with 15 rules applied. Total rules applied 134 place count 731 transition count 1880
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 151 place count 714 transition count 1834
Iterating global reduction 2 with 17 rules applied. Total rules applied 168 place count 714 transition count 1834
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 187 place count 695 transition count 1784
Iterating global reduction 2 with 19 rules applied. Total rules applied 206 place count 695 transition count 1784
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 224 place count 677 transition count 1740
Iterating global reduction 2 with 18 rules applied. Total rules applied 242 place count 677 transition count 1740
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 260 place count 659 transition count 1702
Iterating global reduction 2 with 18 rules applied. Total rules applied 278 place count 659 transition count 1702
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 296 place count 641 transition count 1664
Iterating global reduction 2 with 18 rules applied. Total rules applied 314 place count 641 transition count 1664
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 325 place count 630 transition count 1640
Iterating global reduction 2 with 11 rules applied. Total rules applied 336 place count 630 transition count 1640
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 344 place count 622 transition count 1624
Iterating global reduction 2 with 8 rules applied. Total rules applied 352 place count 622 transition count 1624
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 357 place count 617 transition count 1614
Iterating global reduction 2 with 5 rules applied. Total rules applied 362 place count 617 transition count 1614
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 364 place count 615 transition count 1610
Iterating global reduction 2 with 2 rules applied. Total rules applied 366 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 367 place count 614 transition count 1608
Iterating global reduction 2 with 1 rules applied. Total rules applied 368 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 369 place count 613 transition count 1606
Iterating global reduction 2 with 1 rules applied. Total rules applied 370 place count 613 transition count 1606
Applied a total of 370 rules in 263 ms. Remains 613 /791 variables (removed 178) and now considering 1606/2050 (removed 444) transitions.
[2024-05-23 04:34:05] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2024-05-23 04:34:05] [INFO ] Computed 2 invariants in 9 ms
[2024-05-23 04:34:05] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-05-23 04:34:05] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-23 04:34:05] [INFO ] Invariant cache hit.
[2024-05-23 04:34:05] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 04:34:07] [INFO ] Implicit Places using invariants and state equation in 1736 ms returned []
Implicit Place search using SMT with State Equation took 2041 ms to find 0 implicit places.
Running 1604 sub problems to find dead transitions.
[2024-05-23 04:34:07] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-23 04:34:07] [INFO ] Invariant cache hit.
[2024-05-23 04:34:07] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 613/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/613 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 3 (OVERLAPS) 1072/1685 variables, 613/615 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/880 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2484 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 31104 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 0/0 constraints]
After SMT, in 68884ms problems are : Problem set: 0 solved, 1604 unsolved
Search for dead transitions found 0 dead transitions in 68903ms
Starting structural reductions in LTL mode, iteration 1 : 613/791 places, 1606/2050 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71213 ms. Remains : 613/791 places, 1606/2050 transitions.
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 419 ms.
Product exploration explored 100000 steps with 0 reset in 427 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 85 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 40005 steps (8 resets) in 234 ms. (170 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 187917 steps, run timeout after 3006 ms. (steps per millisecond=62 ) properties seen :0 out of 3
Probabilistic random walk after 187917 steps, saw 121990 distinct states, run finished after 3006 ms. (steps per millisecond=62 ) properties seen :0
[2024-05-23 04:35:20] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-23 04:35:20] [INFO ] Invariant cache hit.
[2024-05-23 04:35:20] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 537/541 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/541 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 939/1480 variables, 472/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1480 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1480 variables, 265/742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1480 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 62/1542 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1542 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 137/1679 variables, 133/876 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1679 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 5/1684 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1684 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/1685 variables, 1/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1685 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/1685 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1685/1685 variables, and 880 constraints, problems are : Problem set: 0 solved, 3 unsolved in 760 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 537/541 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/541 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 939/1480 variables, 472/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1480 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1480 variables, 265/742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1480 variables, 3/745 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1480 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 62/1542 variables, 1/746 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 04:35:22] [INFO ] Deduced a trap composed of 135 places in 148 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1542 variables, 1/747 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1542 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 137/1679 variables, 133/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1679 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 5/1684 variables, 3/883 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1684 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1/1685 variables, 1/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1685 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1685 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 884 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2078 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 2866ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 2 properties in 306 ms.
Support contains 2 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 613 transition count 1602
Applied a total of 4 rules in 154 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1606 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 613/613 places, 1602/1606 transitions.
RANDOM walk for 40003 steps (8 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 552133 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :0 out of 1
Probabilistic random walk after 552133 steps, saw 358366 distinct states, run finished after 3001 ms. (steps per millisecond=183 ) properties seen :0
[2024-05-23 04:35:27] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 613 cols
[2024-05-23 04:35:27] [INFO ] Computed 2 invariants in 16 ms
[2024-05-23 04:35:27] [INFO ] State equation strengthened by 265 read => feed constraints.
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) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1537 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1537 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1538 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 139/1677 variables, 135/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1677 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/1682 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/1683 variables, 1/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1683 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1683 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1683/1683 variables, and 880 constraints, problems are : Problem set: 0 solved, 1 unsolved in 439 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 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) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1475 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1537 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1537 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1538 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 139/1677 variables, 135/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 04:35:28] [INFO ] Deduced a trap composed of 139 places in 163 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1677 variables, 1/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1677 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/1682 variables, 3/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1682 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1683 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1683 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1683 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 882 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1159 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1640ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 2 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1602/1602 transitions.
Applied a total of 0 rules in 73 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1602 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 613/613 places, 1602/1602 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1602/1602 transitions.
Applied a total of 0 rules in 73 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1602 (removed 0) transitions.
[2024-05-23 04:35:29] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-23 04:35:29] [INFO ] Invariant cache hit.
[2024-05-23 04:35:29] [INFO ] Implicit Places using invariants in 335 ms returned []
[2024-05-23 04:35:29] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-23 04:35:29] [INFO ] Invariant cache hit.
[2024-05-23 04:35:29] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 04:35:30] [INFO ] Implicit Places using invariants and state equation in 1601 ms returned []
Implicit Place search using SMT with State Equation took 1944 ms to find 0 implicit places.
[2024-05-23 04:35:30] [INFO ] Redundant transitions in 25 ms returned []
Running 1600 sub problems to find dead transitions.
[2024-05-23 04:35:30] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-23 04:35:30] [INFO ] Invariant cache hit.
[2024-05-23 04:35:31] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 613/1683 variables, and 2 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/613 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 3 (OVERLAPS) 1070/1683 variables, 613/615 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1683 variables, 265/880 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 2480 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 31146 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 0/0 constraints]
After SMT, in 68942ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 68957ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71011 ms. Remains : 613/613 places, 1602/1602 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 942 edges and 613 vertex of which 192 / 613 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 404 transitions
Reduce isomorphic transitions removed 724 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 485 transition count 868
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 475 transition count 868
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 21 place count 475 transition count 795
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 167 place count 402 transition count 795
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 230 place count 339 transition count 732
Iterating global reduction 2 with 63 rules applied. Total rules applied 293 place count 339 transition count 732
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 419 place count 339 transition count 606
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 673 place count 212 transition count 479
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 148 transition count 351
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 148 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 148 transition count 350
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 85 transition count 224
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 85 transition count 224
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 22 transition count 98
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 22 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 22 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 22 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1121 place count 20 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1122 place count 20 transition count 32
Applied a total of 1122 rules in 38 ms. Remains 20 /613 variables (removed 593) and now considering 32/1602 (removed 1570) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 32 rows 20 cols
[2024-05-23 04:36:39] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 04:36:40] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 04:36:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 11 ms returned sat
[2024-05-23 04:36:40] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 04:36:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 04:36:40] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 04:36:40] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 04:36:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 04:36:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:36:40] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 04:36:40] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 04:36:40] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 04:36:40] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 147 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 147 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Applied a total of 0 rules in 17 ms. Remains 613 /613 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
[2024-05-23 04:36:40] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2024-05-23 04:36:40] [INFO ] Computed 2 invariants in 18 ms
[2024-05-23 04:36:40] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-23 04:36:40] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-23 04:36:40] [INFO ] Invariant cache hit.
[2024-05-23 04:36:41] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 04:36:42] [INFO ] Implicit Places using invariants and state equation in 1762 ms returned []
Implicit Place search using SMT with State Equation took 2063 ms to find 0 implicit places.
Running 1604 sub problems to find dead transitions.
[2024-05-23 04:36:42] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-23 04:36:42] [INFO ] Invariant cache hit.
[2024-05-23 04:36:42] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 613/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/613 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 3 (OVERLAPS) 1072/1685 variables, 613/615 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/880 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2484 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 31310 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 0/0 constraints]
After SMT, in 69293ms problems are : Problem set: 0 solved, 1604 unsolved
Search for dead transitions found 0 dead transitions in 69309ms
Finished structural reductions in LTL mode , in 1 iterations and 71395 ms. Remains : 613/613 places, 1606/1606 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 104 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 40002 steps (8 resets) in 375 ms. (106 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
[2024-05-23 04:37:52] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-23 04:37:52] [INFO ] Invariant cache hit.
[2024-05-23 04:37:52] [INFO ] State equation strengthened by 265 read => feed constraints.
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) 335/337 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1140/1477 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1539 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1539 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1540 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1540 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 139/1679 variables, 135/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1679 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/1684 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1684 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/1685 variables, 1/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1685 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1685 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1685/1685 variables, and 880 constraints, problems are : Problem set: 0 solved, 1 unsolved in 472 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 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) 335/337 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1140/1477 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1477 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1477 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1477 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1539 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1539 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1540 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1540 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1540 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 139/1679 variables, 135/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 04:37:53] [INFO ] Deduced a trap composed of 131 places in 140 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1679 variables, 1/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1679 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/1684 variables, 3/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1684 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1685 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1685 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1685 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 882 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1177 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1675ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 2 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 613 transition count 1602
Applied a total of 4 rules in 152 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1606 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 613/613 places, 1602/1606 transitions.
RANDOM walk for 40002 steps (8 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 545061 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :0 out of 1
Probabilistic random walk after 545061 steps, saw 353777 distinct states, run finished after 3003 ms. (steps per millisecond=181 ) properties seen :0
[2024-05-23 04:37:57] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 613 cols
[2024-05-23 04:37:57] [INFO ] Computed 2 invariants in 15 ms
[2024-05-23 04:37:57] [INFO ] State equation strengthened by 265 read => feed constraints.
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) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1537 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1537 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1538 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 139/1677 variables, 135/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1677 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/1682 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/1683 variables, 1/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1683 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1683 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1683/1683 variables, and 880 constraints, problems are : Problem set: 0 solved, 1 unsolved in 461 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 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) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1475 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1537 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1537 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1538 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 139/1677 variables, 135/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 04:37:58] [INFO ] Deduced a trap composed of 139 places in 147 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1677 variables, 1/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1677 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/1682 variables, 3/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1682 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/1683 variables, 1/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1683 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1683 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 882 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1127 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1625ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 50 ms.
Support contains 2 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1602/1602 transitions.
Applied a total of 0 rules in 73 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1602 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 613/613 places, 1602/1602 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1602/1602 transitions.
Applied a total of 0 rules in 100 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1602 (removed 0) transitions.
[2024-05-23 04:37:59] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-23 04:37:59] [INFO ] Invariant cache hit.
[2024-05-23 04:37:59] [INFO ] Implicit Places using invariants in 362 ms returned []
[2024-05-23 04:37:59] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-23 04:37:59] [INFO ] Invariant cache hit.
[2024-05-23 04:37:59] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 04:38:01] [INFO ] Implicit Places using invariants and state equation in 1617 ms returned []
Implicit Place search using SMT with State Equation took 1982 ms to find 0 implicit places.
[2024-05-23 04:38:01] [INFO ] Redundant transitions in 25 ms returned []
Running 1600 sub problems to find dead transitions.
[2024-05-23 04:38:01] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-23 04:38:01] [INFO ] Invariant cache hit.
[2024-05-23 04:38:01] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 5.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 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 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 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.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 0.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 0.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 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 613/1683 variables, and 2 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/613 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 3 (OVERLAPS) 1070/1683 variables, 613/615 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1683 variables, 265/880 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 2480 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 31442 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 0/0 constraints]
After SMT, in 69130ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 69145ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71268 ms. Remains : 613/613 places, 1602/1602 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 942 edges and 613 vertex of which 192 / 613 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 404 transitions
Reduce isomorphic transitions removed 724 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 485 transition count 868
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 475 transition count 868
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 21 place count 475 transition count 795
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 167 place count 402 transition count 795
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 230 place count 339 transition count 732
Iterating global reduction 2 with 63 rules applied. Total rules applied 293 place count 339 transition count 732
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 419 place count 339 transition count 606
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 673 place count 212 transition count 479
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 148 transition count 351
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 148 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 148 transition count 350
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 85 transition count 224
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 85 transition count 224
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 22 transition count 98
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 22 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 22 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 22 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1121 place count 20 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1122 place count 20 transition count 32
Applied a total of 1122 rules in 32 ms. Remains 20 /613 variables (removed 593) and now considering 32/1602 (removed 1570) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 32 rows 20 cols
[2024-05-23 04:39:10] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 04:39:10] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 04:39:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 04:39:10] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 04:39:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 04:39:10] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 04:39:10] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 04:39:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 04:39:10] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 04:39:10] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 04:39:10] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 04:39:10] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 04:39:10] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 108 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 136 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 364 ms.
Product exploration explored 100000 steps with 0 reset in 399 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 613 transition count 1602
Applied a total of 4 rules in 200 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1606 (removed 4) transitions.
[2024-05-23 04:39:12] [INFO ] Redundant transitions in 20 ms returned []
Running 1600 sub problems to find dead transitions.
[2024-05-23 04:39:12] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 613 cols
[2024-05-23 04:39:12] [INFO ] Computed 2 invariants in 6 ms
[2024-05-23 04:39:12] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 613/1683 variables, and 2 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/613 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 3 (OVERLAPS) 1070/1683 variables, 613/615 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1683 variables, 265/880 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 2480 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 31335 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 0/0 constraints]
After SMT, in 68927ms problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 68941ms
Starting structural reductions in SI_LTL mode, iteration 1 : 613/613 places, 1602/1606 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69183 ms. Remains : 613/613 places, 1602/1606 transitions.
Support contains 4 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Applied a total of 0 rules in 12 ms. Remains 613 /613 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
[2024-05-23 04:40:21] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2024-05-23 04:40:21] [INFO ] Computed 2 invariants in 16 ms
[2024-05-23 04:40:21] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-05-23 04:40:21] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-23 04:40:21] [INFO ] Invariant cache hit.
[2024-05-23 04:40:21] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 04:40:23] [INFO ] Implicit Places using invariants and state equation in 1759 ms returned []
Implicit Place search using SMT with State Equation took 2066 ms to find 0 implicit places.
Running 1604 sub problems to find dead transitions.
[2024-05-23 04:40:23] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-23 04:40:23] [INFO ] Invariant cache hit.
[2024-05-23 04:40:23] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 613/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/613 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 3 (OVERLAPS) 1072/1685 variables, 613/615 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/880 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2484 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 31127 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 0/0 constraints]
After SMT, in 68576ms problems are : Problem set: 0 solved, 1604 unsolved
Search for dead transitions found 0 dead transitions in 68594ms
Finished structural reductions in LTL mode , in 1 iterations and 70677 ms. Remains : 613/613 places, 1606/1606 transitions.
Treatment of property FunctionPointer-PT-c004-LTLFireability-08 finished in 446802 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&X(X(G(p1)))))))'
Support contains 3 out of 791 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 791/791 places, 2050/2050 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 776 transition count 2018
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 776 transition count 2018
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 40 place count 776 transition count 2008
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 55 place count 761 transition count 1976
Iterating global reduction 1 with 15 rules applied. Total rules applied 70 place count 761 transition count 1976
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 74 place count 761 transition count 1972
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 86 place count 749 transition count 1936
Iterating global reduction 2 with 12 rules applied. Total rules applied 98 place count 749 transition count 1936
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 112 place count 735 transition count 1892
Iterating global reduction 2 with 14 rules applied. Total rules applied 126 place count 735 transition count 1892
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 142 place count 719 transition count 1848
Iterating global reduction 2 with 16 rules applied. Total rules applied 158 place count 719 transition count 1848
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 176 place count 701 transition count 1800
Iterating global reduction 2 with 18 rules applied. Total rules applied 194 place count 701 transition count 1800
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 211 place count 684 transition count 1758
Iterating global reduction 2 with 17 rules applied. Total rules applied 228 place count 684 transition count 1758
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 245 place count 667 transition count 1722
Iterating global reduction 2 with 17 rules applied. Total rules applied 262 place count 667 transition count 1722
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 278 place count 651 transition count 1688
Iterating global reduction 2 with 16 rules applied. Total rules applied 294 place count 651 transition count 1688
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 305 place count 640 transition count 1664
Iterating global reduction 2 with 11 rules applied. Total rules applied 316 place count 640 transition count 1664
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 324 place count 632 transition count 1648
Iterating global reduction 2 with 8 rules applied. Total rules applied 332 place count 632 transition count 1648
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 337 place count 627 transition count 1638
Iterating global reduction 2 with 5 rules applied. Total rules applied 342 place count 627 transition count 1638
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 344 place count 625 transition count 1634
Iterating global reduction 2 with 2 rules applied. Total rules applied 346 place count 625 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 347 place count 624 transition count 1632
Iterating global reduction 2 with 1 rules applied. Total rules applied 348 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 349 place count 623 transition count 1630
Iterating global reduction 2 with 1 rules applied. Total rules applied 350 place count 623 transition count 1630
Applied a total of 350 rules in 256 ms. Remains 623 /791 variables (removed 168) and now considering 1630/2050 (removed 420) transitions.
[2024-05-23 04:41:32] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
// Phase 1: matrix 1088 rows 623 cols
[2024-05-23 04:41:32] [INFO ] Computed 2 invariants in 7 ms
[2024-05-23 04:41:32] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-05-23 04:41:32] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2024-05-23 04:41:32] [INFO ] Invariant cache hit.
[2024-05-23 04:41:32] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 04:41:34] [INFO ] Implicit Places using invariants and state equation in 1655 ms returned []
Implicit Place search using SMT with State Equation took 2063 ms to find 0 implicit places.
Running 1628 sub problems to find dead transitions.
[2024-05-23 04:41:34] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2024-05-23 04:41:34] [INFO ] Invariant cache hit.
[2024-05-23 04:41:34] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1711 variables, and 2 constraints, problems are : Problem set: 0 solved, 1628 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/623 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1628/1628 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1628 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/623 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 3 (OVERLAPS) 1088/1711 variables, 623/625 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1711 variables, 268/893 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1711/1711 variables, and 2521 constraints, problems are : Problem set: 0 solved, 1628 unsolved in 31477 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 623/623 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1628/1628 constraints, Known Traps: 0/0 constraints]
After SMT, in 68846ms problems are : Problem set: 0 solved, 1628 unsolved
Search for dead transitions found 0 dead transitions in 68861ms
Starting structural reductions in LTL mode, iteration 1 : 623/791 places, 1630/2050 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71186 ms. Remains : 623/791 places, 1630/2050 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 405 ms.
Product exploration explored 100000 steps with 0 reset in 420 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
RANDOM walk for 40002 steps (8 resets) in 301 ms. (132 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 34 ms. (1142 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 151987 steps, run timeout after 3009 ms. (steps per millisecond=50 ) properties seen :0 out of 4
Probabilistic random walk after 151987 steps, saw 98669 distinct states, run finished after 3009 ms. (steps per millisecond=50 ) properties seen :0
[2024-05-23 04:42:47] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2024-05-23 04:42:47] [INFO ] Invariant cache hit.
[2024-05-23 04:42:47] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 339/342 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1156/1498 variables, 477/480 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1498 variables, 268/748 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 62/1560 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1560 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/1561 variables, 1/750 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1561 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1561 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 144/1705 variables, 138/889 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1705 variables, 0/889 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 5/1710 variables, 3/892 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1710 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/1711 variables, 1/893 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1711 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1711 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1711/1711 variables, and 893 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1210 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 623/623 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 339/342 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1156/1498 variables, 477/480 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1498 variables, 268/748 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 4/752 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1498 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 62/1560 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1560 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/1561 variables, 1/754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1561 variables, 1/755 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1561 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 144/1705 variables, 138/893 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-23 04:42:50] [INFO ] Deduced a trap composed of 131 places in 159 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1705 variables, 1/894 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1705 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 5/1710 variables, 3/897 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1710 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 1/1711 variables, 1/898 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1711 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1711 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1711/1711 variables, and 898 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3130 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 623/623 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 4374ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1341 ms.
Support contains 3 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1630/1630 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 623 transition count 1624
Applied a total of 6 rules in 158 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1630 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 623/623 places, 1624/1630 transitions.
RANDOM walk for 40006 steps (8 resets) in 652 ms. (61 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 168649 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 4
Probabilistic random walk after 168649 steps, saw 109484 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
[2024-05-23 04:42:57] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 623 cols
[2024-05-23 04:42:57] [INFO ] Computed 2 invariants in 5 ms
[2024-05-23 04:42:57] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 339/342 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1153/1495 variables, 477/480 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 268/748 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1495 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 62/1557 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1557 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/1558 variables, 1/750 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1558 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1558 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 142/1700 variables, 137/888 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1700 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 5/1705 variables, 3/891 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1705 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 3/1708 variables, 2/893 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1708 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1708 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1708/1708 variables, and 893 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1415 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 623/623 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 339/342 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1153/1495 variables, 477/480 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 268/748 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1495 variables, 4/752 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1495 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 62/1557 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1557 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/1558 variables, 1/754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1558 variables, 1/755 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1558 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 142/1700 variables, 137/892 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-23 04:43:00] [INFO ] Deduced a trap composed of 131 places in 165 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1700 variables, 1/893 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1700 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 5/1705 variables, 3/896 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1705 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 3/1708 variables, 2/898 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1708 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1708 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1708/1708 variables, and 898 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2904 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 623/623 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 4357ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1953 ms.
Support contains 3 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 77 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 623/623 places, 1624/1624 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 75 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
[2024-05-23 04:43:03] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-23 04:43:03] [INFO ] Invariant cache hit.
[2024-05-23 04:43:03] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-23 04:43:03] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-23 04:43:03] [INFO ] Invariant cache hit.
[2024-05-23 04:43:04] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 04:43:05] [INFO ] Implicit Places using invariants and state equation in 1752 ms returned []
Implicit Place search using SMT with State Equation took 2105 ms to find 0 implicit places.
[2024-05-23 04:43:05] [INFO ] Redundant transitions in 27 ms returned []
Running 1622 sub problems to find dead transitions.
[2024-05-23 04:43:05] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-23 04:43:05] [INFO ] Invariant cache hit.
[2024-05-23 04:43:05] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 7.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 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 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 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.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 0.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 0.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 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1708 variables, and 2 constraints, problems are : Problem set: 0 solved, 1622 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/623 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1622/1622 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1622 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/623 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 3 (OVERLAPS) 1085/1708 variables, 623/625 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1708 variables, 268/893 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1708/1708 variables, and 2515 constraints, problems are : Problem set: 0 solved, 1622 unsolved in 31764 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 623/623 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1622/1622 constraints, Known Traps: 0/0 constraints]
After SMT, in 69278ms problems are : Problem set: 0 solved, 1622 unsolved
Search for dead transitions found 0 dead transitions in 69292ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71506 ms. Remains : 623/623 places, 1624/1624 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 956 edges and 623 vertex of which 192 / 623 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 411 transitions
Reduce isomorphic transitions removed 731 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 495 transition count 882
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 484 transition count 882
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 23 place count 484 transition count 806
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 175 place count 408 transition count 806
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 238 place count 345 transition count 743
Iterating global reduction 2 with 63 rules applied. Total rules applied 301 place count 345 transition count 743
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 427 place count 345 transition count 617
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 681 place count 218 transition count 490
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 745 place count 154 transition count 362
Iterating global reduction 3 with 64 rules applied. Total rules applied 809 place count 154 transition count 362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 810 place count 154 transition count 361
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 873 place count 91 transition count 235
Iterating global reduction 4 with 63 rules applied. Total rules applied 936 place count 91 transition count 235
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 999 place count 28 transition count 109
Iterating global reduction 4 with 63 rules applied. Total rules applied 1062 place count 28 transition count 109
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1125 place count 28 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1125 place count 28 transition count 45
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1127 place count 27 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1129 place count 26 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1133 place count 24 transition count 44
Applied a total of 1133 rules in 56 ms. Remains 24 /623 variables (removed 599) and now considering 44/1624 (removed 1580) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 44 rows 24 cols
[2024-05-23 04:44:14] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 04:44:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 04:44:15] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 04:44:15] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-23 04:44:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 04:44:15] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-23 04:44:15] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-23 04:44:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 04:44:15] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:44:15] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-23 04:44:15] [INFO ] After 9ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-23 04:44:15] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-23 04:44:15] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 171 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 62 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 223 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
[2024-05-23 04:44:15] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
// Phase 1: matrix 1088 rows 623 cols
[2024-05-23 04:44:15] [INFO ] Computed 2 invariants in 14 ms
[2024-05-23 04:44:16] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-23 04:44:16] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:44:17] [INFO ] [Real]Absence check using state equation in 868 ms returned sat
[2024-05-23 04:44:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 04:44:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 36 ms returned sat
[2024-05-23 04:44:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:44:18] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
[2024-05-23 04:44:18] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 04:44:18] [INFO ] [Nat]Added 268 Read/Feed constraints in 64 ms returned sat
[2024-05-23 04:44:19] [INFO ] Deduced a trap composed of 131 places in 159 ms of which 3 ms to minimize.
[2024-05-23 04:44:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2024-05-23 04:44:19] [INFO ] Computed and/alt/rep : 208/306/208 causal constraints (skipped 878 transitions) in 98 ms.
[2024-05-23 04:44:19] [INFO ] Added : 13 causal constraints over 4 iterations in 404 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 1630/1630 transitions.
Applied a total of 0 rules in 15 ms. Remains 623 /623 variables (removed 0) and now considering 1630/1630 (removed 0) transitions.
[2024-05-23 04:44:19] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2024-05-23 04:44:19] [INFO ] Invariant cache hit.
[2024-05-23 04:44:19] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-05-23 04:44:19] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2024-05-23 04:44:19] [INFO ] Invariant cache hit.
[2024-05-23 04:44:20] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 04:44:21] [INFO ] Implicit Places using invariants and state equation in 1660 ms returned []
Implicit Place search using SMT with State Equation took 2011 ms to find 0 implicit places.
Running 1628 sub problems to find dead transitions.
[2024-05-23 04:44:21] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2024-05-23 04:44:21] [INFO ] Invariant cache hit.
[2024-05-23 04:44:21] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1628 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 623/1711 variables, and 2 constraints, problems are : Problem set: 0 solved, 1628 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/623 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1628/1628 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1628 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/623 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 3 (OVERLAPS) 1088/1711 variables, 623/625 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1711 variables, 268/893 constraints. Problems are: Problem set: 0 solved, 1628 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1711/1711 variables, and 2521 constraints, problems are : Problem set: 0 solved, 1628 unsolved in 31352 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 623/623 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1628/1628 constraints, Known Traps: 0/0 constraints]
After SMT, in 68610ms problems are : Problem set: 0 solved, 1628 unsolved
Search for dead transitions found 0 dead transitions in 68626ms
Finished structural reductions in LTL mode , in 1 iterations and 70659 ms. Remains : 623/623 places, 1630/1630 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 70 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
RANDOM walk for 40003 steps (8 resets) in 552 ms. (72 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 169104 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 4
Probabilistic random walk after 169104 steps, saw 109779 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
[2024-05-23 04:45:34] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2024-05-23 04:45:34] [INFO ] Invariant cache hit.
[2024-05-23 04:45:34] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 339/342 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1156/1498 variables, 477/480 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1498 variables, 268/748 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 62/1560 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1560 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/1561 variables, 1/750 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1561 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1561 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 144/1705 variables, 138/889 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1705 variables, 0/889 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 5/1710 variables, 3/892 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1710 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/1711 variables, 1/893 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1711 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1711 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1711/1711 variables, and 893 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1231 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 623/623 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 339/342 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1156/1498 variables, 477/480 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1498 variables, 268/748 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 4/752 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1498 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 62/1560 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1560 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/1561 variables, 1/754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1561 variables, 1/755 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1561 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 144/1705 variables, 138/893 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-23 04:45:37] [INFO ] Deduced a trap composed of 131 places in 152 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1705 variables, 1/894 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1705 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 5/1710 variables, 3/897 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1710 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 1/1711 variables, 1/898 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1711 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1711 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1711/1711 variables, and 898 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3160 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 623/623 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 4422ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1124 ms.
Support contains 3 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1630/1630 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 623 transition count 1624
Applied a total of 6 rules in 153 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1630 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 623/623 places, 1624/1630 transitions.
RANDOM walk for 40000 steps (8 resets) in 490 ms. (81 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 177778 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 4
Probabilistic random walk after 177778 steps, saw 115410 distinct states, run finished after 3003 ms. (steps per millisecond=59 ) properties seen :0
[2024-05-23 04:45:43] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 623 cols
[2024-05-23 04:45:43] [INFO ] Computed 2 invariants in 7 ms
[2024-05-23 04:45:43] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 339/342 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1153/1495 variables, 477/480 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 268/748 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1495 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 62/1557 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1557 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/1558 variables, 1/750 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1558 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1558 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 142/1700 variables, 137/888 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1700 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 5/1705 variables, 3/891 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1705 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 3/1708 variables, 2/893 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1708 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/1708 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1708/1708 variables, and 893 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1336 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 623/623 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 339/342 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1153/1495 variables, 477/480 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 268/748 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1495 variables, 4/752 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1495 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 62/1557 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1557 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/1558 variables, 1/754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1558 variables, 1/755 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1558 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 142/1700 variables, 137/892 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-23 04:45:46] [INFO ] Deduced a trap composed of 131 places in 147 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1700 variables, 1/893 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1700 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 5/1705 variables, 3/896 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1705 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 3/1708 variables, 2/898 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1708 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1708 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1708/1708 variables, and 898 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2959 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 623/623 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 4343ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1790 ms.
Support contains 3 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 81 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 623/623 places, 1624/1624 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 74 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
[2024-05-23 04:45:49] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-23 04:45:49] [INFO ] Invariant cache hit.
[2024-05-23 04:45:49] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-05-23 04:45:49] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-23 04:45:49] [INFO ] Invariant cache hit.
[2024-05-23 04:45:50] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 04:45:51] [INFO ] Implicit Places using invariants and state equation in 1627 ms returned []
Implicit Place search using SMT with State Equation took 2010 ms to find 0 implicit places.
[2024-05-23 04:45:51] [INFO ] Redundant transitions in 26 ms returned []
Running 1622 sub problems to find dead transitions.
[2024-05-23 04:45:51] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-23 04:45:51] [INFO ] Invariant cache hit.
[2024-05-23 04:45:51] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 623/1708 variables, and 2 constraints, problems are : Problem set: 0 solved, 1622 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/623 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1622/1622 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1622 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/623 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/623 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/623 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 3 (OVERLAPS) 1085/1708 variables, 623/625 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1708 variables, 268/893 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1708/1708 variables, and 2515 constraints, problems are : Problem set: 0 solved, 1622 unsolved in 31772 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 623/623 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1622/1622 constraints, Known Traps: 0/0 constraints]
After SMT, in 70340ms problems are : Problem set: 0 solved, 1622 unsolved
Search for dead transitions found 0 dead transitions in 70354ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72478 ms. Remains : 623/623 places, 1624/1624 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 956 edges and 623 vertex of which 192 / 623 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 411 transitions
Reduce isomorphic transitions removed 731 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 495 transition count 882
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 484 transition count 882
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 23 place count 484 transition count 806
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 175 place count 408 transition count 806
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 238 place count 345 transition count 743
Iterating global reduction 2 with 63 rules applied. Total rules applied 301 place count 345 transition count 743
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 427 place count 345 transition count 617
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 681 place count 218 transition count 490
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 745 place count 154 transition count 362
Iterating global reduction 3 with 64 rules applied. Total rules applied 809 place count 154 transition count 362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 810 place count 154 transition count 361
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 873 place count 91 transition count 235
Iterating global reduction 4 with 63 rules applied. Total rules applied 936 place count 91 transition count 235
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 999 place count 28 transition count 109
Iterating global reduction 4 with 63 rules applied. Total rules applied 1062 place count 28 transition count 109
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1125 place count 28 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1125 place count 28 transition count 45
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1127 place count 27 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1129 place count 26 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1133 place count 24 transition count 44
Applied a total of 1133 rules in 34 ms. Remains 24 /623 variables (removed 599) and now considering 44/1624 (removed 1580) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 44 rows 24 cols
[2024-05-23 04:47:01] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 04:47:01] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 04:47:01] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 04:47:01] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-23 04:47:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 04:47:01] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-23 04:47:01] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-23 04:47:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 04:47:01] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:47:01] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-23 04:47:01] [INFO ] After 10ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-23 04:47:01] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-23 04:47:01] [INFO ] After 85ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 171 ms.
Knowledge obtained : [(AND p1 (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 286 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 272 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
[2024-05-23 04:47:02] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
// Phase 1: matrix 1088 rows 623 cols
[2024-05-23 04:47:02] [INFO ] Computed 2 invariants in 6 ms
[2024-05-23 04:47:03] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-23 04:47:03] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 04:47:04] [INFO ] [Real]Absence check using state equation in 883 ms returned sat
[2024-05-23 04:47:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 04:47:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 37 ms returned sat
[2024-05-23 04:47:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-23 04:47:05] [INFO ] [Nat]Absence check using state equation in 438 ms returned sat
[2024-05-23 04:47:05] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 04:47:05] [INFO ] [Nat]Added 268 Read/Feed constraints in 73 ms returned sat
[2024-05-23 04:47:06] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 3 ms to minimize.
[2024-05-23 04:47:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 253 ms
[2024-05-23 04:47:06] [INFO ] Computed and/alt/rep : 208/306/208 causal constraints (skipped 878 transitions) in 103 ms.
[2024-05-23 04:47:06] [INFO ] Added : 13 causal constraints over 4 iterations in 395 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 237 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 388 ms.
Stack based approach found an accepted trace after 1951 steps with 0 reset with depth 1952 and stack size 1952 in 8 ms.
FORMULA FunctionPointer-PT-c004-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c004-LTLFireability-12 finished in 335270 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) U ((!p2&&X(!p1))||X(G(!p1)))))))'
Support contains 3 out of 791 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 791/791 places, 2050/2050 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 776 transition count 2020
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 776 transition count 2020
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 38 place count 776 transition count 2012
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 52 place count 762 transition count 1982
Iterating global reduction 1 with 14 rules applied. Total rules applied 66 place count 762 transition count 1982
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 78 place count 750 transition count 1942
Iterating global reduction 1 with 12 rules applied. Total rules applied 90 place count 750 transition count 1942
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 103 place count 737 transition count 1898
Iterating global reduction 1 with 13 rules applied. Total rules applied 116 place count 737 transition count 1898
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 129 place count 724 transition count 1868
Iterating global reduction 1 with 13 rules applied. Total rules applied 142 place count 724 transition count 1868
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 157 place count 709 transition count 1832
Iterating global reduction 1 with 15 rules applied. Total rules applied 172 place count 709 transition count 1832
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 188 place count 693 transition count 1790
Iterating global reduction 1 with 16 rules applied. Total rules applied 204 place count 693 transition count 1790
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 220 place count 677 transition count 1754
Iterating global reduction 1 with 16 rules applied. Total rules applied 236 place count 677 transition count 1754
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 252 place count 661 transition count 1718
Iterating global reduction 1 with 16 rules applied. Total rules applied 268 place count 661 transition count 1718
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 277 place count 652 transition count 1696
Iterating global reduction 1 with 9 rules applied. Total rules applied 286 place count 652 transition count 1696
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 293 place count 645 transition count 1682
Iterating global reduction 1 with 7 rules applied. Total rules applied 300 place count 645 transition count 1682
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 307 place count 638 transition count 1668
Iterating global reduction 1 with 7 rules applied. Total rules applied 314 place count 638 transition count 1668
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 318 place count 634 transition count 1660
Iterating global reduction 1 with 4 rules applied. Total rules applied 322 place count 634 transition count 1660
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 324 place count 632 transition count 1656
Iterating global reduction 1 with 2 rules applied. Total rules applied 326 place count 632 transition count 1656
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 328 place count 630 transition count 1652
Iterating global reduction 1 with 2 rules applied. Total rules applied 330 place count 630 transition count 1652
Applied a total of 330 rules in 264 ms. Remains 630 /791 variables (removed 161) and now considering 1652/2050 (removed 398) transitions.
[2024-05-23 04:47:07] [INFO ] Flow matrix only has 1103 transitions (discarded 549 similar events)
// Phase 1: matrix 1103 rows 630 cols
[2024-05-23 04:47:07] [INFO ] Computed 2 invariants in 12 ms
[2024-05-23 04:47:07] [INFO ] Implicit Places using invariants in 292 ms returned []
[2024-05-23 04:47:07] [INFO ] Flow matrix only has 1103 transitions (discarded 549 similar events)
[2024-05-23 04:47:07] [INFO ] Invariant cache hit.
[2024-05-23 04:47:08] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-23 04:47:09] [INFO ] Implicit Places using invariants and state equation in 1785 ms returned []
Implicit Place search using SMT with State Equation took 2078 ms to find 0 implicit places.
Running 1650 sub problems to find dead transitions.
[2024-05-23 04:47:09] [INFO ] Flow matrix only has 1103 transitions (discarded 549 similar events)
[2024-05-23 04:47:09] [INFO ] Invariant cache hit.
[2024-05-23 04:47:09] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/630 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/630 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 630/1733 variables, and 2 constraints, problems are : Problem set: 0 solved, 1650 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/630 constraints, ReadFeed: 0/271 constraints, PredecessorRefiner: 1650/1650 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/630 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/630 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/630 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 3 (OVERLAPS) 1103/1733 variables, 630/632 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1733 variables, 271/903 constraints. Problems are: Problem set: 0 solved, 1650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1733/1733 variables, and 2553 constraints, problems are : Problem set: 0 solved, 1650 unsolved in 31649 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 630/630 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 1650/1650 constraints, Known Traps: 0/0 constraints]
After SMT, in 69462ms problems are : Problem set: 0 solved, 1650 unsolved
Search for dead transitions found 0 dead transitions in 69479ms
Starting structural reductions in LTL mode, iteration 1 : 630/791 places, 1652/2050 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71826 ms. Remains : 630/791 places, 1652/2050 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 405 ms.
Product exploration explored 100000 steps with 0 reset in 455 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (OR (NOT p0) p1))), (X p0), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 105 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[true, (OR (NOT p0) p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (8 resets) in 575 ms. (69 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 96 ms. (412 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 216323 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 3
Probabilistic random walk after 216323 steps, saw 140425 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
[2024-05-23 04:48:23] [INFO ] Flow matrix only has 1103 transitions (discarded 549 similar events)
[2024-05-23 04:48:23] [INFO ] Invariant cache hit.
[2024-05-23 04:48:23] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 344/347 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/347 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1166/1513 variables, 482/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1513 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1513 variables, 271/757 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1513 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 62/1575 variables, 1/758 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1575 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 142/1717 variables, 137/895 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1717 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 14/1731 variables, 6/901 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1731 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/1733 variables, 2/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1733 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/1733 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1733/1733 variables, and 903 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1046 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 630/630 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 344/347 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/347 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1166/1513 variables, 482/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1513 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1513 variables, 271/757 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1513 variables, 3/760 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1513 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 62/1575 variables, 1/761 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1575 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 142/1717 variables, 137/898 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1717 variables, 0/898 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 14/1731 variables, 6/904 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1731 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/1733 variables, 2/906 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1733 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/1733 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1733/1733 variables, and 906 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1552 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 630/630 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2629ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 1652/1652 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 629 transition count 1650
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 629 transition count 1650
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 629 transition count 1648
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 627 transition count 1644
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 627 transition count 1644
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 627 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 626 transition count 1638
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 626 transition count 1638
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 625 transition count 1636
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 625 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 624 transition count 1632
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 623 transition count 1628
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 623 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 622 transition count 1626
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 622 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 621 transition count 1624
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 621 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 620 transition count 1622
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 620 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 619 transition count 1620
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 619 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 618 transition count 1618
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 618 transition count 1618
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 618 transition count 1612
Applied a total of 36 rules in 327 ms. Remains 618 /630 variables (removed 12) and now considering 1612/1652 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 327 ms. Remains : 618/630 places, 1612/1652 transitions.
RANDOM walk for 40005 steps (8 resets) in 377 ms. (105 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 227770 steps, run timeout after 3013 ms. (steps per millisecond=75 ) properties seen :0 out of 3
Probabilistic random walk after 227770 steps, saw 147855 distinct states, run finished after 3013 ms. (steps per millisecond=75 ) properties seen :0
[2024-05-23 04:48:29] [INFO ] Flow matrix only has 1079 transitions (discarded 533 similar events)
// Phase 1: matrix 1079 rows 618 cols
[2024-05-23 04:48:29] [INFO ] Computed 2 invariants in 4 ms
[2024-05-23 04:48:29] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 340/343 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1150/1493 variables, 477/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1493 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1493 variables, 268/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1493 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 62/1555 variables, 1/750 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1555 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 136/1691 variables, 134/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1691 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 6/1697 variables, 4/888 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1697 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1697 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1697/1697 variables, and 888 constraints, problems are : Problem set: 0 solved, 3 unsolved in 740 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 340/343 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1150/1493 variables, 477/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1493 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1493 variables, 268/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1493 variables, 3/752 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1493 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 62/1555 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1555 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 136/1691 variables, 134/887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1691 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 6/1697 variables, 4/891 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1697 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1697 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1697/1697 variables, and 891 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1362 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2137ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 618 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 618/618 places, 1612/1612 transitions.
Applied a total of 0 rules in 82 ms. Remains 618 /618 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 618/618 places, 1612/1612 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 618/618 places, 1612/1612 transitions.
Applied a total of 0 rules in 86 ms. Remains 618 /618 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2024-05-23 04:48:31] [INFO ] Flow matrix only has 1079 transitions (discarded 533 similar events)
[2024-05-23 04:48:31] [INFO ] Invariant cache hit.
[2024-05-23 04:48:32] [INFO ] Implicit Places using invariants in 385 ms returned []
[2024-05-23 04:48:32] [INFO ] Flow matrix only has 1079 transitions (discarded 533 similar events)
[2024-05-23 04:48:32] [INFO ] Invariant cache hit.
[2024-05-23 04:48:32] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 04:48:34] [INFO ] Implicit Places using invariants and state equation in 1780 ms returned []
Implicit Place search using SMT with State Equation took 2167 ms to find 0 implicit places.
[2024-05-23 04:48:34] [INFO ] Redundant transitions in 21 ms returned []
Running 1610 sub problems to find dead transitions.
[2024-05-23 04:48:34] [INFO ] Flow matrix only has 1079 transitions (discarded 533 similar events)
[2024-05-23 04:48:34] [INFO ] Invariant cache hit.
[2024-05-23 04:48:34] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 618/1697 variables, and 2 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/618 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 3 (OVERLAPS) 1079/1697 variables, 618/620 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1697 variables, 268/888 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1697/1697 variables, and 2498 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 31695 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
After SMT, in 69636ms problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 69651ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71940 ms. Remains : 618/618 places, 1612/1612 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 944 edges and 618 vertex of which 192 / 618 are part of one of the 64 SCC in 0 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 490 transition count 876
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 479 transition count 876
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 23 place count 479 transition count 803
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 169 place count 406 transition count 803
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 232 place count 343 transition count 740
Iterating global reduction 2 with 63 rules applied. Total rules applied 295 place count 343 transition count 740
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 421 place count 343 transition count 614
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 677 place count 215 transition count 486
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 741 place count 151 transition count 358
Iterating global reduction 3 with 64 rules applied. Total rules applied 805 place count 151 transition count 358
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 807 place count 151 transition count 356
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 870 place count 88 transition count 230
Iterating global reduction 4 with 63 rules applied. Total rules applied 933 place count 88 transition count 230
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 996 place count 25 transition count 104
Iterating global reduction 4 with 63 rules applied. Total rules applied 1059 place count 25 transition count 104
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1122 place count 25 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1122 place count 25 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1124 place count 24 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1126 place count 23 transition count 39
Applied a total of 1126 rules in 29 ms. Remains 23 /618 variables (removed 595) and now considering 39/1612 (removed 1573) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 39 rows 23 cols
[2024-05-23 04:49:43] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 04:49:43] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 04:49:43] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 04:49:43] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 04:49:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 04:49:43] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 04:49:43] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-23 04:49:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 04:49:43] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-23 04:49:43] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-23 04:49:43] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 128 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (OR (NOT p0) p1))), (X p0), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[true, (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 35 ms :[true, (OR (NOT p0) p1)]
Support contains 3 out of 630 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 630/630 places, 1652/1652 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 630 transition count 1646
Applied a total of 6 rules in 192 ms. Remains 630 /630 variables (removed 0) and now considering 1646/1652 (removed 6) transitions.
[2024-05-23 04:49:44] [INFO ] Flow matrix only has 1100 transitions (discarded 546 similar events)
// Phase 1: matrix 1100 rows 630 cols
[2024-05-23 04:49:44] [INFO ] Computed 2 invariants in 12 ms
[2024-05-23 04:49:44] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-23 04:49:44] [INFO ] Flow matrix only has 1100 transitions (discarded 546 similar events)
[2024-05-23 04:49:44] [INFO ] Invariant cache hit.
[2024-05-23 04:49:44] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-23 04:49:46] [INFO ] Implicit Places using invariants and state equation in 1421 ms returned []
Implicit Place search using SMT with State Equation took 1733 ms to find 0 implicit places.
[2024-05-23 04:49:46] [INFO ] Redundant transitions in 25 ms returned []
Running 1644 sub problems to find dead transitions.
[2024-05-23 04:49:46] [INFO ] Flow matrix only has 1100 transitions (discarded 546 similar events)
[2024-05-23 04:49:46] [INFO ] Invariant cache hit.
[2024-05-23 04:49:46] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/630 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/630 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1644 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 630/1730 variables, and 2 constraints, problems are : Problem set: 0 solved, 1644 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/630 constraints, ReadFeed: 0/271 constraints, PredecessorRefiner: 1644/1644 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1644 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/630 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1644 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/630 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1644 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/630 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1644 unsolved
At refinement iteration 3 (OVERLAPS) 1100/1730 variables, 630/632 constraints. Problems are: Problem set: 0 solved, 1644 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1730 variables, 271/903 constraints. Problems are: Problem set: 0 solved, 1644 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1730/1730 variables, and 2547 constraints, problems are : Problem set: 0 solved, 1644 unsolved in 31577 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 630/630 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 1644/1644 constraints, Known Traps: 0/0 constraints]
After SMT, in 70000ms problems are : Problem set: 0 solved, 1644 unsolved
Search for dead transitions found 0 dead transitions in 70016ms
Starting structural reductions in SI_LTL mode, iteration 1 : 630/630 places, 1646/1652 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71980 ms. Remains : 630/630 places, 1646/1652 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (OR (NOT p0) p1))), (X p0), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[true, (OR (NOT p0) p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (8 resets) in 474 ms. (84 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 175759 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 3
Probabilistic random walk after 175759 steps, saw 114098 distinct states, run finished after 3003 ms. (steps per millisecond=58 ) properties seen :0
[2024-05-23 04:50:59] [INFO ] Flow matrix only has 1100 transitions (discarded 546 similar events)
[2024-05-23 04:50:59] [INFO ] Invariant cache hit.
[2024-05-23 04:50:59] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 343/346 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1164/1510 variables, 482/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1510 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1510 variables, 271/757 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1510 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 62/1572 variables, 1/758 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1572 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 140/1712 variables, 136/894 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1712 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 13/1725 variables, 6/900 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1725 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 5/1730 variables, 3/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1730 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/1730 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1730/1730 variables, and 903 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1090 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 630/630 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 343/346 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1164/1510 variables, 482/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1510 variables, 1/486 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1510 variables, 271/757 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1510 variables, 3/760 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1510 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 62/1572 variables, 1/761 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1572 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 140/1712 variables, 136/897 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1712 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 13/1725 variables, 6/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1725 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 5/1730 variables, 3/906 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1730 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/1730 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1730/1730 variables, and 906 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1611 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 630/630 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2745ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 1646/1646 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 629 transition count 1644
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 629 transition count 1644
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 629 transition count 1642
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 627 transition count 1638
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 627 transition count 1638
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 627 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 626 transition count 1632
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 626 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 625 transition count 1630
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 625 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 624 transition count 1626
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 624 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 623 transition count 1624
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 623 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 622 transition count 1622
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 622 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 621 transition count 1620
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 621 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 620 transition count 1618
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 620 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 619 transition count 1616
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 619 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 618 transition count 1614
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 618 transition count 1614
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 618 transition count 1612
Applied a total of 32 rules in 311 ms. Remains 618 /630 variables (removed 12) and now considering 1612/1646 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 311 ms. Remains : 618/630 places, 1612/1646 transitions.
RANDOM walk for 40003 steps (8 resets) in 331 ms. (120 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 205282 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 3
Probabilistic random walk after 205282 steps, saw 133260 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
[2024-05-23 04:51:05] [INFO ] Flow matrix only has 1079 transitions (discarded 533 similar events)
// Phase 1: matrix 1079 rows 618 cols
[2024-05-23 04:51:05] [INFO ] Computed 2 invariants in 5 ms
[2024-05-23 04:51:05] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 340/343 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1150/1493 variables, 477/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1493 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1493 variables, 268/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1493 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 62/1555 variables, 1/750 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1555 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 136/1691 variables, 134/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1691 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 6/1697 variables, 4/888 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1697 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1697 variables, 0/888 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1697/1697 variables, and 888 constraints, problems are : Problem set: 0 solved, 3 unsolved in 747 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 340/343 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/343 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1150/1493 variables, 477/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1493 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1493 variables, 268/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1493 variables, 3/752 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1493 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 62/1555 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1555 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 136/1691 variables, 134/887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1691 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 6/1697 variables, 4/891 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1697 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1697 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1697/1697 variables, and 891 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1336 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2115ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 618 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 618/618 places, 1612/1612 transitions.
Applied a total of 0 rules in 77 ms. Remains 618 /618 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 618/618 places, 1612/1612 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 618/618 places, 1612/1612 transitions.
Applied a total of 0 rules in 87 ms. Remains 618 /618 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2024-05-23 04:51:08] [INFO ] Flow matrix only has 1079 transitions (discarded 533 similar events)
[2024-05-23 04:51:08] [INFO ] Invariant cache hit.
[2024-05-23 04:51:08] [INFO ] Implicit Places using invariants in 350 ms returned []
[2024-05-23 04:51:08] [INFO ] Flow matrix only has 1079 transitions (discarded 533 similar events)
[2024-05-23 04:51:08] [INFO ] Invariant cache hit.
[2024-05-23 04:51:08] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 04:51:10] [INFO ] Implicit Places using invariants and state equation in 1698 ms returned []
Implicit Place search using SMT with State Equation took 2049 ms to find 0 implicit places.
[2024-05-23 04:51:10] [INFO ] Redundant transitions in 22 ms returned []
Running 1610 sub problems to find dead transitions.
[2024-05-23 04:51:10] [INFO ] Flow matrix only has 1079 transitions (discarded 533 similar events)
[2024-05-23 04:51:10] [INFO ] Invariant cache hit.
[2024-05-23 04:51:10] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 618/1697 variables, and 2 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/618 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1610 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 3 (OVERLAPS) 1079/1697 variables, 618/620 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1697 variables, 268/888 constraints. Problems are: Problem set: 0 solved, 1610 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1697/1697 variables, and 2498 constraints, problems are : Problem set: 0 solved, 1610 unsolved in 31585 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1610/1610 constraints, Known Traps: 0/0 constraints]
After SMT, in 69566ms problems are : Problem set: 0 solved, 1610 unsolved
Search for dead transitions found 0 dead transitions in 69580ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71750 ms. Remains : 618/618 places, 1612/1612 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 944 edges and 618 vertex of which 192 / 618 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 490 transition count 876
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 479 transition count 876
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 23 place count 479 transition count 803
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 169 place count 406 transition count 803
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 232 place count 343 transition count 740
Iterating global reduction 2 with 63 rules applied. Total rules applied 295 place count 343 transition count 740
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 421 place count 343 transition count 614
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 1 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 677 place count 215 transition count 486
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 741 place count 151 transition count 358
Iterating global reduction 3 with 64 rules applied. Total rules applied 805 place count 151 transition count 358
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 807 place count 151 transition count 356
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 870 place count 88 transition count 230
Iterating global reduction 4 with 63 rules applied. Total rules applied 933 place count 88 transition count 230
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 996 place count 25 transition count 104
Iterating global reduction 4 with 63 rules applied. Total rules applied 1059 place count 25 transition count 104
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1122 place count 25 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1122 place count 25 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1124 place count 24 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1126 place count 23 transition count 39
Applied a total of 1126 rules in 57 ms. Remains 23 /618 variables (removed 595) and now considering 39/1612 (removed 1573) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 39 rows 23 cols
[2024-05-23 04:52:19] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 04:52:19] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 04:52:19] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 14 ms returned sat
[2024-05-23 04:52:19] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 04:52:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 04:52:19] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 04:52:19] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-23 04:52:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 04:52:19] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-23 04:52:19] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-23 04:52:19] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 199 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (OR (NOT p0) p1))), (X p0), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (X (NOT (OR (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[true, (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 53 ms :[true, (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 52 ms :[true, (OR (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 431 ms.
Product exploration explored 100000 steps with 0 reset in 511 ms.
Support contains 3 out of 630 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 630/630 places, 1646/1646 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 629 transition count 1644
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 629 transition count 1644
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 629 transition count 1642
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 627 transition count 1638
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 627 transition count 1638
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 627 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 626 transition count 1632
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 626 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 625 transition count 1630
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 625 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 624 transition count 1626
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 624 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 623 transition count 1624
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 623 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 622 transition count 1622
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 622 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 621 transition count 1620
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 621 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 620 transition count 1618
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 620 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 619 transition count 1616
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 619 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 618 transition count 1614
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 618 transition count 1614
Applied a total of 30 rules in 256 ms. Remains 618 /630 variables (removed 12) and now considering 1614/1646 (removed 32) transitions.
[2024-05-23 04:52:21] [INFO ] Flow matrix only has 1080 transitions (discarded 534 similar events)
// Phase 1: matrix 1080 rows 618 cols
[2024-05-23 04:52:21] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 04:52:21] [INFO ] Implicit Places using invariants in 372 ms returned []
[2024-05-23 04:52:21] [INFO ] Flow matrix only has 1080 transitions (discarded 534 similar events)
[2024-05-23 04:52:21] [INFO ] Invariant cache hit.
[2024-05-23 04:52:22] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 04:52:23] [INFO ] Implicit Places using invariants and state equation in 1807 ms returned []
Implicit Place search using SMT with State Equation took 2180 ms to find 0 implicit places.
[2024-05-23 04:52:23] [INFO ] Redundant transitions in 23 ms returned []
Running 1612 sub problems to find dead transitions.
[2024-05-23 04:52:23] [INFO ] Flow matrix only has 1080 transitions (discarded 534 similar events)
[2024-05-23 04:52:23] [INFO ] Invariant cache hit.
[2024-05-23 04:52:23] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 618/1698 variables, and 2 constraints, problems are : Problem set: 0 solved, 1612 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/618 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1612/1612 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1612 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/618 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/618 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/618 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 3 (OVERLAPS) 1080/1698 variables, 618/620 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1698 variables, 268/888 constraints. Problems are: Problem set: 0 solved, 1612 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1698/1698 variables, and 2500 constraints, problems are : Problem set: 0 solved, 1612 unsolved in 31294 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 618/618 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1612/1612 constraints, Known Traps: 0/0 constraints]
After SMT, in 69575ms problems are : Problem set: 0 solved, 1612 unsolved
Search for dead transitions found 0 dead transitions in 69589ms
Starting structural reductions in SI_LTL mode, iteration 1 : 618/630 places, 1614/1646 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72059 ms. Remains : 618/630 places, 1614/1646 transitions.
Treatment of property FunctionPointer-PT-c004-LTLFireability-13 finished in 386090 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0)||G(p1))))))'
Support contains 3 out of 791 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 791/791 places, 2050/2050 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 776 transition count 2018
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 776 transition count 2018
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 36 place count 776 transition count 2012
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 52 place count 760 transition count 1978
Iterating global reduction 1 with 16 rules applied. Total rules applied 68 place count 760 transition count 1978
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 72 place count 760 transition count 1974
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 86 place count 746 transition count 1930
Iterating global reduction 2 with 14 rules applied. Total rules applied 100 place count 746 transition count 1930
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 116 place count 730 transition count 1878
Iterating global reduction 2 with 16 rules applied. Total rules applied 132 place count 730 transition count 1878
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 150 place count 712 transition count 1830
Iterating global reduction 2 with 18 rules applied. Total rules applied 168 place count 712 transition count 1830
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 188 place count 692 transition count 1778
Iterating global reduction 2 with 20 rules applied. Total rules applied 208 place count 692 transition count 1778
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 227 place count 673 transition count 1732
Iterating global reduction 2 with 19 rules applied. Total rules applied 246 place count 673 transition count 1732
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 265 place count 654 transition count 1692
Iterating global reduction 2 with 19 rules applied. Total rules applied 284 place count 654 transition count 1692
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 302 place count 636 transition count 1654
Iterating global reduction 2 with 18 rules applied. Total rules applied 320 place count 636 transition count 1654
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 331 place count 625 transition count 1630
Iterating global reduction 2 with 11 rules applied. Total rules applied 342 place count 625 transition count 1630
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 350 place count 617 transition count 1614
Iterating global reduction 2 with 8 rules applied. Total rules applied 358 place count 617 transition count 1614
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 362 place count 613 transition count 1606
Iterating global reduction 2 with 4 rules applied. Total rules applied 366 place count 613 transition count 1606
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 368 place count 611 transition count 1602
Iterating global reduction 2 with 2 rules applied. Total rules applied 370 place count 611 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 371 place count 610 transition count 1600
Iterating global reduction 2 with 1 rules applied. Total rules applied 372 place count 610 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 373 place count 609 transition count 1598
Iterating global reduction 2 with 1 rules applied. Total rules applied 374 place count 609 transition count 1598
Applied a total of 374 rules in 249 ms. Remains 609 /791 variables (removed 182) and now considering 1598/2050 (removed 452) transitions.
[2024-05-23 04:53:33] [INFO ] Flow matrix only has 1068 transitions (discarded 530 similar events)
// Phase 1: matrix 1068 rows 609 cols
[2024-05-23 04:53:33] [INFO ] Computed 2 invariants in 12 ms
[2024-05-23 04:53:33] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-05-23 04:53:33] [INFO ] Flow matrix only has 1068 transitions (discarded 530 similar events)
[2024-05-23 04:53:33] [INFO ] Invariant cache hit.
[2024-05-23 04:53:34] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-23 04:53:35] [INFO ] Implicit Places using invariants and state equation in 1630 ms returned []
Implicit Place search using SMT with State Equation took 1988 ms to find 0 implicit places.
Running 1596 sub problems to find dead transitions.
[2024-05-23 04:53:35] [INFO ] Flow matrix only has 1068 transitions (discarded 530 similar events)
[2024-05-23 04:53:35] [INFO ] Invariant cache hit.
[2024-05-23 04:53:35] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1596 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1596 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 609/1677 variables, and 2 constraints, problems are : Problem set: 0 solved, 1596 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/609 constraints, ReadFeed: 0/266 constraints, PredecessorRefiner: 1596/1596 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1596 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1596 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/609 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1596 unsolved
At refinement iteration 3 (OVERLAPS) 1068/1677 variables, 609/611 constraints. Problems are: Problem set: 0 solved, 1596 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1677 variables, 266/877 constraints. Problems are: Problem set: 0 solved, 1596 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1677/1677 variables, and 2473 constraints, problems are : Problem set: 0 solved, 1596 unsolved in 31371 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 1596/1596 constraints, Known Traps: 0/0 constraints]
After SMT, in 69030ms problems are : Problem set: 0 solved, 1596 unsolved
Search for dead transitions found 0 dead transitions in 69046ms
Starting structural reductions in LTL mode, iteration 1 : 609/791 places, 1598/2050 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71286 ms. Remains : 609/791 places, 1598/2050 transitions.
Stuttering acceptance computed with spot in 270 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 373 ms.
Product exploration explored 100000 steps with 0 reset in 405 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 88 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40002 steps (8 resets) in 323 ms. (123 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 161 ms. (246 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 136315 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 6
Probabilistic random walk after 136315 steps, saw 88499 distinct states, run finished after 3002 ms. (steps per millisecond=45 ) properties seen :0
[2024-05-23 04:54:49] [INFO ] Flow matrix only has 1068 transitions (discarded 530 similar events)
[2024-05-23 04:54:49] [INFO ] Invariant cache hit.
[2024-05-23 04:54:49] [INFO ] State equation strengthened by 266 read => feed constraints.
Problem apf2 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 335/338 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1129/1467 variables, 466/469 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1467 variables, 266/735 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1467 variables, 0/735 constraints. Problems are: Problem set: 1 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1529 variables, 1/736 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1529 variables, 0/736 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/1530 variables, 1/737 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1530 variables, 1/738 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1530 variables, 0/738 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 135/1665 variables, 132/870 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1665 variables, 0/870 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 8/1673 variables, 4/874 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1673 variables, 0/874 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 4/1677 variables, 3/877 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1677 variables, 0/877 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/1677 variables, 0/877 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1677/1677 variables, and 877 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1208 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 335/338 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1129/1467 variables, 466/469 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1467 variables, 266/735 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1467 variables, 5/740 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1467 variables, 0/740 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 62/1529 variables, 1/741 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1529 variables, 0/741 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/1530 variables, 1/742 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1530 variables, 1/743 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1530 variables, 0/743 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 135/1665 variables, 132/875 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-23 04:54:52] [INFO ] Deduced a trap composed of 131 places in 160 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1665 variables, 1/876 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1665 variables, 0/876 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 8/1673 variables, 4/880 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1673 variables, 0/880 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 4/1677 variables, 3/883 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1677 variables, 0/883 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/1677 variables, 0/883 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1677/1677 variables, and 883 constraints, problems are : Problem set: 1 solved, 5 unsolved in 3338 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 4589ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 596 ms.
Support contains 3 out of 609 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 609/609 places, 1598/1598 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 609 transition count 1596
Applied a total of 2 rules in 150 ms. Remains 609 /609 variables (removed 0) and now considering 1596/1598 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 609/609 places, 1596/1598 transitions.
RANDOM walk for 40005 steps (8 resets) in 605 ms. (66 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 153991 steps, run timeout after 3008 ms. (steps per millisecond=51 ) properties seen :0 out of 5
Probabilistic random walk after 153991 steps, saw 99971 distinct states, run finished after 3008 ms. (steps per millisecond=51 ) properties seen :0
[2024-05-23 04:54:58] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
// Phase 1: matrix 1067 rows 609 cols
[2024-05-23 04:54:58] [INFO ] Computed 2 invariants in 6 ms
[2024-05-23 04:54:58] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 335/338 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1128/1466 variables, 466/469 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1466 variables, 266/735 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1466 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1528 variables, 1/736 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1528 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/1529 variables, 1/737 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1529 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1529 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 133/1662 variables, 131/869 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 8/1670 variables, 4/873 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1670 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 6/1676 variables, 4/877 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1676 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/1676 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1676/1676 variables, and 877 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1134 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 335/338 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1128/1466 variables, 466/469 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1466 variables, 266/735 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1466 variables, 5/740 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1466 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 62/1528 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1528 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/1529 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1529 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1529 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 133/1662 variables, 131/874 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-23 04:55:01] [INFO ] Deduced a trap composed of 131 places in 147 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1662 variables, 1/875 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1662 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 8/1670 variables, 4/879 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1670 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 6/1676 variables, 4/883 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1676 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/1676 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1676/1676 variables, and 883 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3632 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 4809ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 879 ms.
Support contains 3 out of 609 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 609/609 places, 1596/1596 transitions.
Applied a total of 0 rules in 73 ms. Remains 609 /609 variables (removed 0) and now considering 1596/1596 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 609/609 places, 1596/1596 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 609/609 places, 1596/1596 transitions.
Applied a total of 0 rules in 77 ms. Remains 609 /609 variables (removed 0) and now considering 1596/1596 (removed 0) transitions.
[2024-05-23 04:55:04] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-23 04:55:04] [INFO ] Invariant cache hit.
[2024-05-23 04:55:04] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-05-23 04:55:04] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-23 04:55:04] [INFO ] Invariant cache hit.
[2024-05-23 04:55:04] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-23 04:55:05] [INFO ] Implicit Places using invariants and state equation in 1612 ms returned []
Implicit Place search using SMT with State Equation took 1962 ms to find 0 implicit places.
[2024-05-23 04:55:06] [INFO ] Redundant transitions in 27 ms returned []
Running 1594 sub problems to find dead transitions.
[2024-05-23 04:55:06] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-23 04:55:06] [INFO ] Invariant cache hit.
[2024-05-23 04:55:06] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 609/1676 variables, and 2 constraints, problems are : Problem set: 0 solved, 1594 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/609 constraints, ReadFeed: 0/266 constraints, PredecessorRefiner: 1594/1594 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1594 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/609 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 3 (OVERLAPS) 1067/1676 variables, 609/611 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1676 variables, 266/877 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1676/1676 variables, and 2471 constraints, problems are : Problem set: 0 solved, 1594 unsolved in 31274 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 1594/1594 constraints, Known Traps: 0/0 constraints]
After SMT, in 69087ms problems are : Problem set: 0 solved, 1594 unsolved
Search for dead transitions found 0 dead transitions in 69102ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71181 ms. Remains : 609/609 places, 1596/1596 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 936 edges and 609 vertex of which 192 / 609 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 401 transitions
Reduce isomorphic transitions removed 721 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 481 transition count 865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 471 transition count 865
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 21 place count 471 transition count 798
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 155 place count 404 transition count 798
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 218 place count 341 transition count 735
Iterating global reduction 2 with 63 rules applied. Total rules applied 281 place count 341 transition count 735
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 407 place count 341 transition count 609
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 665 place count 212 transition count 480
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 729 place count 148 transition count 352
Iterating global reduction 3 with 64 rules applied. Total rules applied 793 place count 148 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 794 place count 148 transition count 351
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 794 place count 148 transition count 350
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 796 place count 147 transition count 350
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 859 place count 84 transition count 224
Iterating global reduction 4 with 63 rules applied. Total rules applied 922 place count 84 transition count 224
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 985 place count 21 transition count 98
Iterating global reduction 4 with 63 rules applied. Total rules applied 1048 place count 21 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1111 place count 21 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1111 place count 21 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1113 place count 20 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 1117 place count 20 transition count 30
Applied a total of 1117 rules in 31 ms. Remains 20 /609 variables (removed 589) and now considering 30/1596 (removed 1566) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 30 rows 20 cols
[2024-05-23 04:56:15] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 04:56:15] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 04:56:15] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 04:56:15] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-23 04:56:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 04:56:15] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 04:56:15] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-23 04:56:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 04:56:15] [INFO ] After 12ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-23 04:56:15] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-23 04:56:15] [INFO ] After 85ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 154 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (G (OR p0 p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 236 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 609 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 609/609 places, 1598/1598 transitions.
Applied a total of 0 rules in 15 ms. Remains 609 /609 variables (removed 0) and now considering 1598/1598 (removed 0) transitions.
[2024-05-23 04:56:15] [INFO ] Flow matrix only has 1068 transitions (discarded 530 similar events)
// Phase 1: matrix 1068 rows 609 cols
[2024-05-23 04:56:15] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 04:56:16] [INFO ] Implicit Places using invariants in 384 ms returned []
[2024-05-23 04:56:16] [INFO ] Flow matrix only has 1068 transitions (discarded 530 similar events)
[2024-05-23 04:56:16] [INFO ] Invariant cache hit.
[2024-05-23 04:56:16] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-23 04:56:17] [INFO ] Implicit Places using invariants and state equation in 1643 ms returned []
Implicit Place search using SMT with State Equation took 2028 ms to find 0 implicit places.
Running 1596 sub problems to find dead transitions.
[2024-05-23 04:56:17] [INFO ] Flow matrix only has 1068 transitions (discarded 530 similar events)
[2024-05-23 04:56:17] [INFO ] Invariant cache hit.
[2024-05-23 04:56:17] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1596 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1596 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 609/1677 variables, and 2 constraints, problems are : Problem set: 0 solved, 1596 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/609 constraints, ReadFeed: 0/266 constraints, PredecessorRefiner: 1596/1596 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1596 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1596 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/609 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1596 unsolved
At refinement iteration 3 (OVERLAPS) 1068/1677 variables, 609/611 constraints. Problems are: Problem set: 0 solved, 1596 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1677 variables, 266/877 constraints. Problems are: Problem set: 0 solved, 1596 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1677/1677 variables, and 2473 constraints, problems are : Problem set: 0 solved, 1596 unsolved in 31517 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 1596/1596 constraints, Known Traps: 0/0 constraints]
After SMT, in 70197ms problems are : Problem set: 0 solved, 1596 unsolved
Search for dead transitions found 0 dead transitions in 70215ms
Finished structural reductions in LTL mode , in 1 iterations and 72261 ms. Remains : 609/609 places, 1598/1598 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 88 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40002 steps (8 resets) in 474 ms. (84 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 179823 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 3
Probabilistic random walk after 179823 steps, saw 116736 distinct states, run finished after 3002 ms. (steps per millisecond=59 ) properties seen :0
[2024-05-23 04:57:31] [INFO ] Flow matrix only has 1068 transitions (discarded 530 similar events)
[2024-05-23 04:57:31] [INFO ] Invariant cache hit.
[2024-05-23 04:57:31] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 335/338 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1129/1467 variables, 466/469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1467 variables, 266/735 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1467 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1529 variables, 1/736 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1529 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/1530 variables, 1/737 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1530 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1530 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 135/1665 variables, 132/870 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1665 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 8/1673 variables, 4/874 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1673 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 4/1677 variables, 3/877 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1677 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1677 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1677/1677 variables, and 877 constraints, problems are : Problem set: 0 solved, 3 unsolved in 825 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 335/338 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1129/1467 variables, 466/469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1467 variables, 266/735 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1467 variables, 3/738 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1467 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 62/1529 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1529 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/1530 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1530 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1530 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 135/1665 variables, 132/873 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 04:57:33] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1665 variables, 1/874 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1665 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 8/1673 variables, 4/878 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1673 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 4/1677 variables, 3/881 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1677 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1677 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1677/1677 variables, and 881 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2210 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 3069ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 497 ms.
Support contains 3 out of 609 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 609/609 places, 1598/1598 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 609 transition count 1596
Applied a total of 2 rules in 151 ms. Remains 609 /609 variables (removed 0) and now considering 1596/1598 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 609/609 places, 1596/1598 transitions.
RANDOM walk for 40001 steps (8 resets) in 658 ms. (60 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 182077 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 3
Probabilistic random walk after 182077 steps, saw 118199 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
[2024-05-23 04:57:38] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
// Phase 1: matrix 1067 rows 609 cols
[2024-05-23 04:57:38] [INFO ] Computed 2 invariants in 8 ms
[2024-05-23 04:57:38] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 335/338 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1128/1466 variables, 466/469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1466 variables, 266/735 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1466 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 62/1528 variables, 1/736 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1528 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/1529 variables, 1/737 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1529 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1529 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 133/1662 variables, 131/869 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 8/1670 variables, 4/873 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1670 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 6/1676 variables, 4/877 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1676 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1676 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1676/1676 variables, and 877 constraints, problems are : Problem set: 0 solved, 3 unsolved in 845 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 335/338 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1128/1466 variables, 466/469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1466 variables, 266/735 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1466 variables, 3/738 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1466 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 62/1528 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1528 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/1529 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1529 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1529 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 133/1662 variables, 131/872 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1662 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 8/1670 variables, 4/876 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1670 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 6/1676 variables, 4/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1676 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1676 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1676/1676 variables, and 880 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1720 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2603ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 609 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 609/609 places, 1596/1596 transitions.
Applied a total of 0 rules in 77 ms. Remains 609 /609 variables (removed 0) and now considering 1596/1596 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 609/609 places, 1596/1596 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 609/609 places, 1596/1596 transitions.
Applied a total of 0 rules in 73 ms. Remains 609 /609 variables (removed 0) and now considering 1596/1596 (removed 0) transitions.
[2024-05-23 04:57:41] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-23 04:57:41] [INFO ] Invariant cache hit.
[2024-05-23 04:57:41] [INFO ] Implicit Places using invariants in 350 ms returned []
[2024-05-23 04:57:41] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-23 04:57:41] [INFO ] Invariant cache hit.
[2024-05-23 04:57:42] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-23 04:57:43] [INFO ] Implicit Places using invariants and state equation in 1572 ms returned []
Implicit Place search using SMT with State Equation took 1925 ms to find 0 implicit places.
[2024-05-23 04:57:43] [INFO ] Redundant transitions in 24 ms returned []
Running 1594 sub problems to find dead transitions.
[2024-05-23 04:57:43] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-23 04:57:43] [INFO ] Invariant cache hit.
[2024-05-23 04:57:43] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 609/1676 variables, and 2 constraints, problems are : Problem set: 0 solved, 1594 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/609 constraints, ReadFeed: 0/266 constraints, PredecessorRefiner: 1594/1594 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1594 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/609 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 3 (OVERLAPS) 1067/1676 variables, 609/611 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1676 variables, 266/877 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1676/1676 variables, and 2471 constraints, problems are : Problem set: 0 solved, 1594 unsolved in 31134 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 1594/1594 constraints, Known Traps: 0/0 constraints]
After SMT, in 68369ms problems are : Problem set: 0 solved, 1594 unsolved
Search for dead transitions found 0 dead transitions in 68382ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70411 ms. Remains : 609/609 places, 1596/1596 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 936 edges and 609 vertex of which 192 / 609 are part of one of the 64 SCC in 0 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 401 transitions
Reduce isomorphic transitions removed 721 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 481 transition count 865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 471 transition count 865
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 21 place count 471 transition count 798
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 155 place count 404 transition count 798
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 218 place count 341 transition count 735
Iterating global reduction 2 with 63 rules applied. Total rules applied 281 place count 341 transition count 735
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 407 place count 341 transition count 609
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 665 place count 212 transition count 480
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 729 place count 148 transition count 352
Iterating global reduction 3 with 64 rules applied. Total rules applied 793 place count 148 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 794 place count 148 transition count 351
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 794 place count 148 transition count 350
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 796 place count 147 transition count 350
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 859 place count 84 transition count 224
Iterating global reduction 4 with 63 rules applied. Total rules applied 922 place count 84 transition count 224
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 985 place count 21 transition count 98
Iterating global reduction 4 with 63 rules applied. Total rules applied 1048 place count 21 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1111 place count 21 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1111 place count 21 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1113 place count 20 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 1117 place count 20 transition count 30
Applied a total of 1117 rules in 33 ms. Remains 20 /609 variables (removed 589) and now considering 30/1596 (removed 1566) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 30 rows 20 cols
[2024-05-23 04:58:51] [INFO ] Computed 2 invariants in 0 ms
[2024-05-23 04:58:52] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 04:58:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 04:58:52] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 04:58:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 04:58:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 04:58:52] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-23 04:58:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 04:58:52] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-23 04:58:52] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-23 04:58:52] [INFO ] After 59ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 132 ms.
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 106 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 208 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 218 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 374 ms.
Product exploration explored 100000 steps with 0 reset in 405 ms.
Applying partial POR strategy [true, true, false, true, false, false, false]
Stuttering acceptance computed with spot in 229 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 609 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 609/609 places, 1598/1598 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 609 transition count 1596
Applied a total of 2 rules in 172 ms. Remains 609 /609 variables (removed 0) and now considering 1596/1598 (removed 2) transitions.
[2024-05-23 04:58:54] [INFO ] Redundant transitions in 20 ms returned []
Running 1594 sub problems to find dead transitions.
[2024-05-23 04:58:54] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
// Phase 1: matrix 1067 rows 609 cols
[2024-05-23 04:58:54] [INFO ] Computed 2 invariants in 9 ms
[2024-05-23 04:58:54] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1594 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 609/1676 variables, and 2 constraints, problems are : Problem set: 0 solved, 1594 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/609 constraints, ReadFeed: 0/266 constraints, PredecessorRefiner: 1594/1594 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1594 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/609 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 3 (OVERLAPS) 1067/1676 variables, 609/611 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1676 variables, 266/877 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1676/1676 variables, and 2471 constraints, problems are : Problem set: 0 solved, 1594 unsolved in 31032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 1594/1594 constraints, Known Traps: 0/0 constraints]
After SMT, in 68365ms problems are : Problem set: 0 solved, 1594 unsolved
Search for dead transitions found 0 dead transitions in 68385ms
Starting structural reductions in SI_LTL mode, iteration 1 : 609/609 places, 1596/1598 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 68588 ms. Remains : 609/609 places, 1596/1598 transitions.
Support contains 3 out of 609 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 609/609 places, 1598/1598 transitions.
Applied a total of 0 rules in 13 ms. Remains 609 /609 variables (removed 0) and now considering 1598/1598 (removed 0) transitions.
[2024-05-23 05:00:02] [INFO ] Flow matrix only has 1068 transitions (discarded 530 similar events)
// Phase 1: matrix 1068 rows 609 cols
[2024-05-23 05:00:02] [INFO ] Computed 2 invariants in 16 ms
[2024-05-23 05:00:02] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-23 05:00:02] [INFO ] Flow matrix only has 1068 transitions (discarded 530 similar events)
[2024-05-23 05:00:02] [INFO ] Invariant cache hit.
[2024-05-23 05:00:03] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-23 05:00:04] [INFO ] Implicit Places using invariants and state equation in 1615 ms returned []
Implicit Place search using SMT with State Equation took 1987 ms to find 0 implicit places.
Running 1596 sub problems to find dead transitions.
[2024-05-23 05:00:04] [INFO ] Flow matrix only has 1068 transitions (discarded 530 similar events)
[2024-05-23 05:00:04] [INFO ] Invariant cache hit.
[2024-05-23 05:00:04] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1596 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1596 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 609/1677 variables, and 2 constraints, problems are : Problem set: 0 solved, 1596 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/609 constraints, ReadFeed: 0/266 constraints, PredecessorRefiner: 1596/1596 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1596 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/609 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1596 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/609 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/609 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1596 unsolved
At refinement iteration 3 (OVERLAPS) 1068/1677 variables, 609/611 constraints. Problems are: Problem set: 0 solved, 1596 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1677 variables, 266/877 constraints. Problems are: Problem set: 0 solved, 1596 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1677/1677 variables, and 2473 constraints, problems are : Problem set: 0 solved, 1596 unsolved in 31464 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 609/609 constraints, ReadFeed: 266/266 constraints, PredecessorRefiner: 1596/1596 constraints, Known Traps: 0/0 constraints]
After SMT, in 68980ms problems are : Problem set: 0 solved, 1596 unsolved
Search for dead transitions found 0 dead transitions in 68997ms
Finished structural reductions in LTL mode , in 1 iterations and 71001 ms. Remains : 609/609 places, 1598/1598 transitions.
Treatment of property FunctionPointer-PT-c004-LTLFireability-14 finished in 460332 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' '!(G(F(((!p0&&X(!p1))||G(!p1)))))'
Found a Shortening insensitive property : FunctionPointer-PT-c004-LTLFireability-02
Stuttering acceptance computed with spot in 117 ms :[p1, p1, p1]
Support contains 3 out of 791 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 791/791 places, 2050/2050 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 776 transition count 2018
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 776 transition count 2018
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 38 place count 776 transition count 2010
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 53 place count 761 transition count 1978
Iterating global reduction 1 with 15 rules applied. Total rules applied 68 place count 761 transition count 1978
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 72 place count 761 transition count 1974
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 84 place count 749 transition count 1936
Iterating global reduction 2 with 12 rules applied. Total rules applied 96 place count 749 transition count 1936
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 110 place count 735 transition count 1890
Iterating global reduction 2 with 14 rules applied. Total rules applied 124 place count 735 transition count 1890
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 140 place count 719 transition count 1846
Iterating global reduction 2 with 16 rules applied. Total rules applied 156 place count 719 transition count 1846
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 172 place count 703 transition count 1808
Iterating global reduction 2 with 16 rules applied. Total rules applied 188 place count 703 transition count 1808
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 204 place count 687 transition count 1772
Iterating global reduction 2 with 16 rules applied. Total rules applied 220 place count 687 transition count 1772
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 236 place count 671 transition count 1736
Iterating global reduction 2 with 16 rules applied. Total rules applied 252 place count 671 transition count 1736
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 268 place count 655 transition count 1700
Iterating global reduction 2 with 16 rules applied. Total rules applied 284 place count 655 transition count 1700
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 294 place count 645 transition count 1676
Iterating global reduction 2 with 10 rules applied. Total rules applied 304 place count 645 transition count 1676
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 311 place count 638 transition count 1662
Iterating global reduction 2 with 7 rules applied. Total rules applied 318 place count 638 transition count 1662
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 322 place count 634 transition count 1654
Iterating global reduction 2 with 4 rules applied. Total rules applied 326 place count 634 transition count 1654
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 330 place count 630 transition count 1646
Iterating global reduction 2 with 4 rules applied. Total rules applied 334 place count 630 transition count 1646
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 336 place count 628 transition count 1642
Iterating global reduction 2 with 2 rules applied. Total rules applied 338 place count 628 transition count 1642
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 340 place count 626 transition count 1638
Iterating global reduction 2 with 2 rules applied. Total rules applied 342 place count 626 transition count 1638
Applied a total of 342 rules in 296 ms. Remains 626 /791 variables (removed 165) and now considering 1638/2050 (removed 412) transitions.
[2024-05-23 05:01:14] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
// Phase 1: matrix 1092 rows 626 cols
[2024-05-23 05:01:14] [INFO ] Computed 2 invariants in 15 ms
[2024-05-23 05:01:14] [INFO ] Implicit Places using invariants in 384 ms returned []
[2024-05-23 05:01:14] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2024-05-23 05:01:14] [INFO ] Invariant cache hit.
[2024-05-23 05:01:14] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 05:01:16] [INFO ] Implicit Places using invariants and state equation in 1757 ms returned []
Implicit Place search using SMT with State Equation took 2143 ms to find 0 implicit places.
Running 1636 sub problems to find dead transitions.
[2024-05-23 05:01:16] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2024-05-23 05:01:16] [INFO ] Invariant cache hit.
[2024-05-23 05:01:16] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/1718 variables, and 2 constraints, problems are : Problem set: 0 solved, 1636 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/626 constraints, ReadFeed: 0/268 constraints, PredecessorRefiner: 1636/1636 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1636 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/626 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/626 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/626 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
At refinement iteration 3 (OVERLAPS) 1092/1718 variables, 626/628 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1718 variables, 268/896 constraints. Problems are: Problem set: 0 solved, 1636 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1718/1718 variables, and 2532 constraints, problems are : Problem set: 0 solved, 1636 unsolved in 31591 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 626/626 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 1636/1636 constraints, Known Traps: 0/0 constraints]
After SMT, in 69608ms problems are : Problem set: 0 solved, 1636 unsolved
Search for dead transitions found 0 dead transitions in 69625ms
Starting structural reductions in LI_LTL mode, iteration 1 : 626/791 places, 1638/2050 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 72067 ms. Remains : 626/791 places, 1638/2050 transitions.
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 418 ms.
Product exploration explored 100000 steps with 0 reset in 461 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 118 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[p1, p1, p1]
RANDOM walk for 40007 steps (8 resets) in 496 ms. (80 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 115721 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 6
Probabilistic random walk after 115721 steps, saw 75133 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
[2024-05-23 05:02:30] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2024-05-23 05:02:30] [INFO ] Invariant cache hit.
[2024-05-23 05:02:30] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 339/342 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1156/1498 variables, 477/480 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1498 variables, 268/748 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 62/1560 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1560 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/1561 variables, 1/750 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1561 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1561 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 145/1706 variables, 138/889 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1706 variables, 0/889 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 8/1714 variables, 4/893 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1714 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 4/1718 variables, 3/896 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1718 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/1718 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1718/1718 variables, and 896 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1755 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 626/626 constraints, ReadFeed: 268/268 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 339/342 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1156/1498 variables, 477/480 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1498 variables, 268/748 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1498 variables, 6/754 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1498 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 62/1560 variables, 1/755 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1560 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1/1561 variables, 1/756 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1561 variables, 1/757 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1561 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 145/1706 variables, 138/895 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-23 05:02:34] [INFO ] Deduced a trap composed of 131 places in 149 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1706 variables, 1/896 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1706 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 8/1714 variables, 4/900 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1714 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 4/1718 variables, 3/903 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1718 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/1718 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1718/1718 variables, and 903 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4366 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 626/626 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 6163ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 3 properties in 2593 ms.
Support contains 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1638/1638 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 1632
Applied a total of 6 rules in 159 ms. Remains 626 /626 variables (removed 0) and now considering 1632/1638 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 626/626 places, 1632/1638 transitions.
RANDOM walk for 40000 steps (8 resets) in 425 ms. (93 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 192984 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 3
Probabilistic random walk after 192984 steps, saw 125277 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
[2024-05-23 05:02:42] [INFO ] Flow matrix only has 1089 transitions (discarded 543 similar events)
// Phase 1: matrix 1089 rows 626 cols
[2024-05-23 05:02:42] [INFO ] Computed 2 invariants in 5 ms
[2024-05-23 05:02:42] [INFO ] State equation strengthened by 268 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 339/342 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1153/1495 variables, 477/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 268/748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1495 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 62/1557 variables, 1/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1557 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/1558 variables, 1/750 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1558 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1558 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 142/1700 variables, 136/887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1700 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 9/1709 variables, 5/892 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1709 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 6/1715 variables, 4/896 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1715 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1715 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1715/1715 variables, and 896 constraints, problems are : Problem set: 0 solved, 3 unsolved in 940 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 626/626 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 339/342 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1153/1495 variables, 477/480 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1495 variables, 268/748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1495 variables, 3/751 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1495 variables, 0/751 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 62/1557 variables, 1/752 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1557 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/1558 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1558 variables, 1/754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1558 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 142/1700 variables, 136/890 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 05:02:45] [INFO ] Deduced a trap composed of 131 places in 153 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1700 variables, 1/891 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1700 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 9/1709 variables, 5/896 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1709 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 6/1715 variables, 4/900 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1715 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1715 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1715/1715 variables, and 900 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2278 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 626/626 constraints, ReadFeed: 268/268 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 3255ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1173 ms.
Support contains 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1632/1632 transitions.
Applied a total of 0 rules in 75 ms. Remains 626 /626 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 626/626 places, 1632/1632 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1632/1632 transitions.
Applied a total of 0 rules in 82 ms. Remains 626 /626 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
[2024-05-23 05:02:47] [INFO ] Flow matrix only has 1089 transitions (discarded 543 similar events)
[2024-05-23 05:02:47] [INFO ] Invariant cache hit.
[2024-05-23 05:02:47] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-05-23 05:02:47] [INFO ] Flow matrix only has 1089 transitions (discarded 543 similar events)
[2024-05-23 05:02:47] [INFO ] Invariant cache hit.
[2024-05-23 05:02:48] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-23 05:02:49] [INFO ] Implicit Places using invariants and state equation in 1682 ms returned []
Implicit Place search using SMT with State Equation took 2049 ms to find 0 implicit places.
[2024-05-23 05:02:49] [INFO ] Redundant transitions in 26 ms returned []
Running 1630 sub problems to find dead transitions.
[2024-05-23 05:02:49] [INFO ] Flow matrix only has 1089 transitions (discarded 543 similar events)
[2024-05-23 05:02:49] [INFO ] Invariant cache hit.
[2024-05-23 05:02:49] [INFO ] State equation strengthened by 268 read => feed constraints.

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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-c004"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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