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.r157-smll-171636265200196.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 EisenbergMcGuire-PT-09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r157-smll-171636265200196
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 28K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.3M 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 EisenbergMcGuire-PT-09-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716523436250

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 04:03:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-24 04:03:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 04:03:58] [INFO ] Load time of PNML (sax parser for PT used): 436 ms
[2024-05-24 04:03:58] [INFO ] Transformed 891 places.
[2024-05-24 04:03:58] [INFO ] Transformed 3888 transitions.
[2024-05-24 04:03:58] [INFO ] Found NUPN structural information;
[2024-05-24 04:03:58] [INFO ] Parsed PT model containing 891 places and 3888 transitions and 18792 arcs in 773 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 52 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 891 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 891/891 places, 3888/3888 transitions.
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 68 place count 823 transition count 3276
Iterating global reduction 0 with 68 rules applied. Total rules applied 136 place count 823 transition count 3276
Applied a total of 136 rules in 373 ms. Remains 823 /891 variables (removed 68) and now considering 3276/3888 (removed 612) transitions.
[2024-05-24 04:03:59] [INFO ] Flow matrix only has 1197 transitions (discarded 2079 similar events)
// Phase 1: matrix 1197 rows 823 cols
[2024-05-24 04:03:59] [INFO ] Computed 28 invariants in 43 ms
[2024-05-24 04:04:01] [INFO ] Implicit Places using invariants in 1660 ms returned []
[2024-05-24 04:04:01] [INFO ] Flow matrix only has 1197 transitions (discarded 2079 similar events)
[2024-05-24 04:04:01] [INFO ] Invariant cache hit.
[2024-05-24 04:04:02] [INFO ] State equation strengthened by 388 read => feed constraints.
[2024-05-24 04:04:07] [INFO ] Implicit Places using invariants and state equation in 6019 ms returned []
Implicit Place search using SMT with State Equation took 7815 ms to find 0 implicit places.
Running 3267 sub problems to find dead transitions.
[2024-05-24 04:04:07] [INFO ] Flow matrix only has 1197 transitions (discarded 2079 similar events)
[2024-05-24 04:04:07] [INFO ] Invariant cache hit.
[2024-05-24 04:04:07] [INFO ] State equation strengthened by 388 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/823 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3267 unsolved
SMT process timed out in 33396ms, After SMT, problems are : Problem set: 0 solved, 3267 unsolved
Search for dead transitions found 0 dead transitions in 33523ms
Starting structural reductions in LTL mode, iteration 1 : 823/891 places, 3276/3888 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41781 ms. Remains : 823/891 places, 3276/3888 transitions.
Support contains 60 out of 823 places after structural reductions.
[2024-05-24 04:04:41] [INFO ] Flatten gal took : 312 ms
[2024-05-24 04:04:41] [INFO ] Flatten gal took : 223 ms
[2024-05-24 04:04:42] [INFO ] Input system was already deterministic with 3276 transitions.
Support contains 57 out of 823 places (down from 60) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 36 to 34
RANDOM walk for 40000 steps (8 resets) in 2517 ms. (15 steps per ms) remains 26/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
[2024-05-24 04:04:43] [INFO ] Flow matrix only has 1197 transitions (discarded 2079 similar events)
[2024-05-24 04:04:43] [INFO ] Invariant cache hit.
[2024-05-24 04:04:43] [INFO ] State equation strengthened by 388 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 769/816 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/816 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 26 unsolved
[2024-05-24 04:04:44] [INFO ] Deduced a trap composed of 62 places in 831 ms of which 84 ms to minimize.
[2024-05-24 04:04:45] [INFO ] Deduced a trap composed of 62 places in 840 ms of which 9 ms to minimize.
[2024-05-24 04:04:46] [INFO ] Deduced a trap composed of 176 places in 723 ms of which 9 ms to minimize.
[2024-05-24 04:04:47] [INFO ] Deduced a trap composed of 35 places in 835 ms of which 8 ms to minimize.
[2024-05-24 04:04:48] [INFO ] Deduced a trap composed of 176 places in 882 ms of which 7 ms to minimize.
[2024-05-24 04:04:49] [INFO ] Deduced a trap composed of 3 places in 804 ms of which 8 ms to minimize.
SMT process timed out in 5598ms, After SMT, problems are : Problem set: 0 solved, 26 unsolved
Fused 26 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 47 out of 823 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 248 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 248 Pre rules applied. Total rules applied 18 place count 814 transition count 3019
Deduced a syphon composed of 248 places in 3 ms
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 2 with 496 rules applied. Total rules applied 514 place count 566 transition count 3019
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 516 place count 564 transition count 3001
Iterating global reduction 2 with 2 rules applied. Total rules applied 518 place count 564 transition count 3001
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 4 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 662 place count 492 transition count 2929
Applied a total of 662 rules in 453 ms. Remains 492 /823 variables (removed 331) and now considering 2929/3276 (removed 347) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 453 ms. Remains : 492/823 places, 2929/3276 transitions.
RANDOM walk for 40000 steps (8 resets) in 741 ms. (53 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 26/26 properties
Interrupted probabilistic random walk after 95830 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :5 out of 26
Probabilistic random walk after 95830 steps, saw 66875 distinct states, run finished after 3008 ms. (steps per millisecond=31 ) properties seen :5
[2024-05-24 04:04:53] [INFO ] Flow matrix only has 850 transitions (discarded 2079 similar events)
// Phase 1: matrix 850 rows 492 cols
[2024-05-24 04:04:53] [INFO ] Computed 28 invariants in 8 ms
[2024-05-24 04:04:53] [INFO ] State equation strengthened by 372 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 340/380 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 90/470 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 04:04:53] [INFO ] Deduced a trap composed of 3 places in 378 ms of which 5 ms to minimize.
[2024-05-24 04:04:54] [INFO ] Deduced a trap composed of 27 places in 322 ms of which 4 ms to minimize.
[2024-05-24 04:04:54] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 2 ms to minimize.
[2024-05-24 04:04:54] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2024-05-24 04:04:54] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-24 04:04:54] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 2 ms to minimize.
[2024-05-24 04:04:55] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 2 ms to minimize.
[2024-05-24 04:04:55] [INFO ] Deduced a trap composed of 3 places in 205 ms of which 3 ms to minimize.
[2024-05-24 04:04:55] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 9/33 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 04:04:55] [INFO ] Deduced a trap composed of 42 places in 206 ms of which 3 ms to minimize.
[2024-05-24 04:04:55] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 04:04:56] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 22/492 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 850/1342 variables, 492/532 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1342 variables, 372/904 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1342 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (OVERLAPS) 0/1342 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1342/1342 variables, and 904 constraints, problems are : Problem set: 0 solved, 21 unsolved in 6393 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 492/492 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 340/380 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 90/470 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 04:05:00] [INFO ] Deduced a trap composed of 26 places in 410 ms of which 4 ms to minimize.
[2024-05-24 04:05:01] [INFO ] Deduced a trap composed of 18 places in 408 ms of which 4 ms to minimize.
[2024-05-24 04:05:01] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 3 ms to minimize.
[2024-05-24 04:05:01] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 2 ms to minimize.
[2024-05-24 04:05:01] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:05:01] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 2 ms to minimize.
[2024-05-24 04:05:01] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 2 ms to minimize.
[2024-05-24 04:05:02] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2024-05-24 04:05:02] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 2 ms to minimize.
[2024-05-24 04:05:02] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 1 ms to minimize.
[2024-05-24 04:05:02] [INFO ] Deduced a trap composed of 55 places in 102 ms of which 2 ms to minimize.
[2024-05-24 04:05:02] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 04:05:02] [INFO ] Deduced a trap composed of 15 places in 207 ms of which 3 ms to minimize.
[2024-05-24 04:05:03] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 2 ms to minimize.
[2024-05-24 04:05:03] [INFO ] Deduced a trap composed of 11 places in 195 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 22/492 variables, 4/55 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 04:05:04] [INFO ] Deduced a trap composed of 3 places in 529 ms of which 5 ms to minimize.
[2024-05-24 04:05:05] [INFO ] Deduced a trap composed of 98 places in 439 ms of which 5 ms to minimize.
[2024-05-24 04:05:05] [INFO ] Deduced a trap composed of 13 places in 442 ms of which 4 ms to minimize.
[2024-05-24 04:05:05] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 2 ms to minimize.
[2024-05-24 04:05:06] [INFO ] Deduced a trap composed of 3 places in 161 ms of which 2 ms to minimize.
[2024-05-24 04:05:06] [INFO ] Deduced a trap composed of 49 places in 431 ms of which 4 ms to minimize.
[2024-05-24 04:05:07] [INFO ] Deduced a trap composed of 26 places in 430 ms of which 4 ms to minimize.
[2024-05-24 04:05:07] [INFO ] Deduced a trap composed of 99 places in 419 ms of which 4 ms to minimize.
[2024-05-24 04:05:07] [INFO ] Deduced a trap composed of 96 places in 368 ms of which 4 ms to minimize.
[2024-05-24 04:05:08] [INFO ] Deduced a trap composed of 88 places in 370 ms of which 4 ms to minimize.
[2024-05-24 04:05:08] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 2 ms to minimize.
[2024-05-24 04:05:08] [INFO ] Deduced a trap composed of 109 places in 407 ms of which 4 ms to minimize.
[2024-05-24 04:05:09] [INFO ] Deduced a trap composed of 24 places in 404 ms of which 4 ms to minimize.
[2024-05-24 04:05:09] [INFO ] Deduced a trap composed of 97 places in 409 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 14/69 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 04:05:10] [INFO ] Deduced a trap composed of 19 places in 509 ms of which 5 ms to minimize.
[2024-05-24 04:05:10] [INFO ] Deduced a trap composed of 69 places in 488 ms of which 4 ms to minimize.
[2024-05-24 04:05:11] [INFO ] Deduced a trap composed of 88 places in 457 ms of which 4 ms to minimize.
[2024-05-24 04:05:12] [INFO ] Deduced a trap composed of 134 places in 510 ms of which 4 ms to minimize.
[2024-05-24 04:05:12] [INFO ] Deduced a trap composed of 105 places in 430 ms of which 5 ms to minimize.
[2024-05-24 04:05:13] [INFO ] Deduced a trap composed of 96 places in 439 ms of which 4 ms to minimize.
[2024-05-24 04:05:13] [INFO ] Deduced a trap composed of 109 places in 511 ms of which 5 ms to minimize.
[2024-05-24 04:05:14] [INFO ] Deduced a trap composed of 98 places in 498 ms of which 5 ms to minimize.
[2024-05-24 04:05:14] [INFO ] Deduced a trap composed of 102 places in 497 ms of which 5 ms to minimize.
[2024-05-24 04:05:15] [INFO ] Deduced a trap composed of 100 places in 445 ms of which 4 ms to minimize.
[2024-05-24 04:05:15] [INFO ] Deduced a trap composed of 138 places in 493 ms of which 5 ms to minimize.
[2024-05-24 04:05:16] [INFO ] Deduced a trap composed of 144 places in 514 ms of which 5 ms to minimize.
[2024-05-24 04:05:16] [INFO ] Deduced a trap composed of 23 places in 487 ms of which 4 ms to minimize.
[2024-05-24 04:05:17] [INFO ] Deduced a trap composed of 113 places in 453 ms of which 4 ms to minimize.
[2024-05-24 04:05:17] [INFO ] Deduced a trap composed of 21 places in 500 ms of which 4 ms to minimize.
[2024-05-24 04:05:18] [INFO ] Deduced a trap composed of 85 places in 502 ms of which 5 ms to minimize.
[2024-05-24 04:05:18] [INFO ] Deduced a trap composed of 19 places in 388 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 17/86 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 04:05:19] [INFO ] Deduced a trap composed of 114 places in 427 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 04:05:20] [INFO ] Deduced a trap composed of 101 places in 458 ms of which 4 ms to minimize.
[2024-05-24 04:05:20] [INFO ] Deduced a trap composed of 100 places in 446 ms of which 4 ms to minimize.
[2024-05-24 04:05:21] [INFO ] Deduced a trap composed of 98 places in 389 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/492 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 16 (OVERLAPS) 850/1342 variables, 492/582 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1342 variables, 372/954 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1342 variables, 21/975 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 04:05:24] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1342 variables, 1/976 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1342 variables, 0/976 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 04:05:28] [INFO ] Deduced a trap composed of 77 places in 465 ms of which 4 ms to minimize.
[2024-05-24 04:05:28] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 2 ms to minimize.
[2024-05-24 04:05:29] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 1 ms to minimize.
[2024-05-24 04:05:29] [INFO ] Deduced a trap composed of 97 places in 475 ms of which 5 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/1342 variables, 4/980 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 04:05:32] [INFO ] Deduced a trap composed of 40 places in 595 ms of which 5 ms to minimize.
[2024-05-24 04:05:32] [INFO ] Deduced a trap composed of 104 places in 505 ms of which 5 ms to minimize.
[2024-05-24 04:05:33] [INFO ] Deduced a trap composed of 98 places in 512 ms of which 4 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1342 variables, 3/983 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 04:05:36] [INFO ] Deduced a trap composed of 101 places in 510 ms of which 4 ms to minimize.
[2024-05-24 04:05:37] [INFO ] Deduced a trap composed of 58 places in 505 ms of which 4 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1342 variables, 2/985 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 04:05:39] [INFO ] Deduced a trap composed of 52 places in 533 ms of which 5 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1342 variables, 1/986 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1342 variables, 0/986 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1342/1342 variables, and 986 constraints, problems are : Problem set: 0 solved, 21 unsolved in 45010 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 492/492 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 73/73 constraints]
After SMT, in 51490ms problems are : Problem set: 0 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 40 out of 492 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 492/492 places, 2929/2929 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 492 transition count 2926
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 489 transition count 2926
Applied a total of 6 rules in 153 ms. Remains 489 /492 variables (removed 3) and now considering 2926/2929 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 489/492 places, 2926/2929 transitions.
RANDOM walk for 40000 steps (8 resets) in 644 ms. (62 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 100460 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 21
Probabilistic random walk after 100460 steps, saw 69675 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
[2024-05-24 04:05:48] [INFO ] Flow matrix only has 847 transitions (discarded 2079 similar events)
// Phase 1: matrix 847 rows 489 cols
[2024-05-24 04:05:48] [INFO ] Computed 28 invariants in 5 ms
[2024-05-24 04:05:48] [INFO ] State equation strengthened by 372 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 338/378 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 89/467 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 22/489 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 04:05:49] [INFO ] Deduced a trap composed of 62 places in 520 ms of which 5 ms to minimize.
[2024-05-24 04:05:49] [INFO ] Deduced a trap composed of 3 places in 419 ms of which 4 ms to minimize.
[2024-05-24 04:05:50] [INFO ] Deduced a trap composed of 30 places in 344 ms of which 4 ms to minimize.
[2024-05-24 04:05:50] [INFO ] Deduced a trap composed of 16 places in 368 ms of which 4 ms to minimize.
[2024-05-24 04:05:50] [INFO ] Deduced a trap composed of 47 places in 187 ms of which 2 ms to minimize.
[2024-05-24 04:05:50] [INFO ] Deduced a trap composed of 27 places in 134 ms of which 2 ms to minimize.
[2024-05-24 04:05:51] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 2 ms to minimize.
[2024-05-24 04:05:51] [INFO ] Deduced a trap composed of 3 places in 481 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/489 variables, 8/36 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/489 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 847/1336 variables, 489/525 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1336 variables, 372/897 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1336 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 0/1336 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1336/1336 variables, and 897 constraints, problems are : Problem set: 0 solved, 21 unsolved in 6330 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 489/489 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 338/378 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 04:05:54] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 89/467 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 04:05:55] [INFO ] Deduced a trap composed of 3 places in 208 ms of which 2 ms to minimize.
[2024-05-24 04:05:55] [INFO ] Deduced a trap composed of 25 places in 205 ms of which 2 ms to minimize.
[2024-05-24 04:05:56] [INFO ] Deduced a trap composed of 18 places in 207 ms of which 2 ms to minimize.
[2024-05-24 04:05:56] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:05:56] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 1 ms to minimize.
[2024-05-24 04:05:56] [INFO ] Deduced a trap composed of 20 places in 443 ms of which 4 ms to minimize.
[2024-05-24 04:05:57] [INFO ] Deduced a trap composed of 12 places in 399 ms of which 4 ms to minimize.
[2024-05-24 04:05:57] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2024-05-24 04:05:57] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 2 ms to minimize.
[2024-05-24 04:05:57] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 1 ms to minimize.
[2024-05-24 04:05:57] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 1 ms to minimize.
[2024-05-24 04:05:58] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 2 ms to minimize.
[2024-05-24 04:05:58] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 2 ms to minimize.
[2024-05-24 04:05:58] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 2 ms to minimize.
[2024-05-24 04:05:58] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 1 ms to minimize.
[2024-05-24 04:05:58] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:05:58] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 04:05:59] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/467 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/467 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 22/489 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/489 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 04:06:00] [INFO ] Deduced a trap composed of 3 places in 531 ms of which 5 ms to minimize.
[2024-05-24 04:06:01] [INFO ] Deduced a trap composed of 13 places in 473 ms of which 9 ms to minimize.
[2024-05-24 04:06:01] [INFO ] Deduced a trap composed of 28 places in 458 ms of which 4 ms to minimize.
[2024-05-24 04:06:01] [INFO ] Deduced a trap composed of 50 places in 114 ms of which 1 ms to minimize.
[2024-05-24 04:06:01] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 2 ms to minimize.
[2024-05-24 04:06:02] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 2 ms to minimize.
[2024-05-24 04:06:02] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/489 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 04:06:02] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 1 ms to minimize.
[2024-05-24 04:06:02] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-05-24 04:06:03] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 2 ms to minimize.
[2024-05-24 04:06:03] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 2 ms to minimize.
[2024-05-24 04:06:03] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 1 ms to minimize.
[2024-05-24 04:06:03] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/489 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/489 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 16 (OVERLAPS) 847/1336 variables, 489/557 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1336 variables, 372/929 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1336 variables, 21/950 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 04:06:06] [INFO ] Deduced a trap composed of 22 places in 121 ms of which 1 ms to minimize.
[2024-05-24 04:06:07] [INFO ] Deduced a trap composed of 88 places in 422 ms of which 5 ms to minimize.
[2024-05-24 04:06:07] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1336 variables, 3/953 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 04:06:08] [INFO ] Deduced a trap composed of 65 places in 523 ms of which 4 ms to minimize.
[2024-05-24 04:06:09] [INFO ] Deduced a trap composed of 80 places in 472 ms of which 4 ms to minimize.
[2024-05-24 04:06:10] [INFO ] Deduced a trap composed of 82 places in 480 ms of which 5 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1336 variables, 3/956 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 04:06:11] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 2 ms to minimize.
[2024-05-24 04:06:12] [INFO ] Deduced a trap composed of 31 places in 144 ms of which 2 ms to minimize.
[2024-05-24 04:06:12] [INFO ] Deduced a trap composed of 25 places in 502 ms of which 5 ms to minimize.
[2024-05-24 04:06:13] [INFO ] Deduced a trap composed of 96 places in 511 ms of which 5 ms to minimize.
[2024-05-24 04:06:13] [INFO ] Deduced a trap composed of 75 places in 532 ms of which 4 ms to minimize.
[2024-05-24 04:06:14] [INFO ] Deduced a trap composed of 96 places in 516 ms of which 5 ms to minimize.
[2024-05-24 04:06:15] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 1 ms to minimize.
[2024-05-24 04:06:15] [INFO ] Deduced a trap composed of 72 places in 558 ms of which 5 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1336 variables, 8/964 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 04:06:17] [INFO ] Deduced a trap composed of 51 places in 487 ms of which 5 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1336 variables, 1/965 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 04:06:19] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 2 ms to minimize.
[2024-05-24 04:06:19] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 2 ms to minimize.
[2024-05-24 04:06:20] [INFO ] Deduced a trap composed of 77 places in 434 ms of which 7 ms to minimize.
[2024-05-24 04:06:20] [INFO ] Deduced a trap composed of 95 places in 437 ms of which 4 ms to minimize.
[2024-05-24 04:06:21] [INFO ] Deduced a trap composed of 52 places in 472 ms of which 4 ms to minimize.
[2024-05-24 04:06:22] [INFO ] Deduced a trap composed of 50 places in 477 ms of which 4 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1336 variables, 6/971 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-24 04:06:24] [INFO ] Deduced a trap composed of 35 places in 86 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1336 variables, 1/972 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1336 variables, 0/972 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 26 (OVERLAPS) 0/1336 variables, 0/972 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1336/1336 variables, and 972 constraints, problems are : Problem set: 0 solved, 21 unsolved in 35469 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 489/489 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 62/62 constraints]
After SMT, in 41862ms problems are : Problem set: 0 solved, 21 unsolved
Fused 21 Parikh solutions to 19 different solutions.
Parikh walk visited 2 properties in 3854 ms.
Support contains 37 out of 489 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 489/489 places, 2926/2926 transitions.
Applied a total of 0 rules in 196 ms. Remains 489 /489 variables (removed 0) and now considering 2926/2926 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 489/489 places, 2926/2926 transitions.
Computed a total of 0 stabilizing places and 0 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 6 out of 823 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 814 transition count 3015
Deduced a syphon composed of 252 places in 3 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 562 transition count 3015
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 526 place count 558 transition count 2979
Iterating global reduction 2 with 4 rules applied. Total rules applied 530 place count 558 transition count 2979
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 674 place count 486 transition count 2907
Applied a total of 674 rules in 605 ms. Remains 486 /823 variables (removed 337) and now considering 2907/3276 (removed 369) transitions.
[2024-05-24 04:06:34] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-24 04:06:34] [INFO ] Computed 28 invariants in 5 ms
[2024-05-24 04:06:35] [INFO ] Implicit Places using invariants in 793 ms returned []
[2024-05-24 04:06:35] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:06:35] [INFO ] Invariant cache hit.
[2024-05-24 04:06:36] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:06:39] [INFO ] Implicit Places using invariants and state equation in 3889 ms returned []
Implicit Place search using SMT with State Equation took 4686 ms to find 0 implicit places.
[2024-05-24 04:06:39] [INFO ] Redundant transitions in 217 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-24 04:06:39] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:06:39] [INFO ] Invariant cache hit.
[2024-05-24 04:06:39] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32570ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32610ms
Starting structural reductions in SI_LTL mode, iteration 1 : 486/823 places, 2907/3276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38135 ms. Remains : 486/823 places, 2907/3276 transitions.
Stuttering acceptance computed with spot in 267 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 559 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 1 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-00 finished in 39060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 5 out of 823 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 814 transition count 3016
Deduced a syphon composed of 251 places in 3 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 563 transition count 3016
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 524 place count 559 transition count 2980
Iterating global reduction 2 with 4 rules applied. Total rules applied 528 place count 559 transition count 2980
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 672 place count 487 transition count 2908
Applied a total of 672 rules in 282 ms. Remains 487 /823 variables (removed 336) and now considering 2908/3276 (removed 368) transitions.
[2024-05-24 04:07:13] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2024-05-24 04:07:13] [INFO ] Computed 28 invariants in 5 ms
[2024-05-24 04:07:14] [INFO ] Implicit Places using invariants in 915 ms returned []
[2024-05-24 04:07:14] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 04:07:14] [INFO ] Invariant cache hit.
[2024-05-24 04:07:14] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:07:17] [INFO ] Implicit Places using invariants and state equation in 3193 ms returned []
Implicit Place search using SMT with State Equation took 4111 ms to find 0 implicit places.
[2024-05-24 04:07:17] [INFO ] Redundant transitions in 106 ms returned []
Running 2899 sub problems to find dead transitions.
[2024-05-24 04:07:17] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 04:07:17] [INFO ] Invariant cache hit.
[2024-05-24 04:07:17] [INFO ] State equation strengthened by 356 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 1.0)
(s25 0.0)
(s26 1.0)
(s27 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2899 unsolved
SMT process timed out in 32765ms, After SMT, problems are : Problem set: 0 solved, 2899 unsolved
Search for dead transitions found 0 dead transitions in 32804ms
Starting structural reductions in SI_LTL mode, iteration 1 : 487/823 places, 2908/3276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37325 ms. Remains : 487/823 places, 2908/3276 transitions.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 475 ms.
Product exploration explored 100000 steps with 0 reset in 745 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 185 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 432 ms. (92 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 405 ms. (98 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 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
Interrupted probabilistic random walk after 203430 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :3 out of 6
Probabilistic random walk after 203430 steps, saw 132803 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :3
[2024-05-24 04:07:55] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 04:07:55] [INFO ] Invariant cache hit.
[2024-05-24 04:07:55] [INFO ] State equation strengthened by 356 read => feed constraints.
Problem apf2 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 149/154 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/164 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/169 variables, 3/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 373/542 variables, 169/179 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 55/234 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/542 variables, 0/234 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/686 variables, 66/300 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/686 variables, 36/336 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/686 variables, 0/336 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 240/926 variables, 12/348 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/926 variables, 0/348 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/938 variables, 6/354 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/938 variables, 0/354 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 378/1316 variables, 252/606 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1316 variables, 265/871 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1316 variables, 0/871 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1316 variables, 0/871 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1316/1316 variables, and 871 constraints, problems are : Problem set: 1 solved, 2 unsolved in 757 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 149/154 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/164 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/169 variables, 3/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 373/542 variables, 169/179 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 55/234 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/542 variables, 0/234 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/686 variables, 66/300 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/686 variables, 36/336 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/686 variables, 0/336 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 240/926 variables, 12/348 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/926 variables, 0/348 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/938 variables, 6/354 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/938 variables, 2/356 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-24 04:07:57] [INFO ] Deduced a trap composed of 3 places in 324 ms of which 3 ms to minimize.
[2024-05-24 04:07:57] [INFO ] Deduced a trap composed of 38 places in 346 ms of which 4 ms to minimize.
[2024-05-24 04:07:57] [INFO ] Deduced a trap composed of 7 places in 282 ms of which 4 ms to minimize.
[2024-05-24 04:07:58] [INFO ] Deduced a trap composed of 21 places in 309 ms of which 3 ms to minimize.
[2024-05-24 04:07:58] [INFO ] Deduced a trap composed of 31 places in 294 ms of which 3 ms to minimize.
[2024-05-24 04:07:58] [INFO ] Deduced a trap composed of 55 places in 301 ms of which 3 ms to minimize.
[2024-05-24 04:07:59] [INFO ] Deduced a trap composed of 3 places in 267 ms of which 3 ms to minimize.
[2024-05-24 04:07:59] [INFO ] Deduced a trap composed of 26 places in 336 ms of which 3 ms to minimize.
[2024-05-24 04:07:59] [INFO ] Deduced a trap composed of 35 places in 348 ms of which 4 ms to minimize.
[2024-05-24 04:08:00] [INFO ] Deduced a trap composed of 19 places in 357 ms of which 4 ms to minimize.
[2024-05-24 04:08:00] [INFO ] Deduced a trap composed of 3 places in 289 ms of which 3 ms to minimize.
[2024-05-24 04:08:01] [INFO ] Deduced a trap composed of 22 places in 342 ms of which 4 ms to minimize.
[2024-05-24 04:08:01] [INFO ] Deduced a trap composed of 31 places in 287 ms of which 3 ms to minimize.
[2024-05-24 04:08:01] [INFO ] Deduced a trap composed of 3 places in 288 ms of which 3 ms to minimize.
SMT process timed out in 5912ms, After SMT, problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 111 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 487/487 places, 2908/2908 transitions.
RANDOM walk for 40000 steps (8 resets) in 265 ms. (150 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 204840 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 2
Probabilistic random walk after 204840 steps, saw 133714 distinct states, run finished after 3004 ms. (steps per millisecond=68 ) properties seen :0
[2024-05-24 04:08:04] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 04:08:04] [INFO ] Invariant cache hit.
[2024-05-24 04:08:04] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 149/154 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/164 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 373/542 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 55/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/542 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/686 variables, 66/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/686 variables, 36/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/686 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 240/926 variables, 12/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/926 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/938 variables, 6/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/938 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 378/1316 variables, 252/606 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1316 variables, 265/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1316 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1316 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1316/1316 variables, and 871 constraints, problems are : Problem set: 0 solved, 2 unsolved in 655 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 149/154 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/164 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 373/542 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 55/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/542 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/686 variables, 66/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/686 variables, 36/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/686 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 240/926 variables, 12/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/926 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/938 variables, 6/354 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/938 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:08:06] [INFO ] Deduced a trap composed of 3 places in 263 ms of which 3 ms to minimize.
[2024-05-24 04:08:06] [INFO ] Deduced a trap composed of 38 places in 315 ms of which 3 ms to minimize.
[2024-05-24 04:08:07] [INFO ] Deduced a trap composed of 7 places in 354 ms of which 3 ms to minimize.
[2024-05-24 04:08:07] [INFO ] Deduced a trap composed of 21 places in 292 ms of which 3 ms to minimize.
[2024-05-24 04:08:07] [INFO ] Deduced a trap composed of 31 places in 280 ms of which 2 ms to minimize.
[2024-05-24 04:08:07] [INFO ] Deduced a trap composed of 55 places in 305 ms of which 3 ms to minimize.
[2024-05-24 04:08:08] [INFO ] Deduced a trap composed of 3 places in 325 ms of which 3 ms to minimize.
[2024-05-24 04:08:08] [INFO ] Deduced a trap composed of 26 places in 347 ms of which 3 ms to minimize.
[2024-05-24 04:08:09] [INFO ] Deduced a trap composed of 35 places in 353 ms of which 4 ms to minimize.
[2024-05-24 04:08:09] [INFO ] Deduced a trap composed of 19 places in 331 ms of which 4 ms to minimize.
[2024-05-24 04:08:09] [INFO ] Deduced a trap composed of 3 places in 286 ms of which 3 ms to minimize.
[2024-05-24 04:08:10] [INFO ] Deduced a trap composed of 22 places in 346 ms of which 3 ms to minimize.
[2024-05-24 04:08:10] [INFO ] Deduced a trap composed of 31 places in 274 ms of which 3 ms to minimize.
[2024-05-24 04:08:10] [INFO ] Deduced a trap composed of 3 places in 305 ms of which 3 ms to minimize.
[2024-05-24 04:08:10] [INFO ] Deduced a trap composed of 27 places in 248 ms of which 3 ms to minimize.
[2024-05-24 04:08:11] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 1 ms to minimize.
[2024-05-24 04:08:11] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2024-05-24 04:08:11] [INFO ] Deduced a trap composed of 25 places in 190 ms of which 3 ms to minimize.
[2024-05-24 04:08:11] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 2 ms to minimize.
[2024-05-24 04:08:11] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/938 variables, 20/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:08:11] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/938 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/938 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 378/1316 variables, 252/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1316 variables, 265/894 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1316 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1316 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1316/1316 variables, and 894 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6802 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 21/21 constraints]
After SMT, in 7481ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 367 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 115 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 487/487 places, 2908/2908 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 112 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
[2024-05-24 04:08:12] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 04:08:12] [INFO ] Invariant cache hit.
[2024-05-24 04:08:14] [INFO ] Implicit Places using invariants in 1076 ms returned []
[2024-05-24 04:08:14] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 04:08:14] [INFO ] Invariant cache hit.
[2024-05-24 04:08:14] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:08:17] [INFO ] Implicit Places using invariants and state equation in 3580 ms returned []
Implicit Place search using SMT with State Equation took 4658 ms to find 0 implicit places.
[2024-05-24 04:08:17] [INFO ] Redundant transitions in 249 ms returned []
Running 2899 sub problems to find dead transitions.
[2024-05-24 04:08:17] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 04:08:17] [INFO ] Invariant cache hit.
[2024-05-24 04:08:17] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2899 unsolved
SMT process timed out in 32305ms, After SMT, problems are : Problem set: 0 solved, 2899 unsolved
Search for dead transitions found 0 dead transitions in 32338ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37368 ms. Remains : 487/487 places, 2908/2908 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2699 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 6 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 415 transition count 516
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 318 transition count 516
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 195 place count 318 transition count 497
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 242 place count 290 transition count 497
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 284 rules applied. Total rules applied 526 place count 148 transition count 355
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 596 place count 148 transition count 285
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 614 place count 139 transition count 300
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 622 place count 139 transition count 292
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 631 place count 139 transition count 283
Free-agglomeration rule applied 65 times.
Iterating global reduction 4 with 65 rules applied. Total rules applied 696 place count 139 transition count 218
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 4 with 65 rules applied. Total rules applied 761 place count 74 transition count 218
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 772 place count 74 transition count 218
Applied a total of 772 rules in 85 ms. Remains 74 /487 variables (removed 413) and now considering 218/2908 (removed 2690) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 218 rows 74 cols
[2024-05-24 04:08:50] [INFO ] Computed 19 invariants in 1 ms
[2024-05-24 04:08:50] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-05-24 04:08:50] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 04:08:50] [INFO ] [Nat]Absence check using 19 positive place invariants in 4 ms returned sat
[2024-05-24 04:08:50] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 04:08:50] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 04:08:50] [INFO ] After 33ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 04:08:50] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-24 04:08:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-05-24 04:08:50] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-24 04:08:50] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-24 04:08:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 69 ms
TRAPS : Iteration 1
[2024-05-24 04:08:50] [INFO ] After 215ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 04:08:50] [INFO ] After 422ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 690 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 14 factoid took 317 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Support contains 3 out of 487 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 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 202 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
[2024-05-24 04:08:51] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2024-05-24 04:08:51] [INFO ] Computed 28 invariants in 6 ms
[2024-05-24 04:08:52] [INFO ] Implicit Places using invariants in 789 ms returned []
[2024-05-24 04:08:52] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 04:08:52] [INFO ] Invariant cache hit.
[2024-05-24 04:08:52] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:08:56] [INFO ] Implicit Places using invariants and state equation in 3810 ms returned []
Implicit Place search using SMT with State Equation took 4603 ms to find 0 implicit places.
[2024-05-24 04:08:56] [INFO ] Redundant transitions in 99 ms returned []
Running 2899 sub problems to find dead transitions.
[2024-05-24 04:08:56] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 04:08:56] [INFO ] Invariant cache hit.
[2024-05-24 04:08:56] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2899 unsolved
SMT process timed out in 32505ms, After SMT, problems are : Problem set: 0 solved, 2899 unsolved
Search for dead transitions found 0 dead transitions in 32541ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37475 ms. Remains : 487/487 places, 2908/2908 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 157 ms. (253 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 349120 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 1
Probabilistic random walk after 349120 steps, saw 217692 distinct states, run finished after 3004 ms. (steps per millisecond=116 ) properties seen :0
[2024-05-24 04:09:32] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 04:09:32] [INFO ] Invariant cache hit.
[2024-05-24 04:09:32] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/111 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/115 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 296/411 variables, 115/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 32/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 168/579 variables, 77/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/579 variables, 32/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 281/860 variables, 14/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/860 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 14/874 variables, 7/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/874 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 442/1316 variables, 295/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1316 variables, 292/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1316 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1316 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1316/1316 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 567 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 356/356 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/111 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/115 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:09:32] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 296/411 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 168/579 variables, 77/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 32/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 281/860 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:09:33] [INFO ] Deduced a trap composed of 124 places in 438 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/860 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/860 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 14/874 variables, 7/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/874 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:09:33] [INFO ] Deduced a trap composed of 3 places in 287 ms of which 3 ms to minimize.
[2024-05-24 04:09:34] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 3 ms to minimize.
[2024-05-24 04:09:34] [INFO ] Deduced a trap composed of 3 places in 301 ms of which 3 ms to minimize.
[2024-05-24 04:09:34] [INFO ] Deduced a trap composed of 3 places in 258 ms of which 3 ms to minimize.
[2024-05-24 04:09:35] [INFO ] Deduced a trap composed of 56 places in 307 ms of which 3 ms to minimize.
[2024-05-24 04:09:35] [INFO ] Deduced a trap composed of 41 places in 309 ms of which 3 ms to minimize.
[2024-05-24 04:09:35] [INFO ] Deduced a trap composed of 27 places in 298 ms of which 3 ms to minimize.
[2024-05-24 04:09:36] [INFO ] Deduced a trap composed of 35 places in 318 ms of which 3 ms to minimize.
[2024-05-24 04:09:36] [INFO ] Deduced a trap composed of 26 places in 355 ms of which 4 ms to minimize.
[2024-05-24 04:09:36] [INFO ] Deduced a trap composed of 46 places in 350 ms of which 3 ms to minimize.
[2024-05-24 04:09:37] [INFO ] Deduced a trap composed of 3 places in 273 ms of which 3 ms to minimize.
[2024-05-24 04:09:37] [INFO ] Deduced a trap composed of 22 places in 336 ms of which 3 ms to minimize.
[2024-05-24 04:09:37] [INFO ] Deduced a trap composed of 29 places in 266 ms of which 2 ms to minimize.
SMT process timed out in 5634ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 487 transition count 2907
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 486 transition count 2907
Applied a total of 2 rules in 134 ms. Remains 486 /487 variables (removed 1) and now considering 2907/2908 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 486/487 places, 2907/2908 transitions.
RANDOM walk for 40000 steps (8 resets) in 214 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 349840 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 1
Probabilistic random walk after 349840 steps, saw 218024 distinct states, run finished after 3001 ms. (steps per millisecond=116 ) properties seen :0
[2024-05-24 04:09:41] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-24 04:09:41] [INFO ] Computed 28 invariants in 10 ms
[2024-05-24 04:09:41] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/111 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/115 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:09:41] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 296/411 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 168/579 variables, 77/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 32/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 280/859 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/859 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 14/873 variables, 7/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 441/1314 variables, 294/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1314 variables, 292/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 689 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/111 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/115 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 296/411 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 168/579 variables, 77/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 32/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 280/859 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/859 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 14/873 variables, 7/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:09:42] [INFO ] Deduced a trap composed of 42 places in 438 ms of which 5 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/873 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/873 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 441/1314 variables, 294/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 292/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:09:43] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 2 ms to minimize.
[2024-05-24 04:09:43] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 2/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:09:43] [INFO ] Deduced a trap composed of 60 places in 520 ms of which 4 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 1/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1314 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 876 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2132 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 2910ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 138 ms.
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 114 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 112 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-24 04:09:44] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:09:44] [INFO ] Invariant cache hit.
[2024-05-24 04:09:45] [INFO ] Implicit Places using invariants in 912 ms returned []
[2024-05-24 04:09:45] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:09:45] [INFO ] Invariant cache hit.
[2024-05-24 04:09:45] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:09:49] [INFO ] Implicit Places using invariants and state equation in 3889 ms returned []
Implicit Place search using SMT with State Equation took 4804 ms to find 0 implicit places.
[2024-05-24 04:09:49] [INFO ] Redundant transitions in 101 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-24 04:09:49] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:09:49] [INFO ] Invariant cache hit.
[2024-05-24 04:09:49] [INFO ] State equation strengthened by 356 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32411ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32443ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37475 ms. Remains : 486/486 places, 2907/2907 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2702 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 414 transition count 515
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 317 transition count 515
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 195 place count 317 transition count 496
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 242 place count 289 transition count 496
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 528 place count 146 transition count 353
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 598 place count 146 transition count 283
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 614 place count 138 transition count 283
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 622 place count 138 transition count 275
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 631 place count 138 transition count 266
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 704 place count 138 transition count 193
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 777 place count 65 transition count 193
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 786 place count 65 transition count 193
Applied a total of 786 rules in 39 ms. Remains 65 /486 variables (removed 421) and now considering 193/2907 (removed 2714) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 193 rows 65 cols
[2024-05-24 04:10:21] [INFO ] Computed 19 invariants in 1 ms
[2024-05-24 04:10:21] [INFO ] [Real]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-05-24 04:10:21] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:10:21] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-24 04:10:22] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:10:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 04:10:22] [INFO ] After 14ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 04:10:22] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 04:10:22] [INFO ] After 193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 407 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 308 ms.
Product exploration explored 100000 steps with 0 reset in 405 ms.
Support contains 3 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 487 transition count 2907
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 486 transition count 2907
Applied a total of 2 rules in 126 ms. Remains 486 /487 variables (removed 1) and now considering 2907/2908 (removed 1) transitions.
[2024-05-24 04:10:23] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-24 04:10:23] [INFO ] Computed 28 invariants in 4 ms
[2024-05-24 04:10:24] [INFO ] Implicit Places using invariants in 882 ms returned []
[2024-05-24 04:10:24] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:10:24] [INFO ] Invariant cache hit.
[2024-05-24 04:10:24] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:10:28] [INFO ] Implicit Places using invariants and state equation in 4014 ms returned []
Implicit Place search using SMT with State Equation took 4898 ms to find 0 implicit places.
[2024-05-24 04:10:28] [INFO ] Redundant transitions in 100 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-24 04:10:28] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:10:28] [INFO ] Invariant cache hit.
[2024-05-24 04:10:28] [INFO ] State equation strengthened by 356 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32373ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32405ms
Starting structural reductions in SI_LTL mode, iteration 1 : 486/487 places, 2907/2908 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37540 ms. Remains : 486/487 places, 2907/2908 transitions.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-01 finished in 227531 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)||(G(p2)&&p1)) U (!p3&&F(p4))))'
Support contains 12 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 819 transition count 3240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 819 transition count 3240
Applied a total of 8 rules in 42 ms. Remains 819 /823 variables (removed 4) and now considering 3240/3276 (removed 36) transitions.
[2024-05-24 04:11:00] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
// Phase 1: matrix 1161 rows 819 cols
[2024-05-24 04:11:00] [INFO ] Computed 28 invariants in 6 ms
[2024-05-24 04:11:01] [INFO ] Implicit Places using invariants in 827 ms returned []
[2024-05-24 04:11:01] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-05-24 04:11:01] [INFO ] Invariant cache hit.
[2024-05-24 04:11:02] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:11:10] [INFO ] Implicit Places using invariants and state equation in 8507 ms returned []
Implicit Place search using SMT with State Equation took 9337 ms to find 0 implicit places.
Running 3231 sub problems to find dead transitions.
[2024-05-24 04:11:10] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-05-24 04:11:10] [INFO ] Invariant cache hit.
[2024-05-24 04:11:10] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/819 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3231 unsolved
SMT process timed out in 32363ms, After SMT, problems are : Problem set: 0 solved, 3231 unsolved
Search for dead transitions found 0 dead transitions in 32400ms
Starting structural reductions in LTL mode, iteration 1 : 819/823 places, 3240/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41788 ms. Remains : 819/823 places, 3240/3276 transitions.
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p4) p3), (NOT p0), (NOT p4), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 337 ms.
Stack based approach found an accepted trace after 55 steps with 0 reset with depth 56 and stack size 56 in 1 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-02 finished in 42427 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p1))&&F(p2)&&p0)))'
Support contains 4 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 819 transition count 3240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 819 transition count 3240
Applied a total of 8 rules in 48 ms. Remains 819 /823 variables (removed 4) and now considering 3240/3276 (removed 36) transitions.
[2024-05-24 04:11:43] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-05-24 04:11:43] [INFO ] Invariant cache hit.
[2024-05-24 04:11:44] [INFO ] Implicit Places using invariants in 1018 ms returned []
[2024-05-24 04:11:44] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-05-24 04:11:44] [INFO ] Invariant cache hit.
[2024-05-24 04:11:45] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:11:52] [INFO ] Implicit Places using invariants and state equation in 8263 ms returned []
Implicit Place search using SMT with State Equation took 9283 ms to find 0 implicit places.
Running 3231 sub problems to find dead transitions.
[2024-05-24 04:11:52] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-05-24 04:11:52] [INFO ] Invariant cache hit.
[2024-05-24 04:11:52] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/819 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3231 unsolved
SMT process timed out in 32502ms, After SMT, problems are : Problem set: 0 solved, 3231 unsolved
Search for dead transitions found 0 dead transitions in 32537ms
Starting structural reductions in LTL mode, iteration 1 : 819/823 places, 3240/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41875 ms. Remains : 819/823 places, 3240/3276 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-03 finished in 42096 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Support contains 6 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 819 transition count 3240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 819 transition count 3240
Applied a total of 8 rules in 43 ms. Remains 819 /823 variables (removed 4) and now considering 3240/3276 (removed 36) transitions.
[2024-05-24 04:12:25] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-05-24 04:12:25] [INFO ] Invariant cache hit.
[2024-05-24 04:12:26] [INFO ] Implicit Places using invariants in 1031 ms returned []
[2024-05-24 04:12:26] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-05-24 04:12:26] [INFO ] Invariant cache hit.
[2024-05-24 04:12:27] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:12:34] [INFO ] Implicit Places using invariants and state equation in 7819 ms returned []
Implicit Place search using SMT with State Equation took 8852 ms to find 0 implicit places.
Running 3231 sub problems to find dead transitions.
[2024-05-24 04:12:34] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-05-24 04:12:34] [INFO ] Invariant cache hit.
[2024-05-24 04:12:34] [INFO ] State equation strengthened by 356 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.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)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/819 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3231 unsolved
SMT process timed out in 32625ms, After SMT, problems are : Problem set: 0 solved, 3231 unsolved
Search for dead transitions found 0 dead transitions in 32663ms
Starting structural reductions in LTL mode, iteration 1 : 819/823 places, 3240/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41565 ms. Remains : 819/823 places, 3240/3276 transitions.
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 378 ms.
Stack based approach found an accepted trace after 88 steps with 0 reset with depth 89 and stack size 89 in 1 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-04 finished in 42074 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 823 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 814 transition count 3016
Deduced a syphon composed of 251 places in 2 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 563 transition count 3016
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 524 place count 559 transition count 2980
Iterating global reduction 2 with 4 rules applied. Total rules applied 528 place count 559 transition count 2980
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 672 place count 487 transition count 2908
Applied a total of 672 rules in 229 ms. Remains 487 /823 variables (removed 336) and now considering 2908/3276 (removed 368) transitions.
[2024-05-24 04:13:07] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2024-05-24 04:13:07] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 04:13:08] [INFO ] Implicit Places using invariants in 912 ms returned []
[2024-05-24 04:13:08] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 04:13:08] [INFO ] Invariant cache hit.
[2024-05-24 04:13:09] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:13:12] [INFO ] Implicit Places using invariants and state equation in 3931 ms returned []
Implicit Place search using SMT with State Equation took 4845 ms to find 0 implicit places.
[2024-05-24 04:13:12] [INFO ] Redundant transitions in 104 ms returned []
Running 2899 sub problems to find dead transitions.
[2024-05-24 04:13:12] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 04:13:12] [INFO ] Invariant cache hit.
[2024-05-24 04:13:12] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2899 unsolved
SMT process timed out in 32701ms, After SMT, problems are : Problem set: 0 solved, 2899 unsolved
Search for dead transitions found 0 dead transitions in 32734ms
Starting structural reductions in SI_LTL mode, iteration 1 : 487/823 places, 2908/3276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37923 ms. Remains : 487/823 places, 2908/3276 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 354 ms.
Product exploration explored 100000 steps with 0 reset in 476 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 182 ms. (218 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 54308 steps, run visited all 1 properties in 450 ms. (steps per millisecond=120 )
Probabilistic random walk after 54308 steps, saw 39469 distinct states, run finished after 456 ms. (steps per millisecond=119 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 1 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 109 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
[2024-05-24 04:13:47] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 04:13:47] [INFO ] Invariant cache hit.
[2024-05-24 04:13:48] [INFO ] Implicit Places using invariants in 881 ms returned []
[2024-05-24 04:13:48] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 04:13:48] [INFO ] Invariant cache hit.
[2024-05-24 04:13:48] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:13:52] [INFO ] Implicit Places using invariants and state equation in 3945 ms returned []
Implicit Place search using SMT with State Equation took 4831 ms to find 0 implicit places.
[2024-05-24 04:13:52] [INFO ] Redundant transitions in 99 ms returned []
Running 2899 sub problems to find dead transitions.
[2024-05-24 04:13:52] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 04:13:52] [INFO ] Invariant cache hit.
[2024-05-24 04:13:52] [INFO ] State equation strengthened by 356 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 1.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 0.0)
(s35 1.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 1.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 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2899 unsolved
SMT process timed out in 32409ms, After SMT, problems are : Problem set: 0 solved, 2899 unsolved
Search for dead transitions found 0 dead transitions in 32442ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37502 ms. Remains : 487/487 places, 2908/2908 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 256 ms. (155 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 54308 steps, run visited all 1 properties in 481 ms. (steps per millisecond=112 )
Probabilistic random walk after 54308 steps, saw 39469 distinct states, run finished after 482 ms. (steps per millisecond=112 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 338 ms.
Product exploration explored 100000 steps with 0 reset in 412 ms.
Support contains 1 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 110 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
[2024-05-24 04:14:26] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 04:14:26] [INFO ] Invariant cache hit.
[2024-05-24 04:14:27] [INFO ] Implicit Places using invariants in 987 ms returned []
[2024-05-24 04:14:27] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 04:14:27] [INFO ] Invariant cache hit.
[2024-05-24 04:14:27] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:14:31] [INFO ] Implicit Places using invariants and state equation in 4096 ms returned []
Implicit Place search using SMT with State Equation took 5086 ms to find 0 implicit places.
[2024-05-24 04:14:31] [INFO ] Redundant transitions in 97 ms returned []
Running 2899 sub problems to find dead transitions.
[2024-05-24 04:14:31] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 04:14:31] [INFO ] Invariant cache hit.
[2024-05-24 04:14:31] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2899 unsolved
SMT process timed out in 32243ms, After SMT, problems are : Problem set: 0 solved, 2899 unsolved
Search for dead transitions found 0 dead transitions in 32276ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37582 ms. Remains : 487/487 places, 2908/2908 transitions.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-05 finished in 116613 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p1)||p0))))'
Support contains 5 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 820 transition count 3249
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 820 transition count 3249
Applied a total of 6 rules in 53 ms. Remains 820 /823 variables (removed 3) and now considering 3249/3276 (removed 27) transitions.
[2024-05-24 04:15:04] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
// Phase 1: matrix 1170 rows 820 cols
[2024-05-24 04:15:04] [INFO ] Computed 28 invariants in 7 ms
[2024-05-24 04:15:05] [INFO ] Implicit Places using invariants in 1062 ms returned []
[2024-05-24 04:15:05] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 04:15:05] [INFO ] Invariant cache hit.
[2024-05-24 04:15:05] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 04:15:12] [INFO ] Implicit Places using invariants and state equation in 7318 ms returned []
Implicit Place search using SMT with State Equation took 8383 ms to find 0 implicit places.
Running 3240 sub problems to find dead transitions.
[2024-05-24 04:15:12] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 04:15:12] [INFO ] Invariant cache hit.
[2024-05-24 04:15:12] [INFO ] State equation strengthened by 364 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.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 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 0.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(timeout
s441 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3240 unsolved
SMT process timed out in 32881ms, After SMT, problems are : Problem set: 0 solved, 3240 unsolved
Search for dead transitions found 0 dead transitions in 32927ms
Starting structural reductions in LTL mode, iteration 1 : 820/823 places, 3249/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41375 ms. Remains : 820/823 places, 3249/3276 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 314 ms.
Product exploration explored 100000 steps with 0 reset in 458 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 107 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 271 ms. (147 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 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 79 ms. (500 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 91110 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :0 out of 4
Probabilistic random walk after 91110 steps, saw 71837 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :0
[2024-05-24 04:15:49] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 04:15:49] [INFO ] Invariant cache hit.
[2024-05-24 04:15:49] [INFO ] State equation strengthened by 364 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 181/186 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/187 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/190 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 379/569 variables, 190/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/569 variables, 40/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/569 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 168/737 variables, 77/314 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/737 variables, 26/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/737 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 539/1276 variables, 14/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1276 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 14/1290 variables, 7/361 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1290 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 700/1990 variables, 553/914 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1990 variables, 298/1212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1990 variables, 0/1212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1990 variables, 0/1212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1990/1990 variables, and 1212 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1346 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 820/820 constraints, ReadFeed: 364/364 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 181/186 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/187 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/190 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 379/569 variables, 190/197 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/569 variables, 40/237 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/569 variables, 0/237 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 168/737 variables, 77/314 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/737 variables, 26/340 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/737 variables, 0/340 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 539/1276 variables, 14/354 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1276 variables, 0/354 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 14/1290 variables, 7/361 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1290 variables, 3/364 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-24 04:15:52] [INFO ] Deduced a trap composed of 32 places in 407 ms of which 5 ms to minimize.
[2024-05-24 04:15:52] [INFO ] Deduced a trap composed of 6 places in 456 ms of which 5 ms to minimize.
[2024-05-24 04:15:53] [INFO ] Deduced a trap composed of 52 places in 384 ms of which 4 ms to minimize.
[2024-05-24 04:15:53] [INFO ] Deduced a trap composed of 27 places in 261 ms of which 3 ms to minimize.
[2024-05-24 04:15:53] [INFO ] Deduced a trap composed of 17 places in 288 ms of which 3 ms to minimize.
[2024-05-24 04:15:53] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-05-24 04:15:54] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 2 ms to minimize.
[2024-05-24 04:15:54] [INFO ] Deduced a trap composed of 39 places in 602 ms of which 6 ms to minimize.
[2024-05-24 04:15:55] [INFO ] Deduced a trap composed of 144 places in 551 ms of which 6 ms to minimize.
[2024-05-24 04:15:55] [INFO ] Deduced a trap composed of 3 places in 392 ms of which 4 ms to minimize.
[2024-05-24 04:15:56] [INFO ] Deduced a trap composed of 41 places in 634 ms of which 7 ms to minimize.
SMT process timed out in 6523ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 820 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 820 transition count 3240
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 811 transition count 3240
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 811 transition count 2988
Deduced a syphon composed of 252 places in 3 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 559 transition count 2988
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 666 place count 487 transition count 2916
Applied a total of 666 rules in 189 ms. Remains 487 /820 variables (removed 333) and now considering 2916/3249 (removed 333) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 487/820 places, 2916/3249 transitions.
RANDOM walk for 40000 steps (8 resets) in 1221 ms. (32 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 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 170860 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 3
Probabilistic random walk after 170860 steps, saw 113133 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
[2024-05-24 04:16:00] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-05-24 04:16:00] [INFO ] Computed 28 invariants in 4 ms
[2024-05-24 04:16:00] [INFO ] State equation strengthened by 364 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 107/112 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 305/421 variables, 116/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 40/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 168/589 variables, 77/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 32/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 280/869 variables, 14/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/869 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 14/883 variables, 7/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/883 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 441/1324 variables, 294/587 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1324 variables, 292/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 879 constraints, problems are : Problem set: 0 solved, 3 unsolved in 784 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 107/112 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 04:16:01] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 305/421 variables, 116/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 40/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 168/589 variables, 77/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 32/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/589 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 280/869 variables, 14/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/869 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 14/883 variables, 7/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/883 variables, 3/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 04:16:01] [INFO ] Deduced a trap composed of 51 places in 233 ms of which 3 ms to minimize.
[2024-05-24 04:16:02] [INFO ] Deduced a trap composed of 38 places in 244 ms of which 3 ms to minimize.
[2024-05-24 04:16:02] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 2 ms to minimize.
[2024-05-24 04:16:02] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:16:02] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 2 ms to minimize.
[2024-05-24 04:16:02] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:16:02] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/883 variables, 7/304 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 04:16:02] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 2 ms to minimize.
[2024-05-24 04:16:02] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 1 ms to minimize.
[2024-05-24 04:16:03] [INFO ] Deduced a trap composed of 25 places in 179 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/883 variables, 3/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/883 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 441/1324 variables, 294/601 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1324 variables, 292/893 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1324 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/1324 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 893 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3137 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 11/11 constraints]
After SMT, in 3948ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1480 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 105 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 487/487 places, 2916/2916 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 104 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 04:16:05] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:16:05] [INFO ] Invariant cache hit.
[2024-05-24 04:16:06] [INFO ] Implicit Places using invariants in 938 ms returned []
[2024-05-24 04:16:06] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:16:06] [INFO ] Invariant cache hit.
[2024-05-24 04:16:07] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 04:16:10] [INFO ] Implicit Places using invariants and state equation in 3985 ms returned []
Implicit Place search using SMT with State Equation took 4925 ms to find 0 implicit places.
[2024-05-24 04:16:10] [INFO ] Redundant transitions in 104 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-05-24 04:16:10] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:16:10] [INFO ] Invariant cache hit.
[2024-05-24 04:16:10] [INFO ] State equation strengthened by 364 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 32131ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32164ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37311 ms. Remains : 487/487 places, 2916/2916 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2700 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 277 transitions
Ensure Unique test removed 2024 transitions
Reduce isomorphic transitions removed 2301 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 415 transition count 518
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 318 transition count 518
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 195 place count 318 transition count 500
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 239 place count 292 transition count 500
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 525 place count 149 transition count 357
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 595 place count 149 transition count 287
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 611 place count 141 transition count 287
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 619 place count 141 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 629 place count 141 transition count 269
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 703 place count 141 transition count 195
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 777 place count 67 transition count 195
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 786 place count 67 transition count 195
Applied a total of 786 rules in 43 ms. Remains 67 /487 variables (removed 420) and now considering 195/2916 (removed 2721) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 195 rows 67 cols
[2024-05-24 04:16:43] [INFO ] Computed 20 invariants in 6 ms
[2024-05-24 04:16:43] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 04:16:43] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-05-24 04:16:43] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:16:43] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 04:16:43] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 04:16:43] [INFO ] After 35ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-24 04:16:43] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-05-24 04:16:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2024-05-24 04:16:43] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-24 04:16:43] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-05-24 04:16:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 54 ms
[2024-05-24 04:16:43] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-05-24 04:16:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
TRAPS : Iteration 1
[2024-05-24 04:16:43] [INFO ] After 225ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-24 04:16:43] [INFO ] After 405ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 501 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0)), (G (OR p0 p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 115 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 820 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 820 transition count 3240
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 811 transition count 3240
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 811 transition count 2988
Deduced a syphon composed of 252 places in 3 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 559 transition count 2988
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 666 place count 487 transition count 2916
Applied a total of 666 rules in 181 ms. Remains 487 /820 variables (removed 333) and now considering 2916/3249 (removed 333) transitions.
[2024-05-24 04:16:43] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-05-24 04:16:43] [INFO ] Computed 28 invariants in 7 ms
[2024-05-24 04:16:44] [INFO ] Implicit Places using invariants in 886 ms returned []
[2024-05-24 04:16:44] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:16:44] [INFO ] Invariant cache hit.
[2024-05-24 04:16:45] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 04:16:48] [INFO ] Implicit Places using invariants and state equation in 4042 ms returned []
Implicit Place search using SMT with State Equation took 4934 ms to find 0 implicit places.
[2024-05-24 04:16:49] [INFO ] Redundant transitions in 110 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-05-24 04:16:49] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:16:49] [INFO ] Invariant cache hit.
[2024-05-24 04:16:49] [INFO ] State equation strengthened by 364 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 32281ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32314ms
Starting structural reductions in SI_LTL mode, iteration 1 : 487/820 places, 2916/3249 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37553 ms. Remains : 487/820 places, 2916/3249 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 112 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 812 ms. (49 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 108400 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 4
Probabilistic random walk after 108400 steps, saw 74899 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
[2024-05-24 04:17:25] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:17:25] [INFO ] Invariant cache hit.
[2024-05-24 04:17:25] [INFO ] State equation strengthened by 364 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 107/112 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 305/421 variables, 116/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 40/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 168/589 variables, 77/240 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 32/272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 280/869 variables, 14/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/869 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 14/883 variables, 7/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/883 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 441/1324 variables, 294/587 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1324 variables, 292/879 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 879 constraints, problems are : Problem set: 0 solved, 4 unsolved in 958 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 107/112 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-24 04:17:26] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 305/421 variables, 116/124 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 40/164 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 0/164 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 168/589 variables, 77/241 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 32/273 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/589 variables, 0/273 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 280/869 variables, 14/287 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/869 variables, 0/287 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 14/883 variables, 7/294 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/883 variables, 3/297 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-24 04:17:26] [INFO ] Deduced a trap composed of 3 places in 236 ms of which 2 ms to minimize.
[2024-05-24 04:17:27] [INFO ] Deduced a trap composed of 3 places in 236 ms of which 3 ms to minimize.
[2024-05-24 04:17:27] [INFO ] Deduced a trap composed of 3 places in 253 ms of which 2 ms to minimize.
[2024-05-24 04:17:27] [INFO ] Deduced a trap composed of 19 places in 201 ms of which 2 ms to minimize.
[2024-05-24 04:17:27] [INFO ] Deduced a trap composed of 3 places in 202 ms of which 3 ms to minimize.
[2024-05-24 04:17:28] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 3 ms to minimize.
[2024-05-24 04:17:28] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 2 ms to minimize.
[2024-05-24 04:17:28] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 2 ms to minimize.
[2024-05-24 04:17:28] [INFO ] Deduced a trap composed of 6 places in 114 ms of which 2 ms to minimize.
[2024-05-24 04:17:28] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:17:28] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 2 ms to minimize.
[2024-05-24 04:17:28] [INFO ] Deduced a trap composed of 49 places in 97 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/883 variables, 12/309 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-24 04:17:29] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/883 variables, 1/310 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/883 variables, 0/310 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 441/1324 variables, 294/604 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1324 variables, 292/896 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1324 variables, 0/896 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/1324 variables, 0/896 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 896 constraints, problems are : Problem set: 1 solved, 3 unsolved in 3850 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 14/14 constraints]
After SMT, in 4832ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2820 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 105 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 487/487 places, 2916/2916 transitions.
RANDOM walk for 40000 steps (8 resets) in 1015 ms. (39 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 121800 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 3
Probabilistic random walk after 121800 steps, saw 83370 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
[2024-05-24 04:17:36] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:17:36] [INFO ] Invariant cache hit.
[2024-05-24 04:17:36] [INFO ] State equation strengthened by 364 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 107/112 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 305/421 variables, 116/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 40/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 168/589 variables, 77/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 32/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 280/869 variables, 14/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/869 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 14/883 variables, 7/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/883 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 441/1324 variables, 294/587 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1324 variables, 292/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 879 constraints, problems are : Problem set: 0 solved, 3 unsolved in 782 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 107/112 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 04:17:37] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 305/421 variables, 116/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 40/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 168/589 variables, 77/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 32/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/589 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 280/869 variables, 14/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/869 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 14/883 variables, 7/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/883 variables, 3/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 04:17:38] [INFO ] Deduced a trap composed of 7 places in 334 ms of which 3 ms to minimize.
[2024-05-24 04:17:38] [INFO ] Deduced a trap composed of 3 places in 292 ms of which 3 ms to minimize.
[2024-05-24 04:17:38] [INFO ] Deduced a trap composed of 54 places in 275 ms of which 3 ms to minimize.
[2024-05-24 04:17:38] [INFO ] Deduced a trap composed of 3 places in 297 ms of which 3 ms to minimize.
[2024-05-24 04:17:39] [INFO ] Deduced a trap composed of 3 places in 270 ms of which 3 ms to minimize.
[2024-05-24 04:17:39] [INFO ] Deduced a trap composed of 26 places in 346 ms of which 3 ms to minimize.
[2024-05-24 04:17:39] [INFO ] Deduced a trap composed of 29 places in 310 ms of which 3 ms to minimize.
[2024-05-24 04:17:40] [INFO ] Deduced a trap composed of 3 places in 283 ms of which 3 ms to minimize.
[2024-05-24 04:17:40] [INFO ] Deduced a trap composed of 34 places in 241 ms of which 3 ms to minimize.
[2024-05-24 04:17:40] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 3 ms to minimize.
[2024-05-24 04:17:41] [INFO ] Deduced a trap composed of 38 places in 241 ms of which 3 ms to minimize.
[2024-05-24 04:17:41] [INFO ] Deduced a trap composed of 3 places in 215 ms of which 3 ms to minimize.
[2024-05-24 04:17:41] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 2 ms to minimize.
[2024-05-24 04:17:41] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 1 ms to minimize.
[2024-05-24 04:17:41] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 1 ms to minimize.
[2024-05-24 04:17:41] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-05-24 04:17:41] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 2 ms to minimize.
[2024-05-24 04:17:42] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/883 variables, 18/315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 04:17:42] [INFO ] Deduced a trap composed of 40 places in 213 ms of which 3 ms to minimize.
[2024-05-24 04:17:42] [INFO ] Deduced a trap composed of 3 places in 248 ms of which 3 ms to minimize.
[2024-05-24 04:17:42] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/883 variables, 3/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/883 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 441/1324 variables, 294/612 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1324 variables, 292/904 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1324 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/1324 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 904 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6522 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 22/22 constraints]
After SMT, in 7326ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4363 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 109 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 487/487 places, 2916/2916 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 105 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 04:17:48] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:17:48] [INFO ] Invariant cache hit.
[2024-05-24 04:17:49] [INFO ] Implicit Places using invariants in 920 ms returned []
[2024-05-24 04:17:49] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:17:49] [INFO ] Invariant cache hit.
[2024-05-24 04:17:49] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 04:17:53] [INFO ] Implicit Places using invariants and state equation in 3964 ms returned []
Implicit Place search using SMT with State Equation took 4886 ms to find 0 implicit places.
[2024-05-24 04:17:53] [INFO ] Redundant transitions in 107 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-05-24 04:17:53] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:17:53] [INFO ] Invariant cache hit.
[2024-05-24 04:17:53] [INFO ] State equation strengthened by 364 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 32595ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32628ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37737 ms. Remains : 487/487 places, 2916/2916 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2700 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 277 transitions
Ensure Unique test removed 2024 transitions
Reduce isomorphic transitions removed 2301 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 415 transition count 518
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 318 transition count 518
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 195 place count 318 transition count 500
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 239 place count 292 transition count 500
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 525 place count 149 transition count 357
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 595 place count 149 transition count 287
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 611 place count 141 transition count 287
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 619 place count 141 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 629 place count 141 transition count 269
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 703 place count 141 transition count 195
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 777 place count 67 transition count 195
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 786 place count 67 transition count 195
Applied a total of 786 rules in 38 ms. Remains 67 /487 variables (removed 420) and now considering 195/2916 (removed 2721) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 195 rows 67 cols
[2024-05-24 04:18:25] [INFO ] Computed 20 invariants in 2 ms
[2024-05-24 04:18:25] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 04:18:26] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-05-24 04:18:26] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 04:18:26] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 04:18:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 04:18:26] [INFO ] After 37ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-24 04:18:26] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-24 04:18:26] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:18:26] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-24 04:18:26] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-05-24 04:18:26] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-24 04:18:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 175 ms
TRAPS : Iteration 1
[2024-05-24 04:18:26] [INFO ] After 305ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-24 04:18:26] [INFO ] After 506ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 614 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0)), (G (OR p1 p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 117 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 84 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 324 ms.
Product exploration explored 100000 steps with 0 reset in 377 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 108 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 04:18:27] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-05-24 04:18:27] [INFO ] Computed 28 invariants in 6 ms
[2024-05-24 04:18:28] [INFO ] Implicit Places using invariants in 936 ms returned []
[2024-05-24 04:18:28] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:18:28] [INFO ] Invariant cache hit.
[2024-05-24 04:18:29] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 04:18:32] [INFO ] Implicit Places using invariants and state equation in 4193 ms returned []
Implicit Place search using SMT with State Equation took 5132 ms to find 0 implicit places.
[2024-05-24 04:18:32] [INFO ] Redundant transitions in 98 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-05-24 04:18:32] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:18:32] [INFO ] Invariant cache hit.
[2024-05-24 04:18:32] [INFO ] State equation strengthened by 364 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.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 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.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 1.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 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 1.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 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 32234ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32267ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37618 ms. Remains : 487/487 places, 2916/2916 transitions.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-06 finished in 241157 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F((X(p1)||G(p2)))||p0))))'
Support contains 4 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 820 transition count 3249
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 820 transition count 3249
Applied a total of 6 rules in 40 ms. Remains 820 /823 variables (removed 3) and now considering 3249/3276 (removed 27) transitions.
[2024-05-24 04:19:05] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
// Phase 1: matrix 1170 rows 820 cols
[2024-05-24 04:19:05] [INFO ] Computed 28 invariants in 5 ms
[2024-05-24 04:19:06] [INFO ] Implicit Places using invariants in 1051 ms returned []
[2024-05-24 04:19:06] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 04:19:06] [INFO ] Invariant cache hit.
[2024-05-24 04:19:07] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 04:19:13] [INFO ] Implicit Places using invariants and state equation in 6760 ms returned []
Implicit Place search using SMT with State Equation took 7818 ms to find 0 implicit places.
Running 3240 sub problems to find dead transitions.
[2024-05-24 04:19:13] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 04:19:13] [INFO ] Invariant cache hit.
[2024-05-24 04:19:13] [INFO ] State equation strengthened by 364 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3240 unsolved
SMT process timed out in 32702ms, After SMT, problems are : Problem set: 0 solved, 3240 unsolved
Search for dead transitions found 0 dead transitions in 32739ms
Starting structural reductions in LTL mode, iteration 1 : 820/823 places, 3249/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40603 ms. Remains : 820/823 places, 3249/3276 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-07
Product exploration explored 100000 steps with 50 reset in 385 ms.
Product exploration explored 100000 steps with 51 reset in 447 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 111 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (8 resets) in 853 ms. (46 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
[2024-05-24 04:19:47] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 04:19:47] [INFO ] Invariant cache hit.
[2024-05-24 04:19:47] [INFO ] State equation strengthened by 364 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 181/185 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/187 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 65/252 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/280 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 492/772 variables, 280/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/772 variables, 65/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/772 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/916 variables, 66/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/916 variables, 28/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/916 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 462/1378 variables, 12/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1378 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/1390 variables, 6/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1390 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 600/1990 variables, 474/941 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1990 variables, 271/1212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1990 variables, 0/1212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1990 variables, 0/1212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1990/1990 variables, and 1212 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1018 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 820/820 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 181/185 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/187 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 65/252 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 28/280 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 492/772 variables, 280/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/772 variables, 65/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/772 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/916 variables, 66/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/916 variables, 28/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/916 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 462/1378 variables, 12/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1378 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/1390 variables, 6/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1390 variables, 2/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:19:49] [INFO ] Deduced a trap composed of 35 places in 495 ms of which 5 ms to minimize.
[2024-05-24 04:19:50] [INFO ] Deduced a trap composed of 3 places in 384 ms of which 5 ms to minimize.
[2024-05-24 04:19:50] [INFO ] Deduced a trap composed of 4 places in 322 ms of which 4 ms to minimize.
[2024-05-24 04:19:50] [INFO ] Deduced a trap composed of 54 places in 372 ms of which 4 ms to minimize.
[2024-05-24 04:19:51] [INFO ] Deduced a trap composed of 44 places in 321 ms of which 4 ms to minimize.
[2024-05-24 04:19:51] [INFO ] Deduced a trap composed of 90 places in 399 ms of which 5 ms to minimize.
[2024-05-24 04:19:51] [INFO ] Deduced a trap composed of 3 places in 366 ms of which 4 ms to minimize.
[2024-05-24 04:19:52] [INFO ] Deduced a trap composed of 38 places in 369 ms of which 4 ms to minimize.
[2024-05-24 04:19:52] [INFO ] Deduced a trap composed of 51 places in 404 ms of which 5 ms to minimize.
[2024-05-24 04:19:53] [INFO ] Deduced a trap composed of 3 places in 350 ms of which 4 ms to minimize.
[2024-05-24 04:19:53] [INFO ] Deduced a trap composed of 40 places in 278 ms of which 4 ms to minimize.
SMT process timed out in 6063ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 820 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 820 transition count 3240
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 811 transition count 3240
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 811 transition count 2989
Deduced a syphon composed of 251 places in 3 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 560 transition count 2989
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 664 place count 488 transition count 2917
Applied a total of 664 rules in 176 ms. Remains 488 /820 variables (removed 332) and now considering 2917/3249 (removed 332) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 488/820 places, 2917/3249 transitions.
RANDOM walk for 40000 steps (8 resets) in 966 ms. (41 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 172220 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 2
Probabilistic random walk after 172220 steps, saw 113579 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
[2024-05-24 04:19:57] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2024-05-24 04:19:57] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 04:19:57] [INFO ] State equation strengthened by 364 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 108/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/159 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/170 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 382/552 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/696 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/696 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/696 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 240/936 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/948 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/948 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 378/1326 variables, 252/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1326 variables, 266/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1326 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1326 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1326/1326 variables, and 880 constraints, problems are : Problem set: 0 solved, 2 unsolved in 713 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 108/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/159 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/170 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 382/552 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/696 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/696 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/696 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 240/936 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/948 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/948 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:19:58] [INFO ] Deduced a trap composed of 3 places in 289 ms of which 3 ms to minimize.
[2024-05-24 04:19:58] [INFO ] Deduced a trap composed of 23 places in 215 ms of which 2 ms to minimize.
[2024-05-24 04:19:59] [INFO ] Deduced a trap composed of 3 places in 338 ms of which 3 ms to minimize.
[2024-05-24 04:19:59] [INFO ] Deduced a trap composed of 3 places in 267 ms of which 3 ms to minimize.
[2024-05-24 04:19:59] [INFO ] Deduced a trap composed of 15 places in 278 ms of which 2 ms to minimize.
[2024-05-24 04:20:00] [INFO ] Deduced a trap composed of 47 places in 277 ms of which 3 ms to minimize.
[2024-05-24 04:20:00] [INFO ] Deduced a trap composed of 39 places in 197 ms of which 2 ms to minimize.
[2024-05-24 04:20:00] [INFO ] Deduced a trap composed of 35 places in 231 ms of which 3 ms to minimize.
[2024-05-24 04:20:00] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 1 ms to minimize.
[2024-05-24 04:20:00] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 1 ms to minimize.
[2024-05-24 04:20:01] [INFO ] Deduced a trap composed of 26 places in 164 ms of which 2 ms to minimize.
[2024-05-24 04:20:01] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 2 ms to minimize.
[2024-05-24 04:20:01] [INFO ] Deduced a trap composed of 3 places in 151 ms of which 2 ms to minimize.
[2024-05-24 04:20:01] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2024-05-24 04:20:01] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:20:01] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/948 variables, 16/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/948 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 378/1326 variables, 252/632 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1326 variables, 266/898 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:20:02] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1326 variables, 1/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1326 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/1326 variables, 0/899 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1326/1326 variables, and 899 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4565 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 17/17 constraints]
After SMT, in 5301ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 383 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 106 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 488/488 places, 2917/2917 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 103 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2024-05-24 04:20:03] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 04:20:03] [INFO ] Invariant cache hit.
[2024-05-24 04:20:03] [INFO ] Implicit Places using invariants in 852 ms returned []
[2024-05-24 04:20:03] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 04:20:03] [INFO ] Invariant cache hit.
[2024-05-24 04:20:04] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 04:20:07] [INFO ] Implicit Places using invariants and state equation in 3983 ms returned []
Implicit Place search using SMT with State Equation took 4843 ms to find 0 implicit places.
[2024-05-24 04:20:07] [INFO ] Redundant transitions in 105 ms returned []
Running 2908 sub problems to find dead transitions.
[2024-05-24 04:20:08] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 04:20:08] [INFO ] Invariant cache hit.
[2024-05-24 04:20:08] [INFO ] State equation strengthened by 364 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2908 unsolved
SMT process timed out in 32495ms, After SMT, problems are : Problem set: 0 solved, 2908 unsolved
Search for dead transitions found 0 dead transitions in 32528ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37588 ms. Remains : 488/488 places, 2917/2917 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2722 edges and 488 vertex of which 80 / 488 are part of one of the 9 SCC in 1 ms
Free SCC test removed 71 places
Drop transitions (Empty/Sink Transition effects.) removed 272 transitions
Ensure Unique test removed 2027 transitions
Reduce isomorphic transitions removed 2299 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 417 transition count 520
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 319 transition count 520
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 197 place count 319 transition count 503
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 238 place count 295 transition count 503
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 526 place count 151 transition count 359
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 598 place count 151 transition count 287
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 612 place count 144 transition count 288
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 618 place count 144 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 625 place count 144 transition count 275
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 698 place count 144 transition count 202
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 771 place count 71 transition count 202
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 780 place count 71 transition count 202
Applied a total of 780 rules in 33 ms. Remains 71 /488 variables (removed 417) and now considering 202/2917 (removed 2715) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 202 rows 71 cols
[2024-05-24 04:20:40] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 04:20:40] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 04:20:40] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-24 04:20:40] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-24 04:20:40] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 04:20:40] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 04:20:40] [INFO ] After 22ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 04:20:40] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-24 04:20:40] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-24 04:20:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 65 ms
[2024-05-24 04:20:40] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-24 04:20:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
TRAPS : Iteration 1
[2024-05-24 04:20:40] [INFO ] After 170ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 04:20:40] [INFO ] After 325ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 406 ms.
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p2) p1))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 197 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 820 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 820 transition count 3240
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 811 transition count 3240
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 811 transition count 2989
Deduced a syphon composed of 251 places in 3 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 560 transition count 2989
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 664 place count 488 transition count 2917
Applied a total of 664 rules in 179 ms. Remains 488 /820 variables (removed 332) and now considering 2917/3249 (removed 332) transitions.
[2024-05-24 04:20:41] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2024-05-24 04:20:41] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 04:20:42] [INFO ] Implicit Places using invariants in 909 ms returned []
[2024-05-24 04:20:42] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 04:20:42] [INFO ] Invariant cache hit.
[2024-05-24 04:20:42] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 04:20:46] [INFO ] Implicit Places using invariants and state equation in 4035 ms returned []
Implicit Place search using SMT with State Equation took 4946 ms to find 0 implicit places.
[2024-05-24 04:20:46] [INFO ] Redundant transitions in 113 ms returned []
Running 2908 sub problems to find dead transitions.
[2024-05-24 04:20:46] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 04:20:46] [INFO ] Invariant cache hit.
[2024-05-24 04:20:46] [INFO ] State equation strengthened by 364 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.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 1.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 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.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 1.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 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2908 unsolved
SMT process timed out in 32825ms, After SMT, problems are : Problem set: 0 solved, 2908 unsolved
Search for dead transitions found 0 dead transitions in 32858ms
Starting structural reductions in SI_LTL mode, iteration 1 : 488/820 places, 2917/3249 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38107 ms. Remains : 488/820 places, 2917/3249 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 114 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (8 resets) in 883 ms. (45 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 2/2 properties
[2024-05-24 04:21:19] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 04:21:19] [INFO ] Invariant cache hit.
[2024-05-24 04:21:20] [INFO ] State equation strengthened by 364 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 108/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/159 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/170 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 382/552 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/696 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/696 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/696 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 240/936 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/948 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/948 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 378/1326 variables, 252/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1326 variables, 266/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1326 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1326 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1326/1326 variables, and 880 constraints, problems are : Problem set: 0 solved, 2 unsolved in 707 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 108/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/159 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/170 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 382/552 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/696 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/696 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/696 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 240/936 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/948 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/948 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:21:21] [INFO ] Deduced a trap composed of 5 places in 337 ms of which 4 ms to minimize.
[2024-05-24 04:21:21] [INFO ] Deduced a trap composed of 12 places in 391 ms of which 3 ms to minimize.
[2024-05-24 04:21:22] [INFO ] Deduced a trap composed of 10 places in 272 ms of which 3 ms to minimize.
[2024-05-24 04:21:22] [INFO ] Deduced a trap composed of 3 places in 242 ms of which 2 ms to minimize.
[2024-05-24 04:21:22] [INFO ] Deduced a trap composed of 47 places in 287 ms of which 3 ms to minimize.
[2024-05-24 04:21:23] [INFO ] Deduced a trap composed of 34 places in 253 ms of which 3 ms to minimize.
[2024-05-24 04:21:23] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 2 ms to minimize.
[2024-05-24 04:21:23] [INFO ] Deduced a trap composed of 3 places in 321 ms of which 3 ms to minimize.
[2024-05-24 04:21:23] [INFO ] Deduced a trap composed of 3 places in 246 ms of which 3 ms to minimize.
[2024-05-24 04:21:24] [INFO ] Deduced a trap composed of 39 places in 214 ms of which 3 ms to minimize.
[2024-05-24 04:21:24] [INFO ] Deduced a trap composed of 35 places in 219 ms of which 3 ms to minimize.
[2024-05-24 04:21:24] [INFO ] Deduced a trap composed of 45 places in 153 ms of which 2 ms to minimize.
[2024-05-24 04:21:24] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 2 ms to minimize.
[2024-05-24 04:21:24] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 2 ms to minimize.
[2024-05-24 04:21:24] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 2 ms to minimize.
[2024-05-24 04:21:25] [INFO ] Deduced a trap composed of 52 places in 102 ms of which 1 ms to minimize.
[2024-05-24 04:21:25] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-05-24 04:21:25] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/948 variables, 18/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/948 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 378/1326 variables, 252/634 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1326 variables, 266/900 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1326 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1326/1326 variables, and 900 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 18/18 constraints]
After SMT, in 5733ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 106 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 488/488 places, 2917/2917 transitions.
RANDOM walk for 40000 steps (8 resets) in 926 ms. (43 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 168440 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 2
Probabilistic random walk after 168440 steps, saw 111139 distinct states, run finished after 3004 ms. (steps per millisecond=56 ) properties seen :0
[2024-05-24 04:21:29] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 04:21:29] [INFO ] Invariant cache hit.
[2024-05-24 04:21:29] [INFO ] State equation strengthened by 364 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 108/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/159 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/170 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 382/552 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/696 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/696 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/696 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 240/936 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/948 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/948 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 378/1326 variables, 252/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1326 variables, 266/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1326 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1326 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1326/1326 variables, and 880 constraints, problems are : Problem set: 0 solved, 2 unsolved in 757 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 108/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/159 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/170 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 382/552 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/696 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/696 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/696 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 240/936 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/948 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/948 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:21:30] [INFO ] Deduced a trap composed of 5 places in 312 ms of which 3 ms to minimize.
[2024-05-24 04:21:31] [INFO ] Deduced a trap composed of 12 places in 391 ms of which 3 ms to minimize.
[2024-05-24 04:21:31] [INFO ] Deduced a trap composed of 10 places in 264 ms of which 3 ms to minimize.
[2024-05-24 04:21:31] [INFO ] Deduced a trap composed of 3 places in 262 ms of which 2 ms to minimize.
[2024-05-24 04:21:32] [INFO ] Deduced a trap composed of 47 places in 295 ms of which 3 ms to minimize.
[2024-05-24 04:21:32] [INFO ] Deduced a trap composed of 34 places in 245 ms of which 3 ms to minimize.
[2024-05-24 04:21:32] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 2 ms to minimize.
[2024-05-24 04:21:32] [INFO ] Deduced a trap composed of 3 places in 336 ms of which 3 ms to minimize.
[2024-05-24 04:21:33] [INFO ] Deduced a trap composed of 3 places in 255 ms of which 2 ms to minimize.
[2024-05-24 04:21:33] [INFO ] Deduced a trap composed of 39 places in 202 ms of which 3 ms to minimize.
[2024-05-24 04:21:33] [INFO ] Deduced a trap composed of 35 places in 213 ms of which 2 ms to minimize.
[2024-05-24 04:21:33] [INFO ] Deduced a trap composed of 45 places in 151 ms of which 2 ms to minimize.
[2024-05-24 04:21:33] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 2 ms to minimize.
[2024-05-24 04:21:34] [INFO ] Deduced a trap composed of 3 places in 114 ms of which 2 ms to minimize.
[2024-05-24 04:21:34] [INFO ] Deduced a trap composed of 33 places in 129 ms of which 2 ms to minimize.
[2024-05-24 04:21:34] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 2 ms to minimize.
[2024-05-24 04:21:34] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-05-24 04:21:34] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/948 variables, 18/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/948 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 378/1326 variables, 252/634 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1326 variables, 266/900 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1326 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/1326 variables, 0/900 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1326/1326 variables, and 900 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5209 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 18/18 constraints]
After SMT, in 5988ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 868 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 104 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 488/488 places, 2917/2917 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 104 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2024-05-24 04:21:36] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 04:21:36] [INFO ] Invariant cache hit.
[2024-05-24 04:21:37] [INFO ] Implicit Places using invariants in 938 ms returned []
[2024-05-24 04:21:37] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 04:21:37] [INFO ] Invariant cache hit.
[2024-05-24 04:21:37] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 04:21:41] [INFO ] Implicit Places using invariants and state equation in 4228 ms returned []
Implicit Place search using SMT with State Equation took 5174 ms to find 0 implicit places.
[2024-05-24 04:21:41] [INFO ] Redundant transitions in 109 ms returned []
Running 2908 sub problems to find dead transitions.
[2024-05-24 04:21:41] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 04:21:41] [INFO ] Invariant cache hit.
[2024-05-24 04:21:41] [INFO ] State equation strengthened by 364 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2908 unsolved
SMT process timed out in 32785ms, After SMT, problems are : Problem set: 0 solved, 2908 unsolved
Search for dead transitions found 0 dead transitions in 32816ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38213 ms. Remains : 488/488 places, 2917/2917 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2722 edges and 488 vertex of which 80 / 488 are part of one of the 9 SCC in 1 ms
Free SCC test removed 71 places
Drop transitions (Empty/Sink Transition effects.) removed 272 transitions
Ensure Unique test removed 2027 transitions
Reduce isomorphic transitions removed 2299 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 417 transition count 520
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 319 transition count 520
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 197 place count 319 transition count 503
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 238 place count 295 transition count 503
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 526 place count 151 transition count 359
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 598 place count 151 transition count 287
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 612 place count 144 transition count 288
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 618 place count 144 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 625 place count 144 transition count 275
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 698 place count 144 transition count 202
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 771 place count 71 transition count 202
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 780 place count 71 transition count 202
Applied a total of 780 rules in 32 ms. Remains 71 /488 variables (removed 417) and now considering 202/2917 (removed 2715) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 202 rows 71 cols
[2024-05-24 04:22:14] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 04:22:14] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 04:22:14] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-24 04:22:14] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-24 04:22:14] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 04:22:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 04:22:14] [INFO ] After 24ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 04:22:14] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-24 04:22:14] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-24 04:22:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 66 ms
[2024-05-24 04:22:14] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-05-24 04:22:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
TRAPS : Iteration 1
[2024-05-24 04:22:14] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 04:22:14] [INFO ] After 322ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 408 ms.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p2) p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 214 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 91 reset in 389 ms.
Product exploration explored 100000 steps with 90 reset in 367 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 110 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2024-05-24 04:22:16] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2024-05-24 04:22:16] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 04:22:17] [INFO ] Implicit Places using invariants in 953 ms returned []
[2024-05-24 04:22:17] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 04:22:17] [INFO ] Invariant cache hit.
[2024-05-24 04:22:17] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 04:22:21] [INFO ] Implicit Places using invariants and state equation in 4058 ms returned []
Implicit Place search using SMT with State Equation took 5013 ms to find 0 implicit places.
[2024-05-24 04:22:21] [INFO ] Redundant transitions in 98 ms returned []
Running 2908 sub problems to find dead transitions.
[2024-05-24 04:22:21] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 04:22:21] [INFO ] Invariant cache hit.
[2024-05-24 04:22:21] [INFO ] State equation strengthened by 364 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2908 unsolved
SMT process timed out in 32731ms, After SMT, problems are : Problem set: 0 solved, 2908 unsolved
Search for dead transitions found 0 dead transitions in 32775ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38005 ms. Remains : 488/488 places, 2917/2917 transitions.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-07 finished in 228797 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((G((p0||(!p1 U (p2||G(!p1)))))||(p0&&F(p3))||((!p1 U (p2||G(!p1)))&&F(p3))))))'
Support contains 12 out of 823 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 18 place count 814 transition count 3017
Deduced a syphon composed of 250 places in 3 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 518 place count 564 transition count 3017
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 522 place count 560 transition count 2981
Iterating global reduction 2 with 4 rules applied. Total rules applied 526 place count 560 transition count 2981
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 670 place count 488 transition count 2909
Applied a total of 670 rules in 199 ms. Remains 488 /823 variables (removed 335) and now considering 2909/3276 (removed 367) transitions.
[2024-05-24 04:22:54] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
// Phase 1: matrix 830 rows 488 cols
[2024-05-24 04:22:54] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 04:22:55] [INFO ] Implicit Places using invariants in 916 ms returned []
[2024-05-24 04:22:55] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 04:22:55] [INFO ] Invariant cache hit.
[2024-05-24 04:22:55] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:22:59] [INFO ] Implicit Places using invariants and state equation in 3818 ms returned []
Implicit Place search using SMT with State Equation took 4735 ms to find 0 implicit places.
[2024-05-24 04:22:59] [INFO ] Redundant transitions in 113 ms returned []
Running 2900 sub problems to find dead transitions.
[2024-05-24 04:22:59] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 04:22:59] [INFO ] Invariant cache hit.
[2024-05-24 04:22:59] [INFO ] State equation strengthened by 356 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.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 1.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 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2900 unsolved
SMT process timed out in 32704ms, After SMT, problems are : Problem set: 0 solved, 2900 unsolved
Search for dead transitions found 0 dead transitions in 32736ms
Starting structural reductions in SI_LTL mode, iteration 1 : 488/823 places, 2909/3276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37793 ms. Remains : 488/823 places, 2909/3276 transitions.
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p2) p1 (NOT p3) (NOT p0)), (AND (NOT p2) p1 (NOT p3) (NOT p0)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p2) p1 (NOT p3) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 386 ms.
Product exploration explored 100000 steps with 0 reset in 444 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1) p3), (X p2), (X p3), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (NOT (OR (AND p0 (NOT p3)) (AND (NOT p3) p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p3) p2))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND (NOT p3) p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 181 ms. Reduced automaton from 6 states, 20 edges and 4 AP (stutter insensitive) to 6 states, 19 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2) (NOT p3) (NOT p0)), (AND p1 (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2) (NOT p3) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 1564 ms. (25 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 265 ms. (150 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 312 ms. (127 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 369 ms. (108 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 315 ms. (126 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 64430 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :2 out of 13
Probabilistic random walk after 64430 steps, saw 46238 distinct states, run finished after 3001 ms. (steps per millisecond=21 ) properties seen :2
[2024-05-24 04:23:38] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 04:23:38] [INFO ] Invariant cache hit.
[2024-05-24 04:23:38] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem apf1 is UNSAT
Problem apf4 is UNSAT
Problem apf7 is UNSAT
Problem apf8 is UNSAT
Problem apf9 is UNSAT
Problem apf10 is UNSAT
Problem apf12 is UNSAT
At refinement iteration 1 (OVERLAPS) 145/157 variables, 6/6 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/6 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 10/167 variables, 1/7 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/7 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 129/296 variables, 6/13 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 0/13 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 33/329 variables, 6/19 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 0/19 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 602/931 variables, 329/348 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/931 variables, 166/514 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/931 variables, 0/514 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 72/1003 variables, 33/547 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1003 variables, 27/574 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1003 variables, 0/574 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 120/1123 variables, 6/580 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1123 variables, 0/580 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 6/1129 variables, 3/583 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1129 variables, 0/583 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 189/1318 variables, 126/709 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1318 variables, 163/872 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1318 variables, 0/872 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/1318 variables, 0/872 constraints. Problems are: Problem set: 7 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1318/1318 variables, and 872 constraints, problems are : Problem set: 7 solved, 4 unsolved in 1214 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 145/157 variables, 6/6 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/6 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 10/167 variables, 1/7 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/7 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 129/296 variables, 6/13 constraints. Problems are: Problem set: 7 solved, 4 unsolved
[2024-05-24 04:23:39] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:23:39] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 2/15 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 0/15 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 33/329 variables, 6/21 constraints. Problems are: Problem set: 7 solved, 4 unsolved
[2024-05-24 04:23:40] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 1/22 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 0/22 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 602/931 variables, 329/351 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/931 variables, 166/517 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/931 variables, 0/517 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 72/1003 variables, 33/550 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1003 variables, 27/577 constraints. Problems are: Problem set: 7 solved, 4 unsolved
[2024-05-24 04:23:40] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1003 variables, 1/578 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1003 variables, 0/578 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 120/1123 variables, 6/584 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1123 variables, 0/584 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 6/1129 variables, 3/587 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1129 variables, 4/591 constraints. Problems are: Problem set: 7 solved, 4 unsolved
[2024-05-24 04:23:41] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 1 ms to minimize.
[2024-05-24 04:23:41] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1129 variables, 2/593 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1129 variables, 0/593 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 189/1318 variables, 126/719 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1318 variables, 163/882 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1318 variables, 0/882 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 0/1318 variables, 0/882 constraints. Problems are: Problem set: 7 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1318/1318 variables, and 882 constraints, problems are : Problem set: 7 solved, 4 unsolved in 2902 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 4/11 constraints, Known Traps: 6/6 constraints]
After SMT, in 4164ms problems are : Problem set: 7 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1670 ms.
Support contains 12 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 121 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 488/488 places, 2909/2909 transitions.
RANDOM walk for 40000 steps (8 resets) in 1243 ms. (32 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 102150 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 4
Probabilistic random walk after 102150 steps, saw 70326 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
[2024-05-24 04:23:47] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 04:23:47] [INFO ] Invariant cache hit.
[2024-05-24 04:23:47] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 145/157 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 10/167 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 129/296 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 33/329 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 602/931 variables, 329/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/931 variables, 166/514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/931 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 72/1003 variables, 33/547 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1003 variables, 27/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1003 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 120/1123 variables, 6/580 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1123 variables, 0/580 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 6/1129 variables, 3/583 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1129 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 189/1318 variables, 126/709 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1318 variables, 163/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1318 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/1318 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1318/1318 variables, and 872 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1166 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 356/356 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/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 145/157 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 10/167 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 129/296 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 04:23:49] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:23:49] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 33/329 variables, 6/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 04:23:49] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/329 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 602/931 variables, 329/351 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/931 variables, 166/517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/931 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 72/1003 variables, 33/550 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1003 variables, 27/577 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 04:23:50] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1003 variables, 1/578 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1003 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 120/1123 variables, 6/584 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1123 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 6/1129 variables, 3/587 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1129 variables, 4/591 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 04:23:50] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
[2024-05-24 04:23:50] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1129 variables, 2/593 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1129 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 189/1318 variables, 126/719 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1318 variables, 163/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1318 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 0/1318 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1318/1318 variables, and 882 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2828 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints]
After SMT, in 4021ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1709 ms.
Support contains 12 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 103 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 488/488 places, 2909/2909 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 106 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
[2024-05-24 04:23:53] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 04:23:53] [INFO ] Invariant cache hit.
[2024-05-24 04:23:54] [INFO ] Implicit Places using invariants in 776 ms returned []
[2024-05-24 04:23:54] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 04:23:54] [INFO ] Invariant cache hit.
[2024-05-24 04:23:55] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:23:58] [INFO ] Implicit Places using invariants and state equation in 4006 ms returned []
Implicit Place search using SMT with State Equation took 4784 ms to find 0 implicit places.
[2024-05-24 04:23:58] [INFO ] Redundant transitions in 104 ms returned []
Running 2900 sub problems to find dead transitions.
[2024-05-24 04:23:58] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 04:23:58] [INFO ] Invariant cache hit.
[2024-05-24 04:23:58] [INFO ] State equation strengthened by 356 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2900 unsolved
SMT process timed out in 32855ms, After SMT, problems are : Problem set: 0 solved, 2900 unsolved
Search for dead transitions found 0 dead transitions in 32885ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37889 ms. Remains : 488/488 places, 2909/2909 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2647 edges and 488 vertex of which 81 / 488 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 95 place count 416 transition count 520
Reduce places removed 94 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 95 rules applied. Total rules applied 190 place count 322 transition count 519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 191 place count 321 transition count 519
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 191 place count 321 transition count 500
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 238 place count 293 transition count 500
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 3 with 280 rules applied. Total rules applied 518 place count 153 transition count 360
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 3 with 65 rules applied. Total rules applied 583 place count 153 transition count 295
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 595 place count 147 transition count 295
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 601 place count 147 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 610 place count 147 transition count 280
Free-agglomeration rule applied 75 times.
Iterating global reduction 5 with 75 rules applied. Total rules applied 685 place count 147 transition count 205
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 5 with 75 rules applied. Total rules applied 760 place count 72 transition count 205
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 769 place count 72 transition count 205
Applied a total of 769 rules in 38 ms. Remains 72 /488 variables (removed 416) and now considering 205/2909 (removed 2704) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 205 rows 72 cols
[2024-05-24 04:24:31] [INFO ] Computed 19 invariants in 1 ms
[2024-05-24 04:24:31] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-05-24 04:24:31] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 04:24:31] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-24 04:24:31] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 04:24:31] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-24 04:24:31] [INFO ] After 69ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-24 04:24:32] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 0 ms to minimize.
[2024-05-24 04:24:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-05-24 04:24:32] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-24 04:24:32] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-05-24 04:24:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 60 ms
TRAPS : Iteration 1
[2024-05-24 04:24:32] [INFO ] After 317ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-24 04:24:32] [INFO ] After 575ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 683 ms.
Found 7 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 (NOT p1) p3), (X p2), (X p3), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (NOT (OR (AND p0 (NOT p3)) (AND (NOT p3) p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p3) p2))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1)))), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (X (X (NOT (OR (AND p0 (NOT p3)) (AND (NOT p3) p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT p1))), (G (OR p1 p2 p3 p0)), (G (OR (NOT p1) p2 p3)), (G (OR (NOT p1) p2 p3 p0)), (G (OR p1 p2 p3)), (G (OR p1 p2 p3 (NOT p0))), (G (OR (NOT p1) p2 p0)), (G (OR (NOT p1) p2 p3 (NOT p0)))]
False Knowledge obtained : [(F p1), (F (NOT p2)), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 34 factoid took 27 ms. Reduced automaton from 6 states, 19 edges and 4 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-09-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-08 finished in 98275 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 6 out of 823 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 814 transition count 3015
Deduced a syphon composed of 252 places in 3 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 562 transition count 3015
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 526 place count 558 transition count 2979
Iterating global reduction 2 with 4 rules applied. Total rules applied 530 place count 558 transition count 2979
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 674 place count 486 transition count 2907
Applied a total of 674 rules in 197 ms. Remains 486 /823 variables (removed 337) and now considering 2907/3276 (removed 369) transitions.
[2024-05-24 04:24:32] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-24 04:24:32] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 04:24:33] [INFO ] Implicit Places using invariants in 963 ms returned []
[2024-05-24 04:24:33] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:24:33] [INFO ] Invariant cache hit.
[2024-05-24 04:24:33] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:24:37] [INFO ] Implicit Places using invariants and state equation in 3798 ms returned []
Implicit Place search using SMT with State Equation took 4763 ms to find 0 implicit places.
[2024-05-24 04:24:37] [INFO ] Redundant transitions in 114 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-24 04:24:37] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:24:37] [INFO ] Invariant cache hit.
[2024-05-24 04:24:37] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32749ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32779ms
Starting structural reductions in SI_LTL mode, iteration 1 : 486/823 places, 2907/3276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37864 ms. Remains : 486/823 places, 2907/3276 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 322 ms.
Product exploration explored 100000 steps with 0 reset in 383 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 205 ms. (194 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 339240 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 1
Probabilistic random walk after 339240 steps, saw 212178 distinct states, run finished after 3004 ms. (steps per millisecond=112 ) properties seen :0
[2024-05-24 04:25:14] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:25:14] [INFO ] Invariant cache hit.
[2024-05-24 04:25:14] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 107/113 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/199 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/221 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 448/669 variables, 221/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 86/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 120/789 variables, 55/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/789 variables, 35/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/789 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 200/989 variables, 10/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/989 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/999 variables, 5/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/999 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 315/1314 variables, 210/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1314 variables, 235/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 560 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 107/113 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/199 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:25:14] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/221 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:25:14] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 448/669 variables, 221/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 86/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 120/789 variables, 55/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/789 variables, 35/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/789 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 200/989 variables, 10/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/989 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/999 variables, 5/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/999 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:25:15] [INFO ] Deduced a trap composed of 43 places in 534 ms of which 5 ms to minimize.
[2024-05-24 04:25:16] [INFO ] Deduced a trap composed of 3 places in 311 ms of which 3 ms to minimize.
[2024-05-24 04:25:16] [INFO ] Deduced a trap composed of 3 places in 277 ms of which 3 ms to minimize.
[2024-05-24 04:25:16] [INFO ] Deduced a trap composed of 8 places in 233 ms of which 2 ms to minimize.
[2024-05-24 04:25:17] [INFO ] Deduced a trap composed of 29 places in 244 ms of which 3 ms to minimize.
[2024-05-24 04:25:17] [INFO ] Deduced a trap composed of 22 places in 251 ms of which 2 ms to minimize.
[2024-05-24 04:25:17] [INFO ] Deduced a trap composed of 3 places in 213 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/999 variables, 7/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:25:17] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/999 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:25:17] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/999 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/999 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 315/1314 variables, 210/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 235/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1314 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1314 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 882 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3413 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 3993ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 6 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 104 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 204 ms. (195 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 334320 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 1
Probabilistic random walk after 334320 steps, saw 209235 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
[2024-05-24 04:25:21] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:25:21] [INFO ] Invariant cache hit.
[2024-05-24 04:25:21] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 107/113 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/199 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/221 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 448/669 variables, 221/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 86/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 120/789 variables, 55/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/789 variables, 35/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/789 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 200/989 variables, 10/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/989 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/999 variables, 5/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/999 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 315/1314 variables, 210/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1314 variables, 235/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 552 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 107/113 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/199 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:25:22] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/221 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:25:22] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 448/669 variables, 221/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 86/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 120/789 variables, 55/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/789 variables, 35/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/789 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 200/989 variables, 10/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/989 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/999 variables, 5/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/999 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:25:23] [INFO ] Deduced a trap composed of 43 places in 532 ms of which 5 ms to minimize.
[2024-05-24 04:25:23] [INFO ] Deduced a trap composed of 3 places in 320 ms of which 3 ms to minimize.
[2024-05-24 04:25:24] [INFO ] Deduced a trap composed of 3 places in 251 ms of which 2 ms to minimize.
[2024-05-24 04:25:24] [INFO ] Deduced a trap composed of 8 places in 262 ms of which 3 ms to minimize.
[2024-05-24 04:25:24] [INFO ] Deduced a trap composed of 29 places in 241 ms of which 2 ms to minimize.
[2024-05-24 04:25:24] [INFO ] Deduced a trap composed of 22 places in 237 ms of which 2 ms to minimize.
[2024-05-24 04:25:25] [INFO ] Deduced a trap composed of 3 places in 204 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/999 variables, 7/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:25:25] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/999 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:25:25] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/999 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/999 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 315/1314 variables, 210/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 235/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1314 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1314 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 882 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3812 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 4398ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 6 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 121 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 114 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-24 04:25:26] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:25:26] [INFO ] Invariant cache hit.
[2024-05-24 04:25:27] [INFO ] Implicit Places using invariants in 925 ms returned []
[2024-05-24 04:25:27] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:25:27] [INFO ] Invariant cache hit.
[2024-05-24 04:25:27] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:25:30] [INFO ] Implicit Places using invariants and state equation in 3915 ms returned []
Implicit Place search using SMT with State Equation took 4842 ms to find 0 implicit places.
[2024-05-24 04:25:31] [INFO ] Redundant transitions in 104 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-24 04:25:31] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:25:31] [INFO ] Invariant cache hit.
[2024-05-24 04:25:31] [INFO ] State equation strengthened by 356 read => feed constraints.
(s400 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.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 1.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 1.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 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.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 1.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 1.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 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 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 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32700ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32731ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37801 ms. Remains : 486/486 places, 2907/2907 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2677 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 414 transition count 516
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 193 place count 318 transition count 516
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 193 place count 318 transition count 497
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 240 place count 290 transition count 497
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 284 rules applied. Total rules applied 524 place count 148 transition count 355
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 592 place count 148 transition count 287
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 610 place count 139 transition count 287
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 619 place count 139 transition count 278
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 630 place count 139 transition count 267
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 704 place count 139 transition count 193
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 778 place count 65 transition count 193
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 787 place count 65 transition count 193
Applied a total of 787 rules in 24 ms. Remains 65 /486 variables (removed 421) and now considering 193/2907 (removed 2714) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 193 rows 65 cols
[2024-05-24 04:26:03] [INFO ] Computed 19 invariants in 0 ms
[2024-05-24 04:26:03] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:26:03] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-05-24 04:26:03] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:26:03] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-24 04:26:03] [INFO ] After 15ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 04:26:04] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-24 04:26:04] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-24 04:26:04] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-24 04:26:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 88 ms
TRAPS : Iteration 1
[2024-05-24 04:26:04] [INFO ] After 137ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 04:26:04] [INFO ] After 264ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 328 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 6 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 109 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-24 04:26:04] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-24 04:26:04] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 04:26:05] [INFO ] Implicit Places using invariants in 976 ms returned []
[2024-05-24 04:26:05] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:26:05] [INFO ] Invariant cache hit.
[2024-05-24 04:26:05] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:26:08] [INFO ] Implicit Places using invariants and state equation in 3549 ms returned []
Implicit Place search using SMT with State Equation took 4525 ms to find 0 implicit places.
[2024-05-24 04:26:09] [INFO ] Redundant transitions in 100 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-24 04:26:09] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:26:09] [INFO ] Invariant cache hit.
[2024-05-24 04:26:09] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32619ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32649ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37391 ms. Remains : 486/486 places, 2907/2907 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 159 ms. (250 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 334100 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 1
Probabilistic random walk after 334100 steps, saw 209136 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
[2024-05-24 04:26:44] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:26:44] [INFO ] Invariant cache hit.
[2024-05-24 04:26:44] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 107/113 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/199 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/221 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 448/669 variables, 221/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 86/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 120/789 variables, 55/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/789 variables, 35/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/789 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 200/989 variables, 10/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/989 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/999 variables, 5/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/999 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 315/1314 variables, 210/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1314 variables, 235/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 557 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 107/113 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/199 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:26:45] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/221 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:26:45] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 448/669 variables, 221/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 86/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 120/789 variables, 55/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/789 variables, 35/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/789 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 200/989 variables, 10/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/989 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/999 variables, 5/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/999 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:26:46] [INFO ] Deduced a trap composed of 43 places in 520 ms of which 4 ms to minimize.
[2024-05-24 04:26:46] [INFO ] Deduced a trap composed of 3 places in 337 ms of which 3 ms to minimize.
[2024-05-24 04:26:47] [INFO ] Deduced a trap composed of 3 places in 259 ms of which 2 ms to minimize.
[2024-05-24 04:26:47] [INFO ] Deduced a trap composed of 8 places in 259 ms of which 2 ms to minimize.
[2024-05-24 04:26:47] [INFO ] Deduced a trap composed of 29 places in 257 ms of which 2 ms to minimize.
[2024-05-24 04:26:48] [INFO ] Deduced a trap composed of 22 places in 249 ms of which 3 ms to minimize.
[2024-05-24 04:26:48] [INFO ] Deduced a trap composed of 3 places in 206 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/999 variables, 7/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:26:48] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/999 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:26:48] [INFO ] Deduced a trap composed of 19 places in 159 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/999 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/999 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 315/1314 variables, 210/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 235/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1314 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1314 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 882 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3454 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 4030ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 58 ms.
Support contains 6 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 121 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 284 ms. (140 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 337590 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 1
Probabilistic random walk after 337590 steps, saw 211307 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
[2024-05-24 04:26:52] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:26:52] [INFO ] Invariant cache hit.
[2024-05-24 04:26:52] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 107/113 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/199 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/221 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 448/669 variables, 221/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/669 variables, 86/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/669 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 120/789 variables, 55/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/789 variables, 35/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/789 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 200/989 variables, 10/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/989 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 10/999 variables, 5/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/999 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 315/1314 variables, 210/635 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1314 variables, 235/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 561 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 107/113 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 86/199 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:26:52] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 22/221 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:26:53] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 448/669 variables, 221/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/669 variables, 86/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/669 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 120/789 variables, 55/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/789 variables, 35/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/789 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 200/989 variables, 10/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/989 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/999 variables, 5/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/999 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:26:53] [INFO ] Deduced a trap composed of 43 places in 531 ms of which 5 ms to minimize.
[2024-05-24 04:26:54] [INFO ] Deduced a trap composed of 3 places in 314 ms of which 3 ms to minimize.
[2024-05-24 04:26:54] [INFO ] Deduced a trap composed of 3 places in 244 ms of which 3 ms to minimize.
[2024-05-24 04:26:54] [INFO ] Deduced a trap composed of 8 places in 247 ms of which 3 ms to minimize.
[2024-05-24 04:26:55] [INFO ] Deduced a trap composed of 29 places in 242 ms of which 3 ms to minimize.
[2024-05-24 04:26:55] [INFO ] Deduced a trap composed of 22 places in 261 ms of which 3 ms to minimize.
[2024-05-24 04:26:55] [INFO ] Deduced a trap composed of 3 places in 206 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/999 variables, 7/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:26:55] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/999 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:26:55] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/999 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/999 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 315/1314 variables, 210/647 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 235/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1314 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1314 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 882 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3401 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 3982ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 52 ms.
Support contains 6 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 106 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 106 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-24 04:26:56] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:26:56] [INFO ] Invariant cache hit.
[2024-05-24 04:26:57] [INFO ] Implicit Places using invariants in 922 ms returned []
[2024-05-24 04:26:57] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:26:57] [INFO ] Invariant cache hit.
[2024-05-24 04:26:57] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:27:01] [INFO ] Implicit Places using invariants and state equation in 3697 ms returned []
Implicit Place search using SMT with State Equation took 4621 ms to find 0 implicit places.
[2024-05-24 04:27:01] [INFO ] Redundant transitions in 103 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-24 04:27:01] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:27:01] [INFO ] Invariant cache hit.
[2024-05-24 04:27:01] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32429ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32458ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37296 ms. Remains : 486/486 places, 2907/2907 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2677 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 414 transition count 516
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 193 place count 318 transition count 516
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 193 place count 318 transition count 497
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 240 place count 290 transition count 497
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 284 rules applied. Total rules applied 524 place count 148 transition count 355
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 592 place count 148 transition count 287
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 610 place count 139 transition count 287
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 619 place count 139 transition count 278
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 630 place count 139 transition count 267
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 704 place count 139 transition count 193
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 778 place count 65 transition count 193
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 787 place count 65 transition count 193
Applied a total of 787 rules in 83 ms. Remains 65 /486 variables (removed 421) and now considering 193/2907 (removed 2714) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 193 rows 65 cols
[2024-05-24 04:27:33] [INFO ] Computed 19 invariants in 0 ms
[2024-05-24 04:27:33] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:27:33] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-05-24 04:27:33] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:27:33] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-24 04:27:33] [INFO ] After 18ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 04:27:33] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-24 04:27:33] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-05-24 04:27:34] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-24 04:27:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 93 ms
TRAPS : Iteration 1
[2024-05-24 04:27:34] [INFO ] After 146ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 04:27:34] [INFO ] After 289ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 415 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 331 ms.
Product exploration explored 100000 steps with 0 reset in 411 ms.
Support contains 6 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 108 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-24 04:27:35] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-24 04:27:35] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 04:27:35] [INFO ] Implicit Places using invariants in 731 ms returned []
[2024-05-24 04:27:35] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:27:35] [INFO ] Invariant cache hit.
[2024-05-24 04:27:36] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:27:39] [INFO ] Implicit Places using invariants and state equation in 3830 ms returned []
Implicit Place search using SMT with State Equation took 4563 ms to find 0 implicit places.
[2024-05-24 04:27:39] [INFO ] Redundant transitions in 98 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-24 04:27:39] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:27:39] [INFO ] Invariant cache hit.
[2024-05-24 04:27:39] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32636ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32666ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37443 ms. Remains : 486/486 places, 2907/2907 transitions.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-09 finished in 220245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 823 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 814 transition count 3015
Deduced a syphon composed of 252 places in 2 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 562 transition count 3015
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 526 place count 558 transition count 2979
Iterating global reduction 2 with 4 rules applied. Total rules applied 530 place count 558 transition count 2979
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 674 place count 486 transition count 2907
Applied a total of 674 rules in 197 ms. Remains 486 /823 variables (removed 337) and now considering 2907/3276 (removed 369) transitions.
[2024-05-24 04:28:12] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:28:12] [INFO ] Invariant cache hit.
[2024-05-24 04:28:13] [INFO ] Implicit Places using invariants in 964 ms returned []
[2024-05-24 04:28:13] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:28:13] [INFO ] Invariant cache hit.
[2024-05-24 04:28:14] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:28:17] [INFO ] Implicit Places using invariants and state equation in 3930 ms returned []
Implicit Place search using SMT with State Equation took 4899 ms to find 0 implicit places.
[2024-05-24 04:28:17] [INFO ] Redundant transitions in 111 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-24 04:28:17] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:28:17] [INFO ] Invariant cache hit.
[2024-05-24 04:28:17] [INFO ] State equation strengthened by 356 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32350ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32380ms
Starting structural reductions in SI_LTL mode, iteration 1 : 486/823 places, 2907/3276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37597 ms. Remains : 486/823 places, 2907/3276 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 306 ms.
Product exploration explored 100000 steps with 0 reset in 360 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 350090 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 1
Probabilistic random walk after 350090 steps, saw 218198 distinct states, run finished after 3004 ms. (steps per millisecond=116 ) properties seen :0
[2024-05-24 04:28:54] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:28:54] [INFO ] Invariant cache hit.
[2024-05-24 04:28:54] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/111 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/115 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:28:54] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 296/411 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 168/579 variables, 77/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 32/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 280/859 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/859 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 14/873 variables, 7/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 441/1314 variables, 294/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1314 variables, 292/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 627 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/111 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/115 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 296/411 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 168/579 variables, 77/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 32/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 280/859 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/859 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 14/873 variables, 7/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:28:55] [INFO ] Deduced a trap composed of 3 places in 282 ms of which 3 ms to minimize.
[2024-05-24 04:28:55] [INFO ] Deduced a trap composed of 3 places in 337 ms of which 3 ms to minimize.
[2024-05-24 04:28:56] [INFO ] Deduced a trap composed of 37 places in 342 ms of which 3 ms to minimize.
[2024-05-24 04:28:56] [INFO ] Deduced a trap composed of 12 places in 344 ms of which 3 ms to minimize.
[2024-05-24 04:28:56] [INFO ] Deduced a trap composed of 25 places in 324 ms of which 3 ms to minimize.
[2024-05-24 04:28:57] [INFO ] Deduced a trap composed of 33 places in 361 ms of which 3 ms to minimize.
[2024-05-24 04:28:57] [INFO ] Deduced a trap composed of 3 places in 282 ms of which 2 ms to minimize.
[2024-05-24 04:28:57] [INFO ] Deduced a trap composed of 29 places in 310 ms of which 3 ms to minimize.
[2024-05-24 04:28:58] [INFO ] Deduced a trap composed of 21 places in 317 ms of which 3 ms to minimize.
[2024-05-24 04:28:58] [INFO ] Deduced a trap composed of 44 places in 297 ms of which 3 ms to minimize.
[2024-05-24 04:28:58] [INFO ] Deduced a trap composed of 42 places in 329 ms of which 3 ms to minimize.
[2024-05-24 04:28:59] [INFO ] Deduced a trap composed of 35 places in 325 ms of which 3 ms to minimize.
[2024-05-24 04:28:59] [INFO ] Deduced a trap composed of 35 places in 255 ms of which 3 ms to minimize.
[2024-05-24 04:28:59] [INFO ] Deduced a trap composed of 25 places in 227 ms of which 2 ms to minimize.
[2024-05-24 04:28:59] [INFO ] Deduced a trap composed of 24 places in 297 ms of which 3 ms to minimize.
SMT process timed out in 5880ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 106 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 348830 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 1
Probabilistic random walk after 348830 steps, saw 217484 distinct states, run finished after 3002 ms. (steps per millisecond=116 ) properties seen :0
[2024-05-24 04:29:03] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:29:03] [INFO ] Invariant cache hit.
[2024-05-24 04:29:03] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/111 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/115 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:29:03] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 296/411 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 168/579 variables, 77/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 32/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 280/859 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/859 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 14/873 variables, 7/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 441/1314 variables, 294/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1314 variables, 292/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 623 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/111 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/115 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 296/411 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 168/579 variables, 77/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 32/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 280/859 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/859 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 14/873 variables, 7/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:29:04] [INFO ] Deduced a trap composed of 3 places in 350 ms of which 3 ms to minimize.
[2024-05-24 04:29:04] [INFO ] Deduced a trap composed of 3 places in 341 ms of which 5 ms to minimize.
[2024-05-24 04:29:05] [INFO ] Deduced a trap composed of 37 places in 349 ms of which 3 ms to minimize.
[2024-05-24 04:29:05] [INFO ] Deduced a trap composed of 12 places in 303 ms of which 3 ms to minimize.
[2024-05-24 04:29:05] [INFO ] Deduced a trap composed of 25 places in 332 ms of which 3 ms to minimize.
[2024-05-24 04:29:06] [INFO ] Deduced a trap composed of 33 places in 358 ms of which 3 ms to minimize.
[2024-05-24 04:29:06] [INFO ] Deduced a trap composed of 3 places in 281 ms of which 3 ms to minimize.
[2024-05-24 04:29:06] [INFO ] Deduced a trap composed of 29 places in 311 ms of which 3 ms to minimize.
[2024-05-24 04:29:07] [INFO ] Deduced a trap composed of 21 places in 325 ms of which 3 ms to minimize.
[2024-05-24 04:29:07] [INFO ] Deduced a trap composed of 44 places in 310 ms of which 3 ms to minimize.
[2024-05-24 04:29:07] [INFO ] Deduced a trap composed of 42 places in 344 ms of which 3 ms to minimize.
[2024-05-24 04:29:08] [INFO ] Deduced a trap composed of 35 places in 334 ms of which 3 ms to minimize.
[2024-05-24 04:29:08] [INFO ] Deduced a trap composed of 35 places in 273 ms of which 3 ms to minimize.
[2024-05-24 04:29:08] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 3 ms to minimize.
[2024-05-24 04:29:09] [INFO ] Deduced a trap composed of 24 places in 305 ms of which 4 ms to minimize.
[2024-05-24 04:29:09] [INFO ] Deduced a trap composed of 16 places in 238 ms of which 2 ms to minimize.
[2024-05-24 04:29:09] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 2 ms to minimize.
[2024-05-24 04:29:09] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 1 ms to minimize.
[2024-05-24 04:29:09] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/873 variables, 19/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/873 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 441/1314 variables, 294/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 292/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:29:10] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 1/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1314 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 892 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6759 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 21/21 constraints]
After SMT, in 7404ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 153 ms.
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 104 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 104 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-24 04:29:10] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:29:10] [INFO ] Invariant cache hit.
[2024-05-24 04:29:11] [INFO ] Implicit Places using invariants in 1017 ms returned []
[2024-05-24 04:29:11] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:29:11] [INFO ] Invariant cache hit.
[2024-05-24 04:29:12] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:29:15] [INFO ] Implicit Places using invariants and state equation in 3796 ms returned []
Implicit Place search using SMT with State Equation took 4815 ms to find 0 implicit places.
[2024-05-24 04:29:15] [INFO ] Redundant transitions in 103 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-24 04:29:15] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:29:15] [INFO ] Invariant cache hit.
[2024-05-24 04:29:15] [INFO ] State equation strengthened by 356 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32358ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32390ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37420 ms. Remains : 486/486 places, 2907/2907 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2702 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 414 transition count 515
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 317 transition count 515
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 195 place count 317 transition count 496
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 242 place count 289 transition count 496
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 528 place count 146 transition count 353
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 598 place count 146 transition count 283
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 614 place count 138 transition count 283
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 622 place count 138 transition count 275
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 631 place count 138 transition count 266
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 704 place count 138 transition count 193
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 777 place count 65 transition count 193
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 786 place count 65 transition count 193
Applied a total of 786 rules in 29 ms. Remains 65 /486 variables (removed 421) and now considering 193/2907 (removed 2714) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 193 rows 65 cols
[2024-05-24 04:29:48] [INFO ] Computed 19 invariants in 1 ms
[2024-05-24 04:29:48] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-24 04:29:48] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:29:48] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-05-24 04:29:48] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:29:48] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 04:29:48] [INFO ] After 12ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 04:29:48] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 04:29:48] [INFO ] After 140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 289 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 119 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-24 04:29:48] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-24 04:29:48] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 04:29:49] [INFO ] Implicit Places using invariants in 998 ms returned []
[2024-05-24 04:29:49] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:29:49] [INFO ] Invariant cache hit.
[2024-05-24 04:29:50] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:29:53] [INFO ] Implicit Places using invariants and state equation in 3601 ms returned []
Implicit Place search using SMT with State Equation took 4601 ms to find 0 implicit places.
[2024-05-24 04:29:53] [INFO ] Redundant transitions in 99 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-24 04:29:53] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:29:53] [INFO ] Invariant cache hit.
[2024-05-24 04:29:53] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32297ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32328ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37155 ms. Remains : 486/486 places, 2907/2907 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 175 ms. (227 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 329580 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :0 out of 1
Probabilistic random walk after 329580 steps, saw 206633 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
[2024-05-24 04:30:29] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:30:29] [INFO ] Invariant cache hit.
[2024-05-24 04:30:29] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/111 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/115 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:30:29] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 296/411 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 168/579 variables, 77/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 32/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 280/859 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/859 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 14/873 variables, 7/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 441/1314 variables, 294/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1314 variables, 292/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 627 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/111 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/115 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 296/411 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 168/579 variables, 77/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 32/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 280/859 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/859 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 14/873 variables, 7/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:30:30] [INFO ] Deduced a trap composed of 3 places in 358 ms of which 3 ms to minimize.
[2024-05-24 04:30:30] [INFO ] Deduced a trap composed of 3 places in 350 ms of which 3 ms to minimize.
[2024-05-24 04:30:31] [INFO ] Deduced a trap composed of 37 places in 344 ms of which 3 ms to minimize.
[2024-05-24 04:30:31] [INFO ] Deduced a trap composed of 12 places in 344 ms of which 3 ms to minimize.
[2024-05-24 04:30:31] [INFO ] Deduced a trap composed of 25 places in 356 ms of which 4 ms to minimize.
[2024-05-24 04:30:32] [INFO ] Deduced a trap composed of 33 places in 360 ms of which 3 ms to minimize.
[2024-05-24 04:30:32] [INFO ] Deduced a trap composed of 3 places in 290 ms of which 3 ms to minimize.
[2024-05-24 04:30:32] [INFO ] Deduced a trap composed of 29 places in 315 ms of which 3 ms to minimize.
[2024-05-24 04:30:33] [INFO ] Deduced a trap composed of 21 places in 342 ms of which 4 ms to minimize.
[2024-05-24 04:30:33] [INFO ] Deduced a trap composed of 44 places in 332 ms of which 4 ms to minimize.
[2024-05-24 04:30:33] [INFO ] Deduced a trap composed of 42 places in 338 ms of which 3 ms to minimize.
[2024-05-24 04:30:34] [INFO ] Deduced a trap composed of 35 places in 348 ms of which 4 ms to minimize.
[2024-05-24 04:30:34] [INFO ] Deduced a trap composed of 35 places in 228 ms of which 3 ms to minimize.
[2024-05-24 04:30:34] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 2 ms to minimize.
SMT process timed out in 5754ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 123 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 204 ms. (195 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 341200 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 1
Probabilistic random walk after 341200 steps, saw 213308 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
[2024-05-24 04:30:38] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:30:38] [INFO ] Invariant cache hit.
[2024-05-24 04:30:38] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/111 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/115 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:30:38] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 296/411 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 168/579 variables, 77/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 32/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 280/859 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/859 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 14/873 variables, 7/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 441/1314 variables, 294/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1314 variables, 292/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 640 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/111 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/115 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 296/411 variables, 115/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 32/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 168/579 variables, 77/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/579 variables, 32/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/579 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 280/859 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/859 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 14/873 variables, 7/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/873 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:30:39] [INFO ] Deduced a trap composed of 3 places in 340 ms of which 3 ms to minimize.
[2024-05-24 04:30:39] [INFO ] Deduced a trap composed of 3 places in 356 ms of which 3 ms to minimize.
[2024-05-24 04:30:40] [INFO ] Deduced a trap composed of 37 places in 336 ms of which 3 ms to minimize.
[2024-05-24 04:30:40] [INFO ] Deduced a trap composed of 12 places in 379 ms of which 3 ms to minimize.
[2024-05-24 04:30:40] [INFO ] Deduced a trap composed of 25 places in 332 ms of which 4 ms to minimize.
[2024-05-24 04:30:41] [INFO ] Deduced a trap composed of 33 places in 358 ms of which 3 ms to minimize.
[2024-05-24 04:30:41] [INFO ] Deduced a trap composed of 3 places in 263 ms of which 3 ms to minimize.
[2024-05-24 04:30:41] [INFO ] Deduced a trap composed of 29 places in 307 ms of which 3 ms to minimize.
[2024-05-24 04:30:42] [INFO ] Deduced a trap composed of 21 places in 326 ms of which 3 ms to minimize.
[2024-05-24 04:30:42] [INFO ] Deduced a trap composed of 44 places in 333 ms of which 3 ms to minimize.
[2024-05-24 04:30:42] [INFO ] Deduced a trap composed of 42 places in 320 ms of which 3 ms to minimize.
[2024-05-24 04:30:43] [INFO ] Deduced a trap composed of 35 places in 327 ms of which 3 ms to minimize.
[2024-05-24 04:30:43] [INFO ] Deduced a trap composed of 35 places in 255 ms of which 3 ms to minimize.
[2024-05-24 04:30:43] [INFO ] Deduced a trap composed of 25 places in 228 ms of which 3 ms to minimize.
[2024-05-24 04:30:43] [INFO ] Deduced a trap composed of 24 places in 239 ms of which 3 ms to minimize.
[2024-05-24 04:30:44] [INFO ] Deduced a trap composed of 16 places in 255 ms of which 2 ms to minimize.
[2024-05-24 04:30:44] [INFO ] Deduced a trap composed of 35 places in 184 ms of which 2 ms to minimize.
[2024-05-24 04:30:44] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 2 ms to minimize.
[2024-05-24 04:30:44] [INFO ] Deduced a trap composed of 54 places in 102 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/873 variables, 19/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/873 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 441/1314 variables, 294/599 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 292/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:30:45] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 1/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1314 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 892 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6742 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 21/21 constraints]
After SMT, in 7401ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 153 ms.
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 122 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 110 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-24 04:30:45] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:30:45] [INFO ] Invariant cache hit.
[2024-05-24 04:30:46] [INFO ] Implicit Places using invariants in 992 ms returned []
[2024-05-24 04:30:46] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:30:46] [INFO ] Invariant cache hit.
[2024-05-24 04:30:47] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:30:50] [INFO ] Implicit Places using invariants and state equation in 3923 ms returned []
Implicit Place search using SMT with State Equation took 4917 ms to find 0 implicit places.
[2024-05-24 04:30:50] [INFO ] Redundant transitions in 104 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-24 04:30:50] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:30:50] [INFO ] Invariant cache hit.
[2024-05-24 04:30:50] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32718ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32749ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37887 ms. Remains : 486/486 places, 2907/2907 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2702 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 414 transition count 515
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 317 transition count 515
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 195 place count 317 transition count 496
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 242 place count 289 transition count 496
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 528 place count 146 transition count 353
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 598 place count 146 transition count 283
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 614 place count 138 transition count 283
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 622 place count 138 transition count 275
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 631 place count 138 transition count 266
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 704 place count 138 transition count 193
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 777 place count 65 transition count 193
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 786 place count 65 transition count 193
Applied a total of 786 rules in 28 ms. Remains 65 /486 variables (removed 421) and now considering 193/2907 (removed 2714) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 193 rows 65 cols
[2024-05-24 04:31:23] [INFO ] Computed 19 invariants in 1 ms
[2024-05-24 04:31:23] [INFO ] [Real]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-24 04:31:23] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:31:23] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-05-24 04:31:23] [INFO ] After 60ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:31:23] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 04:31:23] [INFO ] After 12ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 04:31:23] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 04:31:23] [INFO ] After 132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 287 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 334 ms.
Product exploration explored 100000 steps with 0 reset in 370 ms.
Support contains 3 out of 486 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 110 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2024-05-24 04:31:24] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-24 04:31:24] [INFO ] Computed 28 invariants in 5 ms
[2024-05-24 04:31:25] [INFO ] Implicit Places using invariants in 970 ms returned []
[2024-05-24 04:31:25] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:31:25] [INFO ] Invariant cache hit.
[2024-05-24 04:31:26] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:31:29] [INFO ] Implicit Places using invariants and state equation in 3780 ms returned []
Implicit Place search using SMT with State Equation took 4753 ms to find 0 implicit places.
[2024-05-24 04:31:29] [INFO ] Redundant transitions in 102 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-24 04:31:29] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:31:29] [INFO ] Invariant cache hit.
[2024-05-24 04:31:29] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32662ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32692ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37664 ms. Remains : 486/486 places, 2907/2907 transitions.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-10 finished in 229954 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((!p1 U (G(!p1)||(!p1&&G(!p2))))||p0))))'
Support contains 4 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 819 transition count 3240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 819 transition count 3240
Applied a total of 8 rules in 40 ms. Remains 819 /823 variables (removed 4) and now considering 3240/3276 (removed 36) transitions.
[2024-05-24 04:32:02] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
// Phase 1: matrix 1161 rows 819 cols
[2024-05-24 04:32:02] [INFO ] Computed 28 invariants in 4 ms
[2024-05-24 04:32:03] [INFO ] Implicit Places using invariants in 1071 ms returned []
[2024-05-24 04:32:03] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-05-24 04:32:03] [INFO ] Invariant cache hit.
[2024-05-24 04:32:04] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:32:11] [INFO ] Implicit Places using invariants and state equation in 7327 ms returned []
Implicit Place search using SMT with State Equation took 8399 ms to find 0 implicit places.
Running 3231 sub problems to find dead transitions.
[2024-05-24 04:32:11] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-05-24 04:32:11] [INFO ] Invariant cache hit.
[2024-05-24 04:32:11] [INFO ] State equation strengthened by 356 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/819 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3231 unsolved
SMT process timed out in 32859ms, After SMT, problems are : Problem set: 0 solved, 3231 unsolved
Search for dead transitions found 0 dead transitions in 32894ms
Starting structural reductions in LTL mode, iteration 1 : 819/823 places, 3240/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41336 ms. Remains : 819/823 places, 3240/3276 transitions.
Stuttering acceptance computed with spot in 218 ms :[true, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2)), (OR p2 (AND (NOT p0) p1))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 337 ms.
Product exploration explored 100000 steps with 0 reset in 370 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p2 p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 160 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[true, p1, (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2)), (OR p2 (AND (NOT p0) p1))]
RANDOM walk for 40000 steps (8 resets) in 945 ms. (42 steps per ms) remains 7/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 315 ms. (126 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 361 ms. (110 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 372 ms. (107 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 390 ms. (102 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 7/7 properties
[2024-05-24 04:32:46] [INFO ] Flow matrix only has 1161 transitions (discarded 2079 similar events)
[2024-05-24 04:32:46] [INFO ] Invariant cache hit.
[2024-05-24 04:32:46] [INFO ] State equation strengthened by 356 read => feed constraints.
Problem apf2 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Problem apf7 is UNSAT
At refinement iteration 1 (OVERLAPS) 86/90 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 124/214 variables, 3/5 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-05-24 04:32:46] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 56/270 variables, 4/10 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 387/657 variables, 270/280 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/657 variables, 24/304 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/657 variables, 0/304 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 105/762 variables, 9/313 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/762 variables, 1/314 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/762 variables, 33/347 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/762 variables, 0/347 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 144/906 variables, 66/413 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/906 variables, 28/441 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/906 variables, 0/441 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 462/1368 variables, 12/453 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1368 variables, 0/453 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 12/1380 variables, 6/459 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1380 variables, 0/459 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 600/1980 variables, 474/933 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1980 variables, 271/1204 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1980 variables, 0/1204 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 0/1980 variables, 0/1204 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1980/1980 variables, and 1204 constraints, problems are : Problem set: 2 solved, 5 unsolved in 2034 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 819/819 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 86/90 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 124/214 variables, 3/5 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/214 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem apf4 is UNSAT
At refinement iteration 6 (OVERLAPS) 56/270 variables, 4/10 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-24 04:32:48] [INFO ] Deduced a trap composed of 3 places in 186 ms of which 2 ms to minimize.
[2024-05-24 04:32:48] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 2/12 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 387/657 variables, 270/282 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/657 variables, 24/306 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/657 variables, 4/310 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/657 variables, 0/310 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 105/762 variables, 9/319 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/762 variables, 1/320 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/762 variables, 33/353 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/762 variables, 0/353 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 144/906 variables, 66/419 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/906 variables, 28/447 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/906 variables, 0/447 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 462/1368 variables, 12/459 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1368 variables, 0/459 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 12/1380 variables, 6/465 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-24 04:32:50] [INFO ] Deduced a trap composed of 147 places in 820 ms of which 8 ms to minimize.
[2024-05-24 04:32:51] [INFO ] Deduced a trap composed of 165 places in 805 ms of which 8 ms to minimize.
[2024-05-24 04:32:52] [INFO ] Deduced a trap composed of 141 places in 856 ms of which 8 ms to minimize.
[2024-05-24 04:32:53] [INFO ] Deduced a trap composed of 110 places in 843 ms of which 7 ms to minimize.
[2024-05-24 04:32:54] [INFO ] Deduced a trap composed of 116 places in 820 ms of which 8 ms to minimize.
SMT process timed out in 7837ms, After SMT, problems are : Problem set: 3 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 819 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 819/819 places, 3240/3240 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 819 transition count 3231
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 810 transition count 3231
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 18 place count 810 transition count 2981
Deduced a syphon composed of 250 places in 3 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 518 place count 560 transition count 2981
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 662 place count 488 transition count 2909
Applied a total of 662 rules in 166 ms. Remains 488 /819 variables (removed 331) and now considering 2909/3240 (removed 331) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 488/819 places, 2909/3240 transitions.
RANDOM walk for 40000 steps (8 resets) in 1818 ms. (21 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 103200 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 4
Probabilistic random walk after 103200 steps, saw 71750 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
[2024-05-24 04:32:58] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
// Phase 1: matrix 830 rows 488 cols
[2024-05-24 04:32:58] [INFO ] Computed 28 invariants in 10 ms
[2024-05-24 04:32:58] [INFO ] State equation strengthened by 356 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) 51/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 84/139 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 22/161 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 278/439 variables, 161/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 24/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 105/544 variables, 9/203 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/544 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/544 variables, 33/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/544 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 144/688 variables, 66/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/688 variables, 33/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/688 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 240/928 variables, 12/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/928 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 12/940 variables, 6/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/940 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 378/1318 variables, 252/606 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1318 variables, 266/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1318 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/1318 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1318/1318 variables, and 872 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1048 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 356/356 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 51/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 84/139 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 22/161 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 04:32:59] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 278/439 variables, 161/171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 24/195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 105/544 variables, 9/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/544 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/544 variables, 33/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/544 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 144/688 variables, 66/308 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/688 variables, 33/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/688 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 240/928 variables, 12/353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/928 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 12/940 variables, 6/359 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 04:33:00] [INFO ] Deduced a trap composed of 105 places in 582 ms of which 5 ms to minimize.
[2024-05-24 04:33:01] [INFO ] Deduced a trap composed of 94 places in 569 ms of which 4 ms to minimize.
[2024-05-24 04:33:01] [INFO ] Deduced a trap composed of 92 places in 576 ms of which 5 ms to minimize.
[2024-05-24 04:33:02] [INFO ] Deduced a trap composed of 97 places in 582 ms of which 5 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/940 variables, 4/363 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/940 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 378/1318 variables, 252/615 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1318 variables, 266/881 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 04:33:03] [INFO ] Deduced a trap composed of 3 places in 209 ms of which 2 ms to minimize.
[2024-05-24 04:33:03] [INFO ] Deduced a trap composed of 3 places in 152 ms of which 2 ms to minimize.
[2024-05-24 04:33:03] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 2 ms to minimize.
[2024-05-24 04:33:03] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:33:03] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1318 variables, 5/886 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1318 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 0/1318 variables, 0/886 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1318/1318 variables, and 886 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5274 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 10/10 constraints]
After SMT, in 6349ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 818 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 104 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 488/488 places, 2909/2909 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 104 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
[2024-05-24 04:33:05] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 04:33:05] [INFO ] Invariant cache hit.
[2024-05-24 04:33:06] [INFO ] Implicit Places using invariants in 806 ms returned []
[2024-05-24 04:33:06] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 04:33:06] [INFO ] Invariant cache hit.
[2024-05-24 04:33:06] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:33:10] [INFO ] Implicit Places using invariants and state equation in 4008 ms returned []
Implicit Place search using SMT with State Equation took 4816 ms to find 0 implicit places.
[2024-05-24 04:33:10] [INFO ] Redundant transitions in 103 ms returned []
Running 2900 sub problems to find dead transitions.
[2024-05-24 04:33:10] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 04:33:10] [INFO ] Invariant cache hit.
[2024-05-24 04:33:10] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2900 unsolved
SMT process timed out in 32783ms, After SMT, problems are : Problem set: 0 solved, 2900 unsolved
Search for dead transitions found 0 dead transitions in 32818ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37851 ms. Remains : 488/488 places, 2909/2909 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2721 edges and 488 vertex of which 80 / 488 are part of one of the 9 SCC in 0 ms
Free SCC test removed 71 places
Drop transitions (Empty/Sink Transition effects.) removed 275 transitions
Ensure Unique test removed 2017 transitions
Reduce isomorphic transitions removed 2292 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 417 transition count 519
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 319 transition count 519
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 197 place count 319 transition count 501
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 241 place count 293 transition count 501
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 527 place count 150 transition count 358
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 599 place count 150 transition count 286
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 613 place count 143 transition count 287
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 620 place count 143 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 626 place count 143 transition count 274
Free-agglomeration rule applied 71 times.
Iterating global reduction 4 with 71 rules applied. Total rules applied 697 place count 143 transition count 203
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 4 with 71 rules applied. Total rules applied 768 place count 72 transition count 203
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 776 place count 72 transition count 203
Applied a total of 776 rules in 27 ms. Remains 72 /488 variables (removed 416) and now considering 203/2909 (removed 2706) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 203 rows 72 cols
[2024-05-24 04:33:43] [INFO ] Computed 20 invariants in 1 ms
[2024-05-24 04:33:43] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-05-24 04:33:43] [INFO ] [Real]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:33:43] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 04:33:43] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-05-24 04:33:43] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:33:43] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 04:33:43] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 04:33:43] [INFO ] After 33ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-24 04:33:43] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-24 04:33:43] [INFO ] After 254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 348 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p2 p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (G (OR p2 p0 p1)), (G (OR p2 (NOT p0) (NOT p1))), (G (OR (NOT p2) p0 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p1))), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (OR p0 (NOT p1))))), (F (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 20 factoid took 386 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Support contains 2 out of 819 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 : 819/819 places, 3240/3240 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 819 transition count 3231
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 810 transition count 3231
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 18 place count 810 transition count 2981
Deduced a syphon composed of 250 places in 3 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 518 place count 560 transition count 2981
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 662 place count 488 transition count 2909
Applied a total of 662 rules in 179 ms. Remains 488 /819 variables (removed 331) and now considering 2909/3240 (removed 331) transitions.
[2024-05-24 04:33:44] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
// Phase 1: matrix 830 rows 488 cols
[2024-05-24 04:33:44] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 04:33:45] [INFO ] Implicit Places using invariants in 899 ms returned []
[2024-05-24 04:33:45] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 04:33:45] [INFO ] Invariant cache hit.
[2024-05-24 04:33:45] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:33:49] [INFO ] Implicit Places using invariants and state equation in 4070 ms returned []
Implicit Place search using SMT with State Equation took 4974 ms to find 0 implicit places.
[2024-05-24 04:33:49] [INFO ] Redundant transitions in 103 ms returned []
Running 2900 sub problems to find dead transitions.
[2024-05-24 04:33:49] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 04:33:49] [INFO ] Invariant cache hit.
[2024-05-24 04:33:49] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2900 unsolved
SMT process timed out in 32495ms, After SMT, problems are : Problem set: 0 solved, 2900 unsolved
Search for dead transitions found 0 dead transitions in 32524ms
Starting structural reductions in SI_LTL mode, iteration 1 : 488/819 places, 2909/3240 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37790 ms. Remains : 488/819 places, 2909/3240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 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 45 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 334620 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 1
Probabilistic random walk after 334620 steps, saw 212046 distinct states, run finished after 3004 ms. (steps per millisecond=111 ) properties seen :0
[2024-05-24 04:34:25] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 04:34:25] [INFO ] Invariant cache hit.
[2024-05-24 04:34:25] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/97 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/108 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 186/294 variables, 108/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 10/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 121/415 variables, 9/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/415 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/415 variables, 22/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/415 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 168/583 variables, 77/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/583 variables, 32/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/583 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 280/863 variables, 14/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/863 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 14/877 variables, 7/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/877 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 441/1318 variables, 294/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1318 variables, 292/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1318 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1318 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1318/1318 variables, and 872 constraints, problems are : Problem set: 0 solved, 1 unsolved in 553 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 356/356 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) 52/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/97 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:34:25] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 11/108 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 186/294 variables, 108/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 10/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/294 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 121/415 variables, 9/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/415 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/415 variables, 22/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/415 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 168/583 variables, 77/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/583 variables, 32/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/583 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 280/863 variables, 14/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/863 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 14/877 variables, 7/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/877 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 441/1318 variables, 294/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1318 variables, 292/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1318 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1318 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1318/1318 variables, and 874 constraints, problems are : Problem set: 0 solved, 1 unsolved in 730 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1306ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 115 ms.
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 488 transition count 2908
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 487 transition count 2908
Applied a total of 2 rules in 114 ms. Remains 487 /488 variables (removed 1) and now considering 2908/2909 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 487/488 places, 2908/2909 transitions.
RANDOM walk for 40000 steps (8 resets) in 157 ms. (253 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 334770 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :0 out of 1
Probabilistic random walk after 334770 steps, saw 211760 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
[2024-05-24 04:34:29] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2024-05-24 04:34:29] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 04:34:29] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/96 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/107 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 185/292 variables, 107/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 10/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 121/413 variables, 9/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 22/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 168/581 variables, 77/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/581 variables, 32/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/581 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 280/861 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/861 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 14/875 variables, 7/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/875 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 441/1316 variables, 294/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1316 variables, 292/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1316 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1316 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1316/1316 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 579 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 356/356 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) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/96 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:34:30] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 11/107 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 185/292 variables, 107/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 10/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 121/413 variables, 9/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 22/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/413 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 168/581 variables, 77/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/581 variables, 32/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/581 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 280/861 variables, 14/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/861 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 14/875 variables, 7/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/875 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 441/1316 variables, 294/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1316 variables, 292/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:34:31] [INFO ] Deduced a trap composed of 3 places in 250 ms of which 3 ms to minimize.
[2024-05-24 04:34:31] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 2 ms to minimize.
[2024-05-24 04:34:31] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 2 ms to minimize.
[2024-05-24 04:34:31] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1316 variables, 4/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1316 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1316 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1316/1316 variables, and 877 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1470 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 2077ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 93 ms.
Support contains 2 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 104 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 487/487 places, 2908/2908 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 104 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
[2024-05-24 04:34:32] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 04:34:32] [INFO ] Invariant cache hit.
[2024-05-24 04:34:32] [INFO ] Implicit Places using invariants in 758 ms returned []
[2024-05-24 04:34:32] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 04:34:32] [INFO ] Invariant cache hit.
[2024-05-24 04:34:33] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:34:36] [INFO ] Implicit Places using invariants and state equation in 3865 ms returned []
Implicit Place search using SMT with State Equation took 4628 ms to find 0 implicit places.
[2024-05-24 04:34:36] [INFO ] Redundant transitions in 102 ms returned []
Running 2899 sub problems to find dead transitions.
[2024-05-24 04:34:36] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 04:34:36] [INFO ] Invariant cache hit.
[2024-05-24 04:34:36] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2899 unsolved
SMT process timed out in 32792ms, After SMT, problems are : Problem set: 0 solved, 2899 unsolved
Search for dead transitions found 0 dead transitions in 32822ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37666 ms. Remains : 487/487 places, 2908/2908 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2724 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 415 transition count 515
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 317 transition count 515
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 317 transition count 496
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 289 transition count 496
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 146 transition count 353
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 146 transition count 281
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 618 place count 138 transition count 281
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 626 place count 138 transition count 273
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 634 place count 138 transition count 265
Free-agglomeration rule applied 71 times.
Iterating global reduction 4 with 71 rules applied. Total rules applied 705 place count 138 transition count 194
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 4 with 71 rules applied. Total rules applied 776 place count 67 transition count 194
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 784 place count 67 transition count 194
Applied a total of 784 rules in 27 ms. Remains 67 /487 variables (removed 420) and now considering 194/2908 (removed 2714) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 194 rows 67 cols
[2024-05-24 04:35:09] [INFO ] Computed 19 invariants in 1 ms
[2024-05-24 04:35:09] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:35:09] [INFO ] [Nat]Absence check using 19 positive place invariants in 5 ms returned sat
[2024-05-24 04:35:09] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:35:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 04:35:09] [INFO ] After 14ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 04:35:09] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 04:35:09] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 217 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 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 48 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 336 ms.
Product exploration explored 100000 steps with 0 reset in 395 ms.
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 488 transition count 2908
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 487 transition count 2908
Applied a total of 2 rules in 136 ms. Remains 487 /488 variables (removed 1) and now considering 2908/2909 (removed 1) transitions.
[2024-05-24 04:35:10] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2024-05-24 04:35:10] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 04:35:11] [INFO ] Implicit Places using invariants in 953 ms returned []
[2024-05-24 04:35:11] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 04:35:11] [INFO ] Invariant cache hit.
[2024-05-24 04:35:12] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:35:15] [INFO ] Implicit Places using invariants and state equation in 3927 ms returned []
Implicit Place search using SMT with State Equation took 4889 ms to find 0 implicit places.
[2024-05-24 04:35:15] [INFO ] Redundant transitions in 100 ms returned []
Running 2899 sub problems to find dead transitions.
[2024-05-24 04:35:15] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 04:35:15] [INFO ] Invariant cache hit.
[2024-05-24 04:35:15] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2899 unsolved
SMT process timed out in 32542ms, After SMT, problems are : Problem set: 0 solved, 2899 unsolved
Search for dead transitions found 0 dead transitions in 32579ms
Starting structural reductions in SI_LTL mode, iteration 1 : 487/488 places, 2908/2909 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37714 ms. Remains : 487/488 places, 2908/2909 transitions.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-11 finished in 226025 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(X(F(p1)))))))'
Support contains 5 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 820 transition count 3249
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 820 transition count 3249
Applied a total of 6 rules in 40 ms. Remains 820 /823 variables (removed 3) and now considering 3249/3276 (removed 27) transitions.
[2024-05-24 04:35:48] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
// Phase 1: matrix 1170 rows 820 cols
[2024-05-24 04:35:48] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 04:35:49] [INFO ] Implicit Places using invariants in 949 ms returned []
[2024-05-24 04:35:49] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 04:35:49] [INFO ] Invariant cache hit.
[2024-05-24 04:35:50] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 04:35:58] [INFO ] Implicit Places using invariants and state equation in 8499 ms returned []
Implicit Place search using SMT with State Equation took 9450 ms to find 0 implicit places.
Running 3240 sub problems to find dead transitions.
[2024-05-24 04:35:58] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 04:35:58] [INFO ] Invariant cache hit.
[2024-05-24 04:35:58] [INFO ] State equation strengthened by 364 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 1.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.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 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 0.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3240 unsolved
SMT process timed out in 32810ms, After SMT, problems are : Problem set: 0 solved, 3240 unsolved
Search for dead transitions found 0 dead transitions in 32843ms
Starting structural reductions in LTL mode, iteration 1 : 820/823 places, 3249/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42336 ms. Remains : 820/823 places, 3249/3276 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-13
Product exploration explored 100000 steps with 25000 reset in 768 ms.
Product exploration explored 100000 steps with 25000 reset in 873 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 1093 ms. (36 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 2/2 properties
[2024-05-24 04:36:33] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 04:36:33] [INFO ] Invariant cache hit.
[2024-05-24 04:36:33] [INFO ] State equation strengthened by 364 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 241/246 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/274 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/280 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 492/772 variables, 280/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/772 variables, 65/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/772 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/916 variables, 66/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/916 variables, 28/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/916 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 462/1378 variables, 12/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1378 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/1390 variables, 6/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1390 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 600/1990 variables, 474/941 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1990 variables, 271/1212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1990 variables, 0/1212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1990 variables, 0/1212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1990/1990 variables, and 1212 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1096 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 820/820 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 241/246 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/274 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/280 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:36:34] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 492/772 variables, 280/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/772 variables, 65/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/772 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 144/916 variables, 66/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/916 variables, 28/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/916 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 462/1378 variables, 12/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1378 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/1390 variables, 6/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1390 variables, 2/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:36:35] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1390 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1390 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 600/1990 variables, 474/945 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1990 variables, 271/1216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:36:36] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1990 variables, 1/1217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1990 variables, 0/1217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/1990 variables, 0/1217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1990/1990 variables, and 1217 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1971 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 820/820 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 3099ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 521 ms.
Support contains 5 out of 820 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 820 transition count 3240
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 811 transition count 3240
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 811 transition count 2988
Deduced a syphon composed of 252 places in 3 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 559 transition count 2988
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 666 place count 487 transition count 2916
Applied a total of 666 rules in 172 ms. Remains 487 /820 variables (removed 333) and now considering 2916/3249 (removed 333) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 487/820 places, 2916/3249 transitions.
RANDOM walk for 40000 steps (8 resets) in 1058 ms. (37 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 176840 steps, run timeout after 3002 ms. (steps per millisecond=58 ) properties seen :0 out of 2
Probabilistic random walk after 176840 steps, saw 117397 distinct states, run finished after 3003 ms. (steps per millisecond=58 ) properties seen :0
[2024-05-24 04:36:40] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-05-24 04:36:40] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 04:36:40] [INFO ] State equation strengthened by 364 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/163 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 381/550 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 65/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/694 variables, 66/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/694 variables, 33/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/694 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 240/934 variables, 12/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/934 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/946 variables, 6/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/946 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 378/1324 variables, 252/613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1324 variables, 266/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 879 constraints, problems are : Problem set: 0 solved, 2 unsolved in 688 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/163 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 381/550 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 65/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:36:41] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/550 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 144/694 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/694 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/694 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 240/934 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/934 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/946 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/946 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:36:42] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 3 ms to minimize.
[2024-05-24 04:36:42] [INFO ] Deduced a trap composed of 37 places in 344 ms of which 3 ms to minimize.
[2024-05-24 04:36:42] [INFO ] Deduced a trap composed of 3 places in 346 ms of which 3 ms to minimize.
[2024-05-24 04:36:43] [INFO ] Deduced a trap composed of 3 places in 275 ms of which 2 ms to minimize.
[2024-05-24 04:36:43] [INFO ] Deduced a trap composed of 27 places in 283 ms of which 3 ms to minimize.
[2024-05-24 04:36:43] [INFO ] Deduced a trap composed of 3 places in 307 ms of which 3 ms to minimize.
[2024-05-24 04:36:43] [INFO ] Deduced a trap composed of 34 places in 240 ms of which 2 ms to minimize.
[2024-05-24 04:36:44] [INFO ] Deduced a trap composed of 35 places in 256 ms of which 2 ms to minimize.
[2024-05-24 04:36:44] [INFO ] Deduced a trap composed of 31 places in 247 ms of which 3 ms to minimize.
[2024-05-24 04:36:44] [INFO ] Deduced a trap composed of 3 places in 252 ms of which 3 ms to minimize.
[2024-05-24 04:36:45] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 2 ms to minimize.
[2024-05-24 04:36:45] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/946 variables, 12/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/946 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 378/1324 variables, 252/628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1324 variables, 266/894 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1324 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1324 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 894 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4432 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 13/13 constraints]
After SMT, in 5146ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 575 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 104 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 487/487 places, 2916/2916 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 111 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 04:36:46] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:36:46] [INFO ] Invariant cache hit.
[2024-05-24 04:36:47] [INFO ] Implicit Places using invariants in 898 ms returned []
[2024-05-24 04:36:47] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:36:47] [INFO ] Invariant cache hit.
[2024-05-24 04:36:47] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 04:36:51] [INFO ] Implicit Places using invariants and state equation in 3804 ms returned []
Implicit Place search using SMT with State Equation took 4705 ms to find 0 implicit places.
[2024-05-24 04:36:51] [INFO ] Redundant transitions in 105 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-05-24 04:36:51] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:36:51] [INFO ] Invariant cache hit.
[2024-05-24 04:36:51] [INFO ] State equation strengthened by 364 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.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 1.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 1.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 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 32348ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32379ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37311 ms. Remains : 487/487 places, 2916/2916 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2700 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 277 transitions
Ensure Unique test removed 2024 transitions
Reduce isomorphic transitions removed 2301 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 415 transition count 518
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 318 transition count 518
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 195 place count 318 transition count 500
Deduced a syphon composed of 18 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 239 place count 292 transition count 500
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 525 place count 149 transition count 357
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 595 place count 149 transition count 287
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 609 place count 142 transition count 287
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 616 place count 142 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 625 place count 142 transition count 271
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 699 place count 142 transition count 197
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 773 place count 68 transition count 197
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 782 place count 68 transition count 197
Applied a total of 782 rules in 28 ms. Remains 68 /487 variables (removed 419) and now considering 197/2916 (removed 2719) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 197 rows 68 cols
[2024-05-24 04:37:23] [INFO ] Computed 20 invariants in 1 ms
[2024-05-24 04:37:23] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 04:37:23] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-05-24 04:37:23] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:37:23] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 04:37:23] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-24 04:37:23] [INFO ] After 25ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 04:37:23] [INFO ] After 56ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 04:37:23] [INFO ] After 212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 292 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 820 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Applied a total of 0 rules in 20 ms. Remains 820 /820 variables (removed 0) and now considering 3249/3249 (removed 0) transitions.
[2024-05-24 04:37:24] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
// Phase 1: matrix 1170 rows 820 cols
[2024-05-24 04:37:24] [INFO ] Computed 28 invariants in 4 ms
[2024-05-24 04:37:25] [INFO ] Implicit Places using invariants in 1033 ms returned []
[2024-05-24 04:37:25] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 04:37:25] [INFO ] Invariant cache hit.
[2024-05-24 04:37:26] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 04:37:33] [INFO ] Implicit Places using invariants and state equation in 8474 ms returned []
Implicit Place search using SMT with State Equation took 9509 ms to find 0 implicit places.
Running 3240 sub problems to find dead transitions.
[2024-05-24 04:37:33] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 04:37:33] [INFO ] Invariant cache hit.
[2024-05-24 04:37:33] [INFO ] State equation strengthened by 364 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.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 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 0.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3240 unsolved
SMT process timed out in 32826ms, After SMT, problems are : Problem set: 0 solved, 3240 unsolved
Search for dead transitions found 0 dead transitions in 32860ms
Finished structural reductions in LTL mode , in 1 iterations and 42393 ms. Remains : 820/820 places, 3249/3249 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 950 ms. (42 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
[2024-05-24 04:38:07] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 04:38:07] [INFO ] Invariant cache hit.
[2024-05-24 04:38:07] [INFO ] State equation strengthened by 364 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 241/246 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/274 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/280 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 492/772 variables, 280/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/772 variables, 65/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/772 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/916 variables, 66/421 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/916 variables, 28/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/916 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 462/1378 variables, 12/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1378 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/1390 variables, 6/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1390 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 600/1990 variables, 474/941 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1990 variables, 271/1212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1990 variables, 0/1212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1990 variables, 0/1212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1990/1990 variables, and 1212 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1061 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 820/820 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 241/246 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/246 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 28/274 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/280 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:38:08] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 492/772 variables, 280/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/772 variables, 65/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/772 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 144/916 variables, 66/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/916 variables, 28/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/916 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 462/1378 variables, 12/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1378 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/1390 variables, 6/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1390 variables, 2/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:38:09] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1390 variables, 1/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1390 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 600/1990 variables, 474/945 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1990 variables, 271/1216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:38:09] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1990 variables, 1/1217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1990 variables, 0/1217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/1990 variables, 0/1217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1990/1990 variables, and 1217 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1934 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 820/820 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 3019ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 497 ms.
Support contains 5 out of 820 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 820 transition count 3240
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 811 transition count 3240
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 811 transition count 2988
Deduced a syphon composed of 252 places in 3 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 559 transition count 2988
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 666 place count 487 transition count 2916
Applied a total of 666 rules in 169 ms. Remains 487 /820 variables (removed 333) and now considering 2916/3249 (removed 333) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 487/820 places, 2916/3249 transitions.
RANDOM walk for 40000 steps (8 resets) in 896 ms. (44 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 167720 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 2
Probabilistic random walk after 167720 steps, saw 112181 distinct states, run finished after 3004 ms. (steps per millisecond=55 ) properties seen :0
[2024-05-24 04:38:14] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-05-24 04:38:14] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 04:38:14] [INFO ] State equation strengthened by 364 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/163 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 381/550 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 65/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/694 variables, 66/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/694 variables, 33/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/694 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 240/934 variables, 12/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/934 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/946 variables, 6/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/946 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 378/1324 variables, 252/613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1324 variables, 266/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 879 constraints, problems are : Problem set: 0 solved, 2 unsolved in 677 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/163 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 381/550 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 65/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:38:15] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/550 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 144/694 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/694 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/694 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 240/934 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/934 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/946 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/946 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:38:15] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 3 ms to minimize.
[2024-05-24 04:38:16] [INFO ] Deduced a trap composed of 37 places in 343 ms of which 4 ms to minimize.
[2024-05-24 04:38:16] [INFO ] Deduced a trap composed of 3 places in 286 ms of which 3 ms to minimize.
[2024-05-24 04:38:16] [INFO ] Deduced a trap composed of 3 places in 302 ms of which 2 ms to minimize.
[2024-05-24 04:38:17] [INFO ] Deduced a trap composed of 27 places in 272 ms of which 2 ms to minimize.
[2024-05-24 04:38:17] [INFO ] Deduced a trap composed of 3 places in 307 ms of which 2 ms to minimize.
[2024-05-24 04:38:17] [INFO ] Deduced a trap composed of 34 places in 241 ms of which 2 ms to minimize.
[2024-05-24 04:38:18] [INFO ] Deduced a trap composed of 35 places in 259 ms of which 2 ms to minimize.
[2024-05-24 04:38:18] [INFO ] Deduced a trap composed of 31 places in 255 ms of which 2 ms to minimize.
[2024-05-24 04:38:18] [INFO ] Deduced a trap composed of 3 places in 260 ms of which 3 ms to minimize.
[2024-05-24 04:38:18] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 2 ms to minimize.
[2024-05-24 04:38:19] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/946 variables, 12/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/946 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 378/1324 variables, 252/628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1324 variables, 266/894 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1324 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1324 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 894 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4415 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 13/13 constraints]
After SMT, in 5115ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 580 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 102 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 487/487 places, 2916/2916 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 104 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 04:38:20] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:38:20] [INFO ] Invariant cache hit.
[2024-05-24 04:38:21] [INFO ] Implicit Places using invariants in 918 ms returned []
[2024-05-24 04:38:21] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:38:21] [INFO ] Invariant cache hit.
[2024-05-24 04:38:21] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 04:38:25] [INFO ] Implicit Places using invariants and state equation in 3775 ms returned []
Implicit Place search using SMT with State Equation took 4694 ms to find 0 implicit places.
[2024-05-24 04:38:25] [INFO ] Redundant transitions in 113 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-05-24 04:38:25] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:38:25] [INFO ] Invariant cache hit.
[2024-05-24 04:38:25] [INFO ] State equation strengthened by 364 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 32788ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32819ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37744 ms. Remains : 487/487 places, 2916/2916 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2700 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 277 transitions
Ensure Unique test removed 2024 transitions
Reduce isomorphic transitions removed 2301 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 415 transition count 518
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 318 transition count 518
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 195 place count 318 transition count 500
Deduced a syphon composed of 18 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 239 place count 292 transition count 500
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 525 place count 149 transition count 357
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 595 place count 149 transition count 287
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 609 place count 142 transition count 287
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 616 place count 142 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 625 place count 142 transition count 271
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 699 place count 142 transition count 197
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 773 place count 68 transition count 197
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 782 place count 68 transition count 197
Applied a total of 782 rules in 34 ms. Remains 68 /487 variables (removed 419) and now considering 197/2916 (removed 2719) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 197 rows 68 cols
[2024-05-24 04:38:58] [INFO ] Computed 20 invariants in 0 ms
[2024-05-24 04:38:58] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 04:38:58] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-24 04:38:58] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 04:38:58] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 04:38:58] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-24 04:38:58] [INFO ] After 28ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 04:38:58] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 04:38:58] [INFO ] After 233ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 371 ms.
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 766 ms.
Product exploration explored 100000 steps with 25000 reset in 783 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 820 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 820 transition count 3249
Performed 243 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 243 Pre rules applied. Total rules applied 9 place count 820 transition count 3663
Deduced a syphon composed of 252 places in 3 ms
Iterating global reduction 1 with 243 rules applied. Total rules applied 252 place count 820 transition count 3663
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 333 places in 3 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 333 place count 820 transition count 3663
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 342 place count 811 transition count 3654
Deduced a syphon composed of 324 places in 3 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 351 place count 811 transition count 3654
Deduced a syphon composed of 324 places in 3 ms
Applied a total of 351 rules in 354 ms. Remains 811 /820 variables (removed 9) and now considering 3654/3249 (removed -405) transitions.
[2024-05-24 04:39:01] [INFO ] Redundant transitions in 163 ms returned []
Running 3645 sub problems to find dead transitions.
[2024-05-24 04:39:01] [INFO ] Flow matrix only has 1368 transitions (discarded 2286 similar events)
// Phase 1: matrix 1368 rows 811 cols
[2024-05-24 04:39:01] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 04:39:01] [INFO ] State equation strengthened by 597 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/811 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3645 unsolved
SMT process timed out in 33400ms, After SMT, problems are : Problem set: 0 solved, 3645 unsolved
Search for dead transitions found 0 dead transitions in 33437ms
Starting structural reductions in SI_LTL mode, iteration 1 : 811/820 places, 3654/3249 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33964 ms. Remains : 811/820 places, 3654/3249 transitions.
Support contains 5 out of 820 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 820/820 places, 3249/3249 transitions.
Applied a total of 0 rules in 24 ms. Remains 820 /820 variables (removed 0) and now considering 3249/3249 (removed 0) transitions.
[2024-05-24 04:39:34] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
// Phase 1: matrix 1170 rows 820 cols
[2024-05-24 04:39:34] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 04:39:35] [INFO ] Implicit Places using invariants in 1009 ms returned []
[2024-05-24 04:39:35] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 04:39:35] [INFO ] Invariant cache hit.
[2024-05-24 04:39:36] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 04:39:44] [INFO ] Implicit Places using invariants and state equation in 8396 ms returned []
Implicit Place search using SMT with State Equation took 9406 ms to find 0 implicit places.
Running 3240 sub problems to find dead transitions.
[2024-05-24 04:39:44] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 04:39:44] [INFO ] Invariant cache hit.
[2024-05-24 04:39:44] [INFO ] State equation strengthened by 364 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3240 unsolved
SMT process timed out in 32720ms, After SMT, problems are : Problem set: 0 solved, 3240 unsolved
Search for dead transitions found 0 dead transitions in 32754ms
Finished structural reductions in LTL mode , in 1 iterations and 42187 ms. Remains : 820/820 places, 3249/3249 transitions.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-13 finished in 268619 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||F((F(p2)&&p1))))'
Support contains 7 out of 823 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 820 transition count 3249
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 820 transition count 3249
Applied a total of 6 rules in 41 ms. Remains 820 /823 variables (removed 3) and now considering 3249/3276 (removed 27) transitions.
[2024-05-24 04:40:17] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
// Phase 1: matrix 1170 rows 820 cols
[2024-05-24 04:40:17] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 04:40:18] [INFO ] Implicit Places using invariants in 1036 ms returned []
[2024-05-24 04:40:18] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 04:40:18] [INFO ] Invariant cache hit.
[2024-05-24 04:40:18] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 04:40:26] [INFO ] Implicit Places using invariants and state equation in 8239 ms returned []
Implicit Place search using SMT with State Equation took 9277 ms to find 0 implicit places.
Running 3240 sub problems to find dead transitions.
[2024-05-24 04:40:26] [INFO ] Flow matrix only has 1170 transitions (discarded 2079 similar events)
[2024-05-24 04:40:26] [INFO ] Invariant cache hit.
[2024-05-24 04:40:26] [INFO ] State equation strengthened by 364 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/820 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3240 unsolved
SMT process timed out in 32698ms, After SMT, problems are : Problem set: 0 solved, 3240 unsolved
Search for dead transitions found 0 dead transitions in 32731ms
Starting structural reductions in LTL mode, iteration 1 : 820/823 places, 3249/3276 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42052 ms. Remains : 820/823 places, 3249/3276 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-14
Product exploration explored 100000 steps with 25 reset in 324 ms.
Stack based approach found an accepted trace after 74 steps with 0 reset with depth 75 and stack size 75 in 1 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-14 finished in 42528 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(X(F(X(F(X(F(p1)))))) U p2))))'
Support contains 5 out of 823 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 : 823/823 places, 3276/3276 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 814 transition count 3015
Deduced a syphon composed of 252 places in 3 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 562 transition count 3015
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 526 place count 558 transition count 2979
Iterating global reduction 2 with 4 rules applied. Total rules applied 530 place count 558 transition count 2979
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 674 place count 486 transition count 2907
Applied a total of 674 rules in 212 ms. Remains 486 /823 variables (removed 337) and now considering 2907/3276 (removed 369) transitions.
[2024-05-24 04:40:59] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2024-05-24 04:40:59] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 04:41:00] [INFO ] Implicit Places using invariants in 928 ms returned []
[2024-05-24 04:41:00] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:41:00] [INFO ] Invariant cache hit.
[2024-05-24 04:41:01] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:41:04] [INFO ] Implicit Places using invariants and state equation in 3779 ms returned []
Implicit Place search using SMT with State Equation took 4709 ms to find 0 implicit places.
[2024-05-24 04:41:04] [INFO ] Redundant transitions in 114 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-05-24 04:41:04] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2024-05-24 04:41:04] [INFO ] Invariant cache hit.
[2024-05-24 04:41:04] [INFO ] State equation strengthened by 356 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
SMT process timed out in 32718ms, After SMT, problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 32748ms
Starting structural reductions in SI_LTL mode, iteration 1 : 486/823 places, 2907/3276 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37792 ms. Remains : 486/823 places, 2907/3276 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-15
Product exploration explored 100000 steps with 131 reset in 369 ms.
Stack based approach found an accepted trace after 33 steps with 0 reset with depth 34 and stack size 34 in 0 ms.
FORMULA EisenbergMcGuire-PT-09-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-15 finished in 38224 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p1)||p0))))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-09-LTLFireability-06
Stuttering acceptance computed with spot in 118 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 823 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 814 transition count 3015
Deduced a syphon composed of 252 places in 3 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 562 transition count 3015
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 525 place count 559 transition count 2988
Iterating global reduction 2 with 3 rules applied. Total rules applied 528 place count 559 transition count 2988
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 672 place count 487 transition count 2916
Applied a total of 672 rules in 127 ms. Remains 487 /823 variables (removed 336) and now considering 2916/3276 (removed 360) transitions.
[2024-05-24 04:41:38] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-05-24 04:41:38] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 04:41:39] [INFO ] Implicit Places using invariants in 856 ms returned []
[2024-05-24 04:41:39] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:41:39] [INFO ] Invariant cache hit.
[2024-05-24 04:41:39] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 04:41:43] [INFO ] Implicit Places using invariants and state equation in 4109 ms returned []
Implicit Place search using SMT with State Equation took 4980 ms to find 0 implicit places.
Running 2907 sub problems to find dead transitions.
[2024-05-24 04:41:43] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:41:43] [INFO ] Invariant cache hit.
[2024-05-24 04:41:43] [INFO ] State equation strengthened by 364 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 1.0)
(s34 0.0)
(s35 1.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 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 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 1.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 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 32649ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32679ms
Starting structural reductions in LI_LTL mode, iteration 1 : 487/823 places, 2916/3276 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 37789 ms. Remains : 487/823 places, 2916/3276 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 327 ms.
Product exploration explored 100000 steps with 0 reset in 452 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 105 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 1331 ms. (30 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 183 ms. (217 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 108280 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 4
Probabilistic random walk after 108280 steps, saw 74811 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
[2024-05-24 04:42:20] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:42:20] [INFO ] Invariant cache hit.
[2024-05-24 04:42:20] [INFO ] State equation strengthened by 364 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 107/112 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 305/421 variables, 116/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 40/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 168/589 variables, 77/240 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 32/272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 280/869 variables, 14/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/869 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 14/883 variables, 7/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/883 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 441/1324 variables, 294/587 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1324 variables, 292/879 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 879 constraints, problems are : Problem set: 0 solved, 4 unsolved in 894 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 107/112 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 305/421 variables, 116/123 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 40/163 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 168/589 variables, 77/240 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 32/272 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 0/272 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 280/869 variables, 14/286 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/869 variables, 0/286 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 14/883 variables, 7/293 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/883 variables, 3/296 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-24 04:42:22] [INFO ] Deduced a trap composed of 3 places in 349 ms of which 3 ms to minimize.
[2024-05-24 04:42:23] [INFO ] Deduced a trap composed of 3 places in 344 ms of which 4 ms to minimize.
[2024-05-24 04:42:23] [INFO ] Deduced a trap composed of 3 places in 261 ms of which 3 ms to minimize.
[2024-05-24 04:42:23] [INFO ] Deduced a trap composed of 3 places in 206 ms of which 2 ms to minimize.
[2024-05-24 04:42:23] [INFO ] Deduced a trap composed of 27 places in 205 ms of which 2 ms to minimize.
[2024-05-24 04:42:23] [INFO ] Deduced a trap composed of 27 places in 186 ms of which 3 ms to minimize.
[2024-05-24 04:42:24] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 1 ms to minimize.
[2024-05-24 04:42:24] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 1 ms to minimize.
[2024-05-24 04:42:24] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 2 ms to minimize.
[2024-05-24 04:42:24] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 2 ms to minimize.
[2024-05-24 04:42:24] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2024-05-24 04:42:24] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 2 ms to minimize.
[2024-05-24 04:42:24] [INFO ] Deduced a trap composed of 21 places in 157 ms of which 2 ms to minimize.
[2024-05-24 04:42:25] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 2 ms to minimize.
[2024-05-24 04:42:25] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 2 ms to minimize.
[2024-05-24 04:42:25] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 1 ms to minimize.
[2024-05-24 04:42:25] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/883 variables, 17/313 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/883 variables, 0/313 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 441/1324 variables, 294/607 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1324 variables, 292/899 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1324 variables, 0/899 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/1324 variables, 0/899 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 899 constraints, problems are : Problem set: 1 solved, 3 unsolved in 4708 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 17/17 constraints]
After SMT, in 5624ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1621 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 109 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 487/487 places, 2916/2916 transitions.
RANDOM walk for 40000 steps (8 resets) in 965 ms. (41 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 122510 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 3
Probabilistic random walk after 122510 steps, saw 83881 distinct states, run finished after 3002 ms. (steps per millisecond=40 ) properties seen :0
[2024-05-24 04:42:31] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:42:31] [INFO ] Invariant cache hit.
[2024-05-24 04:42:31] [INFO ] State equation strengthened by 364 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 107/112 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 305/421 variables, 116/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 40/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 168/589 variables, 77/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 32/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 280/869 variables, 14/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/869 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 14/883 variables, 7/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/883 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 441/1324 variables, 294/587 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1324 variables, 292/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 879 constraints, problems are : Problem set: 0 solved, 3 unsolved in 792 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 107/112 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 04:42:32] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 305/421 variables, 116/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 40/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 168/589 variables, 77/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 32/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/589 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 280/869 variables, 14/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/869 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 14/883 variables, 7/294 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/883 variables, 3/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 04:42:33] [INFO ] Deduced a trap composed of 3 places in 309 ms of which 3 ms to minimize.
[2024-05-24 04:42:33] [INFO ] Deduced a trap composed of 3 places in 230 ms of which 3 ms to minimize.
[2024-05-24 04:42:33] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 3 ms to minimize.
[2024-05-24 04:42:34] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 2 ms to minimize.
[2024-05-24 04:42:34] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 1 ms to minimize.
[2024-05-24 04:42:34] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 2 ms to minimize.
[2024-05-24 04:42:34] [INFO ] Deduced a trap composed of 63 places in 92 ms of which 1 ms to minimize.
[2024-05-24 04:42:34] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/883 variables, 8/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/883 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 441/1324 variables, 294/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1324 variables, 292/891 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1324 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/1324 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 891 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2793 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints]
After SMT, in 3613ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1072 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 127 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 487/487 places, 2916/2916 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 105 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 04:42:36] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:42:36] [INFO ] Invariant cache hit.
[2024-05-24 04:42:37] [INFO ] Implicit Places using invariants in 796 ms returned []
[2024-05-24 04:42:37] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:42:37] [INFO ] Invariant cache hit.
[2024-05-24 04:42:37] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 04:42:41] [INFO ] Implicit Places using invariants and state equation in 4054 ms returned []
Implicit Place search using SMT with State Equation took 4851 ms to find 0 implicit places.
[2024-05-24 04:42:41] [INFO ] Redundant transitions in 103 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-05-24 04:42:41] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:42:41] [INFO ] Invariant cache hit.
[2024-05-24 04:42:41] [INFO ] State equation strengthened by 364 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.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 1.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 1.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 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.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 1.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 1.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 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 32262ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32291ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37359 ms. Remains : 487/487 places, 2916/2916 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2700 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 277 transitions
Ensure Unique test removed 2024 transitions
Reduce isomorphic transitions removed 2301 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 415 transition count 518
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 318 transition count 518
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 195 place count 318 transition count 500
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 239 place count 292 transition count 500
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 525 place count 149 transition count 357
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 595 place count 149 transition count 287
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 611 place count 141 transition count 287
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 619 place count 141 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 629 place count 141 transition count 269
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 703 place count 141 transition count 195
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 777 place count 67 transition count 195
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 786 place count 67 transition count 195
Applied a total of 786 rules in 29 ms. Remains 67 /487 variables (removed 420) and now considering 195/2916 (removed 2721) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 195 rows 67 cols
[2024-05-24 04:43:13] [INFO ] Computed 20 invariants in 1 ms
[2024-05-24 04:43:13] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 04:43:14] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-05-24 04:43:14] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:43:14] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 04:43:14] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 04:43:14] [INFO ] After 36ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-24 04:43:14] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-24 04:43:14] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-05-24 04:43:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
[2024-05-24 04:43:14] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-05-24 04:43:14] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-05-24 04:43:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 55 ms
[2024-05-24 04:43:14] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-05-24 04:43:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
TRAPS : Iteration 1
[2024-05-24 04:43:14] [INFO ] After 313ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-24 04:43:14] [INFO ] After 493ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 564 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0)), (G (OR p0 p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 116 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 115 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 04:43:14] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-05-24 04:43:14] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 04:43:15] [INFO ] Implicit Places using invariants in 1006 ms returned []
[2024-05-24 04:43:15] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:43:15] [INFO ] Invariant cache hit.
[2024-05-24 04:43:16] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 04:43:19] [INFO ] Implicit Places using invariants and state equation in 4022 ms returned []
Implicit Place search using SMT with State Equation took 5029 ms to find 0 implicit places.
[2024-05-24 04:43:20] [INFO ] Redundant transitions in 103 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-05-24 04:43:20] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:43:20] [INFO ] Invariant cache hit.
[2024-05-24 04:43:20] [INFO ] State equation strengthened by 364 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.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 1.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 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.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 1.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 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 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 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 32566ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32595ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37855 ms. Remains : 487/487 places, 2916/2916 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 109 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 646 ms. (61 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 107000 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 4
Probabilistic random walk after 107000 steps, saw 74001 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
[2024-05-24 04:43:56] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:43:56] [INFO ] Invariant cache hit.
[2024-05-24 04:43:56] [INFO ] State equation strengthened by 364 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 107/112 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 305/421 variables, 116/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 40/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 168/589 variables, 77/240 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 32/272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 280/869 variables, 14/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/869 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 14/883 variables, 7/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/883 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 441/1324 variables, 294/587 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1324 variables, 292/879 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 879 constraints, problems are : Problem set: 0 solved, 4 unsolved in 996 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 107/112 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-24 04:43:57] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 305/421 variables, 116/124 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 40/164 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 0/164 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 168/589 variables, 77/241 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 32/273 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/589 variables, 0/273 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 280/869 variables, 14/287 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/869 variables, 0/287 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 14/883 variables, 7/294 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/883 variables, 3/297 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-24 04:43:58] [INFO ] Deduced a trap composed of 3 places in 212 ms of which 2 ms to minimize.
[2024-05-24 04:43:58] [INFO ] Deduced a trap composed of 3 places in 240 ms of which 3 ms to minimize.
[2024-05-24 04:43:58] [INFO ] Deduced a trap composed of 3 places in 252 ms of which 3 ms to minimize.
[2024-05-24 04:43:58] [INFO ] Deduced a trap composed of 31 places in 194 ms of which 2 ms to minimize.
[2024-05-24 04:43:59] [INFO ] Deduced a trap composed of 34 places in 202 ms of which 2 ms to minimize.
[2024-05-24 04:43:59] [INFO ] Deduced a trap composed of 3 places in 208 ms of which 2 ms to minimize.
[2024-05-24 04:43:59] [INFO ] Deduced a trap composed of 37 places in 191 ms of which 2 ms to minimize.
[2024-05-24 04:43:59] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 2 ms to minimize.
[2024-05-24 04:43:59] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 1 ms to minimize.
[2024-05-24 04:44:00] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-05-24 04:44:00] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/883 variables, 11/308 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/883 variables, 0/308 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 441/1324 variables, 294/602 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1324 variables, 292/894 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-24 04:44:00] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1324 variables, 1/895 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1324 variables, 0/895 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 0/1324 variables, 0/895 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 895 constraints, problems are : Problem set: 1 solved, 3 unsolved in 4011 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 13/13 constraints]
After SMT, in 5043ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 1451 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 122 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 487/487 places, 2916/2916 transitions.
RANDOM walk for 40000 steps (8 resets) in 952 ms. (41 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 168280 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 2
Probabilistic random walk after 168280 steps, saw 111362 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
[2024-05-24 04:44:06] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:44:06] [INFO ] Invariant cache hit.
[2024-05-24 04:44:06] [INFO ] State equation strengthened by 364 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 107/112 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 305/421 variables, 116/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 40/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 168/589 variables, 77/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 32/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 280/869 variables, 14/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/869 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 14/883 variables, 7/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/883 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 441/1324 variables, 294/587 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1324 variables, 292/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 879 constraints, problems are : Problem set: 0 solved, 2 unsolved in 682 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 107/112 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/113 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/116 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:44:07] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 305/421 variables, 116/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 40/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 168/589 variables, 77/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 32/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/589 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 280/869 variables, 14/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/869 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 14/883 variables, 7/294 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/883 variables, 2/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:44:08] [INFO ] Deduced a trap composed of 3 places in 407 ms of which 4 ms to minimize.
[2024-05-24 04:44:08] [INFO ] Deduced a trap composed of 3 places in 430 ms of which 4 ms to minimize.
[2024-05-24 04:44:08] [INFO ] Deduced a trap composed of 32 places in 438 ms of which 4 ms to minimize.
[2024-05-24 04:44:09] [INFO ] Deduced a trap composed of 6 places in 407 ms of which 3 ms to minimize.
[2024-05-24 04:44:09] [INFO ] Deduced a trap composed of 34 places in 440 ms of which 4 ms to minimize.
[2024-05-24 04:44:10] [INFO ] Deduced a trap composed of 44 places in 403 ms of which 4 ms to minimize.
[2024-05-24 04:44:10] [INFO ] Deduced a trap composed of 19 places in 430 ms of which 4 ms to minimize.
[2024-05-24 04:44:11] [INFO ] Deduced a trap composed of 31 places in 381 ms of which 3 ms to minimize.
[2024-05-24 04:44:11] [INFO ] Deduced a trap composed of 27 places in 384 ms of which 3 ms to minimize.
[2024-05-24 04:44:11] [INFO ] Deduced a trap composed of 3 places in 330 ms of which 3 ms to minimize.
[2024-05-24 04:44:12] [INFO ] Deduced a trap composed of 31 places in 280 ms of which 3 ms to minimize.
[2024-05-24 04:44:12] [INFO ] Deduced a trap composed of 35 places in 295 ms of which 3 ms to minimize.
[2024-05-24 04:44:12] [INFO ] Deduced a trap composed of 31 places in 217 ms of which 2 ms to minimize.
[2024-05-24 04:44:12] [INFO ] Deduced a trap composed of 15 places in 272 ms of which 3 ms to minimize.
[2024-05-24 04:44:13] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/883 variables, 15/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/883 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 441/1324 variables, 294/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1324 variables, 292/897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1324 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/1324 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 897 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6799 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 16/16 constraints]
After SMT, in 7509ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 663 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 120 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 487/487 places, 2916/2916 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 120 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 04:44:14] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:44:14] [INFO ] Invariant cache hit.
[2024-05-24 04:44:15] [INFO ] Implicit Places using invariants in 962 ms returned []
[2024-05-24 04:44:15] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:44:15] [INFO ] Invariant cache hit.
[2024-05-24 04:44:16] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 04:44:19] [INFO ] Implicit Places using invariants and state equation in 4123 ms returned []
Implicit Place search using SMT with State Equation took 5087 ms to find 0 implicit places.
[2024-05-24 04:44:19] [INFO ] Redundant transitions in 99 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-05-24 04:44:20] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:44:20] [INFO ] Invariant cache hit.
[2024-05-24 04:44:20] [INFO ] State equation strengthened by 364 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 32348ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32385ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37702 ms. Remains : 487/487 places, 2916/2916 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2700 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 277 transitions
Ensure Unique test removed 2024 transitions
Reduce isomorphic transitions removed 2301 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 415 transition count 518
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 318 transition count 518
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 195 place count 318 transition count 500
Deduced a syphon composed of 18 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 239 place count 292 transition count 500
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 525 place count 149 transition count 357
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 595 place count 149 transition count 287
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 611 place count 141 transition count 287
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 619 place count 141 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 629 place count 141 transition count 269
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 703 place count 141 transition count 195
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 777 place count 67 transition count 195
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 786 place count 67 transition count 195
Applied a total of 786 rules in 24 ms. Remains 67 /487 variables (removed 420) and now considering 195/2916 (removed 2721) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 195 rows 67 cols
[2024-05-24 04:44:52] [INFO ] Computed 20 invariants in 0 ms
[2024-05-24 04:44:52] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 04:44:52] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-05-24 04:44:52] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:44:52] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 04:44:52] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 04:44:52] [INFO ] After 25ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 04:44:52] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-24 04:44:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-05-24 04:44:52] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-24 04:44:52] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-24 04:44:52] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-05-24 04:44:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 83 ms
TRAPS : Iteration 1
[2024-05-24 04:44:52] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-24 04:44:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
TRAPS : Iteration 2
[2024-05-24 04:44:52] [INFO ] After 247ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 04:44:52] [INFO ] After 400ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 463 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X p0)), (G (OR p1 p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 10 factoid took 148 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 84 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 81 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 332 ms.
Product exploration explored 100000 steps with 0 reset in 385 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 111 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 04:44:54] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-05-24 04:44:54] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 04:44:55] [INFO ] Implicit Places using invariants in 941 ms returned []
[2024-05-24 04:44:55] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:44:55] [INFO ] Invariant cache hit.
[2024-05-24 04:44:55] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 04:44:59] [INFO ] Implicit Places using invariants and state equation in 4227 ms returned []
Implicit Place search using SMT with State Equation took 5173 ms to find 0 implicit places.
[2024-05-24 04:44:59] [INFO ] Redundant transitions in 104 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-05-24 04:44:59] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:44:59] [INFO ] Invariant cache hit.
[2024-05-24 04:44:59] [INFO ] State equation strengthened by 364 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 32310ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32340ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37739 ms. Remains : 487/487 places, 2916/2916 transitions.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-06 finished in 233620 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F((X(p1)||G(p2)))||p0))))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-09-LTLFireability-07
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 823 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 18 place count 814 transition count 3016
Deduced a syphon composed of 251 places in 3 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 520 place count 563 transition count 3016
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 523 place count 560 transition count 2989
Iterating global reduction 2 with 3 rules applied. Total rules applied 526 place count 560 transition count 2989
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 670 place count 488 transition count 2917
Applied a total of 670 rules in 114 ms. Remains 488 /823 variables (removed 335) and now considering 2917/3276 (removed 359) transitions.
[2024-05-24 04:45:32] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2024-05-24 04:45:32] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 04:45:33] [INFO ] Implicit Places using invariants in 907 ms returned []
[2024-05-24 04:45:33] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 04:45:33] [INFO ] Invariant cache hit.
[2024-05-24 04:45:33] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 04:45:37] [INFO ] Implicit Places using invariants and state equation in 4137 ms returned []
Implicit Place search using SMT with State Equation took 5046 ms to find 0 implicit places.
Running 2908 sub problems to find dead transitions.
[2024-05-24 04:45:37] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 04:45:37] [INFO ] Invariant cache hit.
[2024-05-24 04:45:37] [INFO ] State equation strengthened by 364 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2908 unsolved
SMT process timed out in 32244ms, After SMT, problems are : Problem set: 0 solved, 2908 unsolved
Search for dead transitions found 0 dead transitions in 32275ms
Starting structural reductions in LI_LTL mode, iteration 1 : 488/823 places, 2917/3276 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 37438 ms. Remains : 488/823 places, 2917/3276 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-07
Product exploration explored 100000 steps with 89 reset in 305 ms.
Product exploration explored 100000 steps with 90 reset in 348 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 107 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (8 resets) in 972 ms. (41 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
[2024-05-24 04:46:10] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 04:46:10] [INFO ] Invariant cache hit.
[2024-05-24 04:46:10] [INFO ] State equation strengthened by 364 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 108/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/159 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/170 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 382/552 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/696 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/696 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/696 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 240/936 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/948 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/948 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 378/1326 variables, 252/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1326 variables, 266/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1326 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1326 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1326/1326 variables, and 880 constraints, problems are : Problem set: 0 solved, 2 unsolved in 703 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 108/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/159 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/170 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 382/552 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/696 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/696 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/696 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 240/936 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/948 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/948 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:46:12] [INFO ] Deduced a trap composed of 3 places in 334 ms of which 4 ms to minimize.
[2024-05-24 04:46:12] [INFO ] Deduced a trap composed of 3 places in 267 ms of which 2 ms to minimize.
[2024-05-24 04:46:12] [INFO ] Deduced a trap composed of 3 places in 286 ms of which 3 ms to minimize.
[2024-05-24 04:46:13] [INFO ] Deduced a trap composed of 42 places in 328 ms of which 3 ms to minimize.
[2024-05-24 04:46:13] [INFO ] Deduced a trap composed of 51 places in 288 ms of which 3 ms to minimize.
[2024-05-24 04:46:13] [INFO ] Deduced a trap composed of 23 places in 333 ms of which 3 ms to minimize.
[2024-05-24 04:46:14] [INFO ] Deduced a trap composed of 40 places in 294 ms of which 3 ms to minimize.
[2024-05-24 04:46:14] [INFO ] Deduced a trap composed of 24 places in 316 ms of which 3 ms to minimize.
[2024-05-24 04:46:14] [INFO ] Deduced a trap composed of 3 places in 192 ms of which 2 ms to minimize.
[2024-05-24 04:46:15] [INFO ] Deduced a trap composed of 78 places in 242 ms of which 3 ms to minimize.
[2024-05-24 04:46:15] [INFO ] Deduced a trap composed of 53 places in 259 ms of which 2 ms to minimize.
[2024-05-24 04:46:15] [INFO ] Deduced a trap composed of 35 places in 239 ms of which 2 ms to minimize.
[2024-05-24 04:46:15] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 2 ms to minimize.
[2024-05-24 04:46:15] [INFO ] Deduced a trap composed of 30 places in 247 ms of which 3 ms to minimize.
[2024-05-24 04:46:16] [INFO ] Deduced a trap composed of 47 places in 294 ms of which 3 ms to minimize.
[2024-05-24 04:46:16] [INFO ] Deduced a trap composed of 45 places in 272 ms of which 3 ms to minimize.
SMT process timed out in 5812ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 103 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 488/488 places, 2917/2917 transitions.
RANDOM walk for 40000 steps (8 resets) in 1064 ms. (37 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 208930 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :0 out of 2
Probabilistic random walk after 208930 steps, saw 135502 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
[2024-05-24 04:46:20] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 04:46:20] [INFO ] Invariant cache hit.
[2024-05-24 04:46:20] [INFO ] State equation strengthened by 364 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 108/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/159 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/170 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 382/552 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/696 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/696 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/696 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 240/936 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/948 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/948 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 378/1326 variables, 252/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1326 variables, 266/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1326 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1326 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1326/1326 variables, and 880 constraints, problems are : Problem set: 0 solved, 2 unsolved in 706 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 108/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/159 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/170 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 382/552 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/696 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/696 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/696 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 240/936 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/948 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/948 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:46:21] [INFO ] Deduced a trap composed of 3 places in 266 ms of which 3 ms to minimize.
[2024-05-24 04:46:21] [INFO ] Deduced a trap composed of 3 places in 261 ms of which 3 ms to minimize.
[2024-05-24 04:46:22] [INFO ] Deduced a trap composed of 3 places in 282 ms of which 3 ms to minimize.
[2024-05-24 04:46:22] [INFO ] Deduced a trap composed of 42 places in 326 ms of which 3 ms to minimize.
[2024-05-24 04:46:22] [INFO ] Deduced a trap composed of 51 places in 297 ms of which 3 ms to minimize.
[2024-05-24 04:46:23] [INFO ] Deduced a trap composed of 23 places in 332 ms of which 3 ms to minimize.
[2024-05-24 04:46:23] [INFO ] Deduced a trap composed of 40 places in 321 ms of which 3 ms to minimize.
[2024-05-24 04:46:23] [INFO ] Deduced a trap composed of 24 places in 338 ms of which 3 ms to minimize.
[2024-05-24 04:46:24] [INFO ] Deduced a trap composed of 3 places in 210 ms of which 2 ms to minimize.
[2024-05-24 04:46:24] [INFO ] Deduced a trap composed of 78 places in 262 ms of which 2 ms to minimize.
[2024-05-24 04:46:24] [INFO ] Deduced a trap composed of 53 places in 256 ms of which 2 ms to minimize.
[2024-05-24 04:46:24] [INFO ] Deduced a trap composed of 35 places in 268 ms of which 3 ms to minimize.
[2024-05-24 04:46:25] [INFO ] Deduced a trap composed of 39 places in 161 ms of which 2 ms to minimize.
[2024-05-24 04:46:25] [INFO ] Deduced a trap composed of 30 places in 249 ms of which 2 ms to minimize.
[2024-05-24 04:46:25] [INFO ] Deduced a trap composed of 47 places in 280 ms of which 3 ms to minimize.
[2024-05-24 04:46:25] [INFO ] Deduced a trap composed of 45 places in 283 ms of which 3 ms to minimize.
[2024-05-24 04:46:26] [INFO ] Deduced a trap composed of 13 places in 309 ms of which 3 ms to minimize.
[2024-05-24 04:46:26] [INFO ] Deduced a trap composed of 35 places in 216 ms of which 2 ms to minimize.
[2024-05-24 04:46:26] [INFO ] Deduced a trap composed of 27 places in 198 ms of which 2 ms to minimize.
[2024-05-24 04:46:26] [INFO ] Deduced a trap composed of 34 places in 202 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/948 variables, 20/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:46:27] [INFO ] Deduced a trap composed of 21 places in 218 ms of which 2 ms to minimize.
[2024-05-24 04:46:27] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 1 ms to minimize.
[2024-05-24 04:46:27] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 2 ms to minimize.
[2024-05-24 04:46:27] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 3 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/948 variables, 4/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/948 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 378/1326 variables, 252/640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1326 variables, 266/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:46:28] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1326 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1326 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1326 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1326/1326 variables, and 907 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7791 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 25/25 constraints]
After SMT, in 8521ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 553 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 107 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 488/488 places, 2917/2917 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 109 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2024-05-24 04:46:29] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 04:46:29] [INFO ] Invariant cache hit.
[2024-05-24 04:46:30] [INFO ] Implicit Places using invariants in 1021 ms returned []
[2024-05-24 04:46:30] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 04:46:30] [INFO ] Invariant cache hit.
[2024-05-24 04:46:30] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 04:46:34] [INFO ] Implicit Places using invariants and state equation in 4127 ms returned []
Implicit Place search using SMT with State Equation took 5158 ms to find 0 implicit places.
[2024-05-24 04:46:34] [INFO ] Redundant transitions in 105 ms returned []
Running 2908 sub problems to find dead transitions.
[2024-05-24 04:46:34] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 04:46:34] [INFO ] Invariant cache hit.
[2024-05-24 04:46:34] [INFO ] State equation strengthened by 364 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.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 1.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 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.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 1.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 1.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 1.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 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)timeout

(s278 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2908 unsolved
SMT process timed out in 32252ms, After SMT, problems are : Problem set: 0 solved, 2908 unsolved
Search for dead transitions found 0 dead transitions in 32281ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37662 ms. Remains : 488/488 places, 2917/2917 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2722 edges and 488 vertex of which 80 / 488 are part of one of the 9 SCC in 1 ms
Free SCC test removed 71 places
Drop transitions (Empty/Sink Transition effects.) removed 272 transitions
Ensure Unique test removed 2027 transitions
Reduce isomorphic transitions removed 2299 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 417 transition count 520
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 319 transition count 520
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 197 place count 319 transition count 503
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 238 place count 295 transition count 503
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 526 place count 151 transition count 359
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 598 place count 151 transition count 287
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 612 place count 144 transition count 288
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 618 place count 144 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 625 place count 144 transition count 275
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 698 place count 144 transition count 202
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 771 place count 71 transition count 202
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 780 place count 71 transition count 202
Applied a total of 780 rules in 27 ms. Remains 71 /488 variables (removed 417) and now considering 202/2917 (removed 2715) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 202 rows 71 cols
[2024-05-24 04:47:06] [INFO ] Computed 21 invariants in 0 ms
[2024-05-24 04:47:06] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 04:47:07] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-05-24 04:47:07] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-24 04:47:07] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 04:47:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 04:47:07] [INFO ] After 22ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 04:47:07] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-24 04:47:07] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-05-24 04:47:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 53 ms
[2024-05-24 04:47:07] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2024-05-24 04:47:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
TRAPS : Iteration 1
[2024-05-24 04:47:07] [INFO ] After 152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 04:47:07] [INFO ] After 301ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 365 ms.
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p2) p1))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 193 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 108 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2024-05-24 04:47:07] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2024-05-24 04:47:07] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 04:47:08] [INFO ] Implicit Places using invariants in 962 ms returned []
[2024-05-24 04:47:08] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 04:47:08] [INFO ] Invariant cache hit.
[2024-05-24 04:47:09] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 04:47:12] [INFO ] Implicit Places using invariants and state equation in 4157 ms returned []
Implicit Place search using SMT with State Equation took 5124 ms to find 0 implicit places.
[2024-05-24 04:47:12] [INFO ] Redundant transitions in 99 ms returned []
Running 2908 sub problems to find dead transitions.
[2024-05-24 04:47:13] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 04:47:13] [INFO ] Invariant cache hit.
[2024-05-24 04:47:13] [INFO ] State equation strengthened by 364 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2908 unsolved
SMT process timed out in 32247ms, After SMT, problems are : Problem set: 0 solved, 2908 unsolved
Search for dead transitions found 0 dead transitions in 32277ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37618 ms. Remains : 488/488 places, 2917/2917 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 166 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (8 resets) in 986 ms. (40 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 2/2 properties
[2024-05-24 04:47:45] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 04:47:45] [INFO ] Invariant cache hit.
[2024-05-24 04:47:45] [INFO ] State equation strengthened by 364 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 108/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/159 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/170 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 382/552 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/696 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/696 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/696 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 240/936 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/948 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/948 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 378/1326 variables, 252/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1326 variables, 266/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1326 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1326 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1326/1326 variables, and 880 constraints, problems are : Problem set: 0 solved, 2 unsolved in 751 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 108/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/159 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/170 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 382/552 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/696 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/696 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/696 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 240/936 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/948 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/948 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:47:47] [INFO ] Deduced a trap composed of 3 places in 337 ms of which 4 ms to minimize.
[2024-05-24 04:47:47] [INFO ] Deduced a trap composed of 3 places in 244 ms of which 3 ms to minimize.
[2024-05-24 04:47:48] [INFO ] Deduced a trap composed of 3 places in 264 ms of which 3 ms to minimize.
[2024-05-24 04:47:48] [INFO ] Deduced a trap composed of 42 places in 304 ms of which 4 ms to minimize.
[2024-05-24 04:47:48] [INFO ] Deduced a trap composed of 51 places in 270 ms of which 2 ms to minimize.
[2024-05-24 04:47:49] [INFO ] Deduced a trap composed of 23 places in 305 ms of which 3 ms to minimize.
[2024-05-24 04:47:49] [INFO ] Deduced a trap composed of 40 places in 305 ms of which 3 ms to minimize.
[2024-05-24 04:47:49] [INFO ] Deduced a trap composed of 24 places in 319 ms of which 3 ms to minimize.
[2024-05-24 04:47:49] [INFO ] Deduced a trap composed of 3 places in 186 ms of which 2 ms to minimize.
[2024-05-24 04:47:50] [INFO ] Deduced a trap composed of 78 places in 235 ms of which 2 ms to minimize.
[2024-05-24 04:47:50] [INFO ] Deduced a trap composed of 53 places in 233 ms of which 2 ms to minimize.
[2024-05-24 04:47:50] [INFO ] Deduced a trap composed of 35 places in 221 ms of which 3 ms to minimize.
[2024-05-24 04:47:50] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 2 ms to minimize.
[2024-05-24 04:47:51] [INFO ] Deduced a trap composed of 30 places in 240 ms of which 3 ms to minimize.
[2024-05-24 04:47:51] [INFO ] Deduced a trap composed of 47 places in 276 ms of which 3 ms to minimize.
[2024-05-24 04:47:51] [INFO ] Deduced a trap composed of 45 places in 278 ms of which 3 ms to minimize.
[2024-05-24 04:47:52] [INFO ] Deduced a trap composed of 13 places in 311 ms of which 3 ms to minimize.
SMT process timed out in 6070ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 105 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 488/488 places, 2917/2917 transitions.
RANDOM walk for 40000 steps (8 resets) in 813 ms. (49 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 172080 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 2
Probabilistic random walk after 172080 steps, saw 113498 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
[2024-05-24 04:47:55] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 04:47:55] [INFO ] Invariant cache hit.
[2024-05-24 04:47:55] [INFO ] State equation strengthened by 364 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 108/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/159 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/170 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 382/552 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/696 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/696 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/696 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 240/936 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/948 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/948 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 378/1326 variables, 252/614 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1326 variables, 266/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1326 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/1326 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1326/1326 variables, and 880 constraints, problems are : Problem set: 0 solved, 2 unsolved in 701 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 108/112 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/114 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/159 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/170 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 382/552 variables, 170/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/552 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 144/696 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/696 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/696 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 240/936 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/936 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/948 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/948 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:47:56] [INFO ] Deduced a trap composed of 3 places in 329 ms of which 3 ms to minimize.
[2024-05-24 04:47:57] [INFO ] Deduced a trap composed of 3 places in 263 ms of which 3 ms to minimize.
[2024-05-24 04:47:57] [INFO ] Deduced a trap composed of 3 places in 276 ms of which 3 ms to minimize.
[2024-05-24 04:47:57] [INFO ] Deduced a trap composed of 42 places in 307 ms of which 3 ms to minimize.
[2024-05-24 04:47:58] [INFO ] Deduced a trap composed of 51 places in 278 ms of which 2 ms to minimize.
[2024-05-24 04:47:58] [INFO ] Deduced a trap composed of 23 places in 305 ms of which 3 ms to minimize.
[2024-05-24 04:47:58] [INFO ] Deduced a trap composed of 40 places in 317 ms of which 3 ms to minimize.
[2024-05-24 04:47:59] [INFO ] Deduced a trap composed of 24 places in 322 ms of which 4 ms to minimize.
[2024-05-24 04:47:59] [INFO ] Deduced a trap composed of 3 places in 204 ms of which 2 ms to minimize.
[2024-05-24 04:47:59] [INFO ] Deduced a trap composed of 78 places in 255 ms of which 3 ms to minimize.
[2024-05-24 04:47:59] [INFO ] Deduced a trap composed of 53 places in 256 ms of which 3 ms to minimize.
[2024-05-24 04:48:00] [INFO ] Deduced a trap composed of 35 places in 251 ms of which 2 ms to minimize.
[2024-05-24 04:48:00] [INFO ] Deduced a trap composed of 39 places in 159 ms of which 2 ms to minimize.
[2024-05-24 04:48:00] [INFO ] Deduced a trap composed of 30 places in 257 ms of which 3 ms to minimize.
[2024-05-24 04:48:01] [INFO ] Deduced a trap composed of 47 places in 300 ms of which 3 ms to minimize.
[2024-05-24 04:48:01] [INFO ] Deduced a trap composed of 45 places in 281 ms of which 3 ms to minimize.
[2024-05-24 04:48:01] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 3 ms to minimize.
[2024-05-24 04:48:01] [INFO ] Deduced a trap composed of 35 places in 215 ms of which 2 ms to minimize.
[2024-05-24 04:48:02] [INFO ] Deduced a trap composed of 27 places in 211 ms of which 2 ms to minimize.
[2024-05-24 04:48:02] [INFO ] Deduced a trap composed of 34 places in 218 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/948 variables, 20/384 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:48:02] [INFO ] Deduced a trap composed of 21 places in 218 ms of which 2 ms to minimize.
[2024-05-24 04:48:02] [INFO ] Deduced a trap composed of 29 places in 122 ms of which 2 ms to minimize.
[2024-05-24 04:48:02] [INFO ] Deduced a trap composed of 27 places in 174 ms of which 2 ms to minimize.
[2024-05-24 04:48:03] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/948 variables, 4/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/948 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 378/1326 variables, 252/640 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1326 variables, 266/906 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:48:03] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1326 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1326 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1326 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1326/1326 variables, and 907 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7680 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 25/25 constraints]
After SMT, in 8399ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 550 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 103 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 488/488 places, 2917/2917 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 104 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2024-05-24 04:48:04] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 04:48:04] [INFO ] Invariant cache hit.
[2024-05-24 04:48:05] [INFO ] Implicit Places using invariants in 913 ms returned []
[2024-05-24 04:48:05] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 04:48:05] [INFO ] Invariant cache hit.
[2024-05-24 04:48:05] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 04:48:09] [INFO ] Implicit Places using invariants and state equation in 4052 ms returned []
Implicit Place search using SMT with State Equation took 4971 ms to find 0 implicit places.
[2024-05-24 04:48:09] [INFO ] Redundant transitions in 115 ms returned []
Running 2908 sub problems to find dead transitions.
[2024-05-24 04:48:09] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 04:48:09] [INFO ] Invariant cache hit.
[2024-05-24 04:48:09] [INFO ] State equation strengthened by 364 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2908 unsolved
SMT process timed out in 32230ms, After SMT, problems are : Problem set: 0 solved, 2908 unsolved
Search for dead transitions found 0 dead transitions in 32260ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37460 ms. Remains : 488/488 places, 2917/2917 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2722 edges and 488 vertex of which 80 / 488 are part of one of the 9 SCC in 1 ms
Free SCC test removed 71 places
Drop transitions (Empty/Sink Transition effects.) removed 272 transitions
Ensure Unique test removed 2027 transitions
Reduce isomorphic transitions removed 2299 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 417 transition count 520
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 319 transition count 520
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 197 place count 319 transition count 503
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 238 place count 295 transition count 503
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 288 rules applied. Total rules applied 526 place count 151 transition count 359
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 598 place count 151 transition count 287
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 612 place count 144 transition count 288
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 618 place count 144 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 625 place count 144 transition count 275
Free-agglomeration rule applied 73 times.
Iterating global reduction 4 with 73 rules applied. Total rules applied 698 place count 144 transition count 202
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 4 with 73 rules applied. Total rules applied 771 place count 71 transition count 202
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 780 place count 71 transition count 202
Applied a total of 780 rules in 28 ms. Remains 71 /488 variables (removed 417) and now considering 202/2917 (removed 2715) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 202 rows 71 cols
[2024-05-24 04:48:42] [INFO ] Computed 21 invariants in 1 ms
[2024-05-24 04:48:42] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 04:48:42] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-24 04:48:42] [INFO ] [Nat]Absence check using 19 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-24 04:48:42] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 04:48:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 04:48:42] [INFO ] After 23ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 04:48:42] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-24 04:48:42] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2024-05-24 04:48:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 60 ms
[2024-05-24 04:48:42] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-24 04:48:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
TRAPS : Iteration 1
[2024-05-24 04:48:42] [INFO ] After 164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 04:48:42] [INFO ] After 323ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 394 ms.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p2) p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 228 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 89 reset in 308 ms.
Product exploration explored 100000 steps with 92 reset in 330 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 2917/2917 transitions.
Applied a total of 0 rules in 116 ms. Remains 488 /488 variables (removed 0) and now considering 2917/2917 (removed 0) transitions.
[2024-05-24 04:48:43] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
// Phase 1: matrix 838 rows 488 cols
[2024-05-24 04:48:43] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 04:48:44] [INFO ] Implicit Places using invariants in 903 ms returned []
[2024-05-24 04:48:44] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 04:48:44] [INFO ] Invariant cache hit.
[2024-05-24 04:48:44] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 04:48:48] [INFO ] Implicit Places using invariants and state equation in 4035 ms returned []
Implicit Place search using SMT with State Equation took 4946 ms to find 0 implicit places.
[2024-05-24 04:48:48] [INFO ] Redundant transitions in 105 ms returned []
Running 2908 sub problems to find dead transitions.
[2024-05-24 04:48:48] [INFO ] Flow matrix only has 838 transitions (discarded 2079 similar events)
[2024-05-24 04:48:48] [INFO ] Invariant cache hit.
[2024-05-24 04:48:48] [INFO ] State equation strengthened by 364 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2908 unsolved
SMT process timed out in 32227ms, After SMT, problems are : Problem set: 0 solved, 2908 unsolved
Search for dead transitions found 0 dead transitions in 32257ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 37432 ms. Remains : 488/488 places, 2917/2917 transitions.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-07 finished in 229210 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((!p1 U (G(!p1)||(!p1&&G(!p2))))||p0))))'
Found a Lengthening insensitive property : EisenbergMcGuire-PT-09-LTLFireability-11
Stuttering acceptance computed with spot in 212 ms :[true, (AND (NOT p0) p1), p1, (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2)), (OR p2 (AND (NOT p0) p1))]
Support contains 4 out of 823 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 18 place count 814 transition count 3017
Deduced a syphon composed of 250 places in 3 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 518 place count 564 transition count 3017
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 522 place count 560 transition count 2981
Iterating global reduction 2 with 4 rules applied. Total rules applied 526 place count 560 transition count 2981
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 3 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 670 place count 488 transition count 2909
Applied a total of 670 rules in 113 ms. Remains 488 /823 variables (removed 335) and now considering 2909/3276 (removed 367) transitions.
[2024-05-24 04:49:21] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
// Phase 1: matrix 830 rows 488 cols
[2024-05-24 04:49:21] [INFO ] Computed 28 invariants in 2 ms
[2024-05-24 04:49:22] [INFO ] Implicit Places using invariants in 967 ms returned []
[2024-05-24 04:49:22] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 04:49:22] [INFO ] Invariant cache hit.
[2024-05-24 04:49:23] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:49:26] [INFO ] Implicit Places using invariants and state equation in 4069 ms returned []
Implicit Place search using SMT with State Equation took 5042 ms to find 0 implicit places.
Running 2900 sub problems to find dead transitions.
[2024-05-24 04:49:26] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 04:49:26] [INFO ] Invariant cache hit.
[2024-05-24 04:49:26] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2900 unsolved
SMT process timed out in 32415ms, After SMT, problems are : Problem set: 0 solved, 2900 unsolved
Search for dead transitions found 0 dead transitions in 32444ms
Starting structural reductions in LI_LTL mode, iteration 1 : 488/823 places, 2909/3276 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 37602 ms. Remains : 488/823 places, 2909/3276 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 331 ms.
Product exploration explored 100000 steps with 0 reset in 403 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p2 p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p2 (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 169 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 14 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 176 ms :[true, p1, (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND p1 p2)), (OR p2 (AND (NOT p0) p1))]
RANDOM walk for 40000 steps (8 resets) in 1895 ms. (21 steps per ms) remains 7/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 322 ms. (123 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 317 ms. (125 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 313 ms. (127 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 7/7 properties
[2024-05-24 04:50:01] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 04:50:01] [INFO ] Invariant cache hit.
[2024-05-24 04:50:01] [INFO ] State equation strengthened by 356 read => feed constraints.
Problem apf2 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Problem apf7 is UNSAT
At refinement iteration 1 (OVERLAPS) 51/55 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 84/139 variables, 3/5 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 22/161 variables, 4/9 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 278/439 variables, 161/170 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 24/194 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/194 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 105/544 variables, 9/203 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/544 variables, 1/204 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/544 variables, 33/237 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/544 variables, 0/237 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 144/688 variables, 66/303 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/688 variables, 33/336 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/688 variables, 0/336 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 240/928 variables, 12/348 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/928 variables, 0/348 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 12/940 variables, 6/354 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/940 variables, 0/354 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 378/1318 variables, 252/606 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1318 variables, 266/872 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1318 variables, 0/872 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 0/1318 variables, 0/872 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1318/1318 variables, and 872 constraints, problems are : Problem set: 2 solved, 5 unsolved in 1265 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 51/55 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 84/139 variables, 3/5 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-05-24 04:50:02] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem apf4 is UNSAT
At refinement iteration 6 (OVERLAPS) 22/161 variables, 4/10 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-24 04:50:03] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 2 ms to minimize.
[2024-05-24 04:50:03] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 2/12 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/12 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 278/439 variables, 161/173 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 24/197 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/439 variables, 4/201 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/439 variables, 0/201 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 105/544 variables, 9/210 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/544 variables, 1/211 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/544 variables, 33/244 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/544 variables, 0/244 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 144/688 variables, 66/310 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/688 variables, 33/343 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/688 variables, 0/343 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 240/928 variables, 12/355 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/928 variables, 0/355 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 12/940 variables, 6/361 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/940 variables, 0/361 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 378/1318 variables, 252/613 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1318 variables, 266/879 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-05-24 04:50:04] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 2 ms to minimize.
[2024-05-24 04:50:04] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1318 variables, 2/881 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1318 variables, 0/881 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 0/1318 variables, 0/881 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1318/1318 variables, and 881 constraints, problems are : Problem set: 3 solved, 4 unsolved in 2363 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 4/7 constraints, Known Traps: 5/5 constraints]
After SMT, in 3649ms problems are : Problem set: 3 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 812 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 106 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 488/488 places, 2909/2909 transitions.
RANDOM walk for 40000 steps (8 resets) in 1561 ms. (25 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 100530 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 4
Probabilistic random walk after 100530 steps, saw 70230 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
[2024-05-24 04:50:09] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 04:50:09] [INFO ] Invariant cache hit.
[2024-05-24 04:50:09] [INFO ] State equation strengthened by 356 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) 51/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 84/139 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 22/161 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 278/439 variables, 161/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 24/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 105/544 variables, 9/203 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/544 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/544 variables, 33/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/544 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 144/688 variables, 66/303 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/688 variables, 33/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/688 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 240/928 variables, 12/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/928 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 12/940 variables, 6/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/940 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 378/1318 variables, 252/606 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1318 variables, 266/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1318 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/1318 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1318/1318 variables, and 872 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1593 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 356/356 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 51/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 84/139 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 22/161 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 278/439 variables, 161/170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/439 variables, 24/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/439 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/439 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 105/544 variables, 9/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/544 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/544 variables, 33/241 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/544 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 144/688 variables, 66/307 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/688 variables, 33/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/688 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 240/928 variables, 12/352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/928 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 12/940 variables, 6/358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/940 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 378/1318 variables, 252/610 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1318 variables, 266/876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 04:50:13] [INFO ] Deduced a trap composed of 3 places in 222 ms of which 2 ms to minimize.
[2024-05-24 04:50:13] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1318 variables, 2/878 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1318 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 0/1318 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1318/1318 variables, and 878 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2951 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 4571ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 884 ms.
Support contains 4 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 99 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 488/488 places, 2909/2909 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 99 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
[2024-05-24 04:50:15] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 04:50:15] [INFO ] Invariant cache hit.
[2024-05-24 04:50:16] [INFO ] Implicit Places using invariants in 1106 ms returned []
[2024-05-24 04:50:16] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 04:50:16] [INFO ] Invariant cache hit.
[2024-05-24 04:50:17] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:50:20] [INFO ] Implicit Places using invariants and state equation in 4312 ms returned []
Implicit Place search using SMT with State Equation took 5430 ms to find 0 implicit places.
[2024-05-24 04:50:21] [INFO ] Redundant transitions in 144 ms returned []
Running 2900 sub problems to find dead transitions.
[2024-05-24 04:50:21] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 04:50:21] [INFO ] Invariant cache hit.
[2024-05-24 04:50:21] [INFO ] State equation strengthened by 356 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2900 unsolved
SMT process timed out in 32357ms, After SMT, problems are : Problem set: 0 solved, 2900 unsolved
Search for dead transitions found 0 dead transitions in 32387ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38071 ms. Remains : 488/488 places, 2909/2909 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2721 edges and 488 vertex of which 80 / 488 are part of one of the 9 SCC in 0 ms
Free SCC test removed 71 places
Drop transitions (Empty/Sink Transition effects.) removed 275 transitions
Ensure Unique test removed 2017 transitions
Reduce isomorphic transitions removed 2292 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 417 transition count 519
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 319 transition count 519
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 197 place count 319 transition count 501
Deduced a syphon composed of 18 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 241 place count 293 transition count 501
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 527 place count 150 transition count 358
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 599 place count 150 transition count 286
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 613 place count 143 transition count 287
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 620 place count 143 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 626 place count 143 transition count 274
Free-agglomeration rule applied 71 times.
Iterating global reduction 4 with 71 rules applied. Total rules applied 697 place count 143 transition count 203
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 4 with 71 rules applied. Total rules applied 768 place count 72 transition count 203
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 776 place count 72 transition count 203
Applied a total of 776 rules in 43 ms. Remains 72 /488 variables (removed 416) and now considering 203/2909 (removed 2706) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 203 rows 72 cols
[2024-05-24 04:50:53] [INFO ] Computed 20 invariants in 1 ms
[2024-05-24 04:50:53] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-24 04:50:53] [INFO ] [Real]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:50:53] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 04:50:53] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-24 04:50:53] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:50:53] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 04:50:53] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 04:50:53] [INFO ] After 49ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-24 04:50:53] [INFO ] After 122ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-24 04:50:53] [INFO ] After 391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 530 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT p2))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p2 p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (G (OR p2 p0 p1)), (G (OR p2 (NOT p0) (NOT p1))), (G (OR (NOT p2) p0 p1))]
False Knowledge obtained : [(F (NOT (OR (NOT p2) p1))), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p2) (OR p0 (NOT p1))))), (F (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) (NOT p1)))))]
Knowledge based reduction with 20 factoid took 554 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0)]
Support contains 2 out of 488 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 : 488/488 places, 2909/2909 transitions.
Applied a total of 0 rules in 196 ms. Remains 488 /488 variables (removed 0) and now considering 2909/2909 (removed 0) transitions.
[2024-05-24 04:50:54] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
// Phase 1: matrix 830 rows 488 cols
[2024-05-24 04:50:54] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 04:50:56] [INFO ] Implicit Places using invariants in 1198 ms returned []
[2024-05-24 04:50:56] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 04:50:56] [INFO ] Invariant cache hit.
[2024-05-24 04:50:56] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:51:01] [INFO ] Implicit Places using invariants and state equation in 4930 ms returned []
Implicit Place search using SMT with State Equation took 6130 ms to find 0 implicit places.
[2024-05-24 04:51:01] [INFO ] Redundant transitions in 163 ms returned []
Running 2900 sub problems to find dead transitions.
[2024-05-24 04:51:01] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 04:51:01] [INFO ] Invariant cache hit.
[2024-05-24 04:51:01] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/488 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2900 unsolved
SMT process timed out in 32386ms, After SMT, problems are : Problem set: 0 solved, 2900 unsolved
Search for dead transitions found 0 dead transitions in 32434ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38935 ms. Remains : 488/488 places, 2909/2909 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 369450 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 1
Probabilistic random walk after 369450 steps, saw 232190 distinct states, run finished after 3004 ms. (steps per millisecond=122 ) properties seen :0
[2024-05-24 04:51:36] [INFO ] Flow matrix only has 830 transitions (discarded 2079 similar events)
[2024-05-24 04:51:36] [INFO ] Invariant cache hit.
[2024-05-24 04:51:36] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/97 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/108 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 186/294 variables, 108/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 10/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 121/415 variables, 9/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/415 variables, 1/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/415 variables, 22/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/415 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 168/583 variables, 77/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/583 variables, 32/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/583 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 280/863 variables, 14/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/863 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 14/877 variables, 7/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/877 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 441/1318 variables, 294/580 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1318 variables, 292/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1318 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1318 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1318/1318 variables, and 872 constraints, problems are : Problem set: 0 solved, 1 unsolved in 768 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 356/356 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) 52/54 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/97 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:51:37] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 11/108 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 186/294 variables, 108/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 10/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/294 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 121/415 variables, 9/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/415 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/415 variables, 22/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/415 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 168/583 variables, 77/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/583 variables, 32/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/583 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 280/863 variables, 14/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/863 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 14/877 variables, 7/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/877 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 441/1318 variables, 294/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1318 variables, 292/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1318 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1318 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1318/1318 variables, and 874 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1034 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 488/488 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1821ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 156 ms.
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 488 transition count 2908
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 487 transition count 2908
Applied a total of 2 rules in 178 ms. Remains 487 /488 variables (removed 1) and now considering 2908/2909 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 487/488 places, 2908/2909 transitions.
RANDOM walk for 40000 steps (8 resets) in 187 ms. (212 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 337450 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 1
Probabilistic random walk after 337450 steps, saw 213078 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
[2024-05-24 04:51:42] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2024-05-24 04:51:42] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 04:51:42] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/96 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/107 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 185/292 variables, 107/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 10/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 121/413 variables, 9/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 22/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 168/581 variables, 77/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/581 variables, 32/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/581 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 280/861 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/861 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 14/875 variables, 7/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/875 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 441/1316 variables, 294/579 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1316 variables, 292/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1316 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1316 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1316/1316 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 598 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 356/356 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) 51/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/96 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:51:42] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 11/107 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 185/292 variables, 107/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 10/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 121/413 variables, 9/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/413 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/413 variables, 22/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/413 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 168/581 variables, 77/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/581 variables, 32/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/581 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 280/861 variables, 14/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/861 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 14/875 variables, 7/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/875 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 441/1316 variables, 294/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1316 variables, 292/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 04:51:43] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1316 variables, 1/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1316 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1316 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1316/1316 variables, and 874 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1299 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1916ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 162 ms.
Support contains 2 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 165 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 165 ms. Remains : 487/487 places, 2908/2908 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Applied a total of 0 rules in 165 ms. Remains 487 /487 variables (removed 0) and now considering 2908/2908 (removed 0) transitions.
[2024-05-24 04:51:44] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 04:51:44] [INFO ] Invariant cache hit.
[2024-05-24 04:51:45] [INFO ] Implicit Places using invariants in 1021 ms returned []
[2024-05-24 04:51:45] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 04:51:45] [INFO ] Invariant cache hit.
[2024-05-24 04:51:46] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:51:49] [INFO ] Implicit Places using invariants and state equation in 3663 ms returned []
Implicit Place search using SMT with State Equation took 4685 ms to find 0 implicit places.
[2024-05-24 04:51:49] [INFO ] Redundant transitions in 98 ms returned []
Running 2899 sub problems to find dead transitions.
[2024-05-24 04:51:49] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 04:51:49] [INFO ] Invariant cache hit.
[2024-05-24 04:51:49] [INFO ] State equation strengthened by 356 read => feed constraints.
(s123 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 1.0)
(s12 1.0)
(s13 0.0)
(s14 1.0)
(s15 1.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 1.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 1.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 1.0)
(s34 0.0)
(s35 1.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.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2899 unsolved
SMT process timed out in 32712ms, After SMT, problems are : Problem set: 0 solved, 2899 unsolved
Search for dead transitions found 0 dead transitions in 32740ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37697 ms. Remains : 487/487 places, 2908/2908 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2724 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 415 transition count 515
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 317 transition count 515
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 317 transition count 496
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 289 transition count 496
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 1 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 146 transition count 353
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 146 transition count 281
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 618 place count 138 transition count 281
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 626 place count 138 transition count 273
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 634 place count 138 transition count 265
Free-agglomeration rule applied 71 times.
Iterating global reduction 4 with 71 rules applied. Total rules applied 705 place count 138 transition count 194
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 4 with 71 rules applied. Total rules applied 776 place count 67 transition count 194
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 784 place count 67 transition count 194
Applied a total of 784 rules in 30 ms. Remains 67 /487 variables (removed 420) and now considering 194/2908 (removed 2714) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 194 rows 67 cols
[2024-05-24 04:52:22] [INFO ] Computed 19 invariants in 1 ms
[2024-05-24 04:52:22] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 04:52:22] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-05-24 04:52:22] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 04:52:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 04:52:22] [INFO ] After 9ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 04:52:22] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 04:52:22] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 202 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 46 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 294 ms.
Product exploration explored 100000 steps with 0 reset in 341 ms.
Support contains 2 out of 488 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 488/488 places, 2909/2909 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 488 transition count 2908
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 487 transition count 2908
Applied a total of 2 rules in 115 ms. Remains 487 /488 variables (removed 1) and now considering 2908/2909 (removed 1) transitions.
[2024-05-24 04:52:23] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2024-05-24 04:52:23] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 04:52:24] [INFO ] Implicit Places using invariants in 773 ms returned []
[2024-05-24 04:52:24] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 04:52:24] [INFO ] Invariant cache hit.
[2024-05-24 04:52:24] [INFO ] State equation strengthened by 356 read => feed constraints.
[2024-05-24 04:52:27] [INFO ] Implicit Places using invariants and state equation in 3827 ms returned []
Implicit Place search using SMT with State Equation took 4606 ms to find 0 implicit places.
[2024-05-24 04:52:27] [INFO ] Redundant transitions in 100 ms returned []
Running 2899 sub problems to find dead transitions.
[2024-05-24 04:52:28] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
[2024-05-24 04:52:28] [INFO ] Invariant cache hit.
[2024-05-24 04:52:28] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2899 unsolved
SMT process timed out in 32370ms, After SMT, problems are : Problem set: 0 solved, 2899 unsolved
Search for dead transitions found 0 dead transitions in 32399ms
Starting structural reductions in SI_LTL mode, iteration 1 : 487/488 places, 2908/2909 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 37231 ms. Remains : 487/488 places, 2908/2909 transitions.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-11 finished in 219233 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(X(F(p1)))))))'
Found a Shortening insensitive property : EisenbergMcGuire-PT-09-LTLFireability-13
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 823 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 823/823 places, 3276/3276 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 823 transition count 3267
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 814 transition count 3267
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 814 transition count 3015
Deduced a syphon composed of 252 places in 5 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 562 transition count 3015
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 525 place count 559 transition count 2988
Iterating global reduction 2 with 3 rules applied. Total rules applied 528 place count 559 transition count 2988
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 5 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 672 place count 487 transition count 2916
Applied a total of 672 rules in 185 ms. Remains 487 /823 variables (removed 336) and now considering 2916/3276 (removed 360) transitions.
[2024-05-24 04:53:01] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-05-24 04:53:01] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 04:53:02] [INFO ] Implicit Places using invariants in 1237 ms returned []
[2024-05-24 04:53:02] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:53:02] [INFO ] Invariant cache hit.
[2024-05-24 04:53:02] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 04:53:06] [INFO ] Implicit Places using invariants and state equation in 4450 ms returned []
Implicit Place search using SMT with State Equation took 5689 ms to find 0 implicit places.
Running 2907 sub problems to find dead transitions.
[2024-05-24 04:53:06] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:53:06] [INFO ] Invariant cache hit.
[2024-05-24 04:53:06] [INFO ] State equation strengthened by 364 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 32845ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32897ms
Starting structural reductions in LI_LTL mode, iteration 1 : 487/823 places, 2916/3276 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 38778 ms. Remains : 487/823 places, 2916/3276 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-09-LTLFireability-13
Product exploration explored 100000 steps with 25000 reset in 1031 ms.
Product exploration explored 100000 steps with 25000 reset in 693 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 1178 ms. (33 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 2/2 properties
[2024-05-24 04:53:42] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:53:42] [INFO ] Invariant cache hit.
[2024-05-24 04:53:42] [INFO ] State equation strengthened by 364 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/163 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 381/550 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 65/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/694 variables, 66/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/694 variables, 33/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/694 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 240/934 variables, 12/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/934 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/946 variables, 6/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/946 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 378/1324 variables, 252/613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1324 variables, 266/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 879 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1117 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/163 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:53:43] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 381/550 variables, 169/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/550 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 144/694 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/694 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/694 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 240/934 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/934 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/946 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/946 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:53:44] [INFO ] Deduced a trap composed of 3 places in 412 ms of which 3 ms to minimize.
[2024-05-24 04:53:45] [INFO ] Deduced a trap composed of 3 places in 341 ms of which 3 ms to minimize.
[2024-05-24 04:53:45] [INFO ] Deduced a trap composed of 3 places in 274 ms of which 2 ms to minimize.
[2024-05-24 04:53:45] [INFO ] Deduced a trap composed of 39 places in 257 ms of which 3 ms to minimize.
[2024-05-24 04:53:45] [INFO ] Deduced a trap composed of 3 places in 287 ms of which 3 ms to minimize.
[2024-05-24 04:53:46] [INFO ] Deduced a trap composed of 29 places in 241 ms of which 2 ms to minimize.
[2024-05-24 04:53:46] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 2 ms to minimize.
[2024-05-24 04:53:46] [INFO ] Deduced a trap composed of 31 places in 216 ms of which 2 ms to minimize.
[2024-05-24 04:53:46] [INFO ] Deduced a trap composed of 37 places in 239 ms of which 2 ms to minimize.
[2024-05-24 04:53:47] [INFO ] Deduced a trap composed of 3 places in 247 ms of which 2 ms to minimize.
[2024-05-24 04:53:47] [INFO ] Deduced a trap composed of 15 places in 201 ms of which 2 ms to minimize.
[2024-05-24 04:53:47] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 2 ms to minimize.
[2024-05-24 04:53:47] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/946 variables, 13/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/946 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 378/1324 variables, 252/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1324 variables, 266/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:53:48] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1324 variables, 1/896 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 896 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 15/15 constraints]
After SMT, in 6155ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 102 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 487/487 places, 2916/2916 transitions.
RANDOM walk for 40000 steps (8 resets) in 1201 ms. (33 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 198480 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 2
Probabilistic random walk after 198480 steps, saw 129563 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2024-05-24 04:53:51] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:53:51] [INFO ] Invariant cache hit.
[2024-05-24 04:53:52] [INFO ] State equation strengthened by 364 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/163 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 381/550 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 65/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/694 variables, 66/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/694 variables, 33/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/694 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 240/934 variables, 12/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/934 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/946 variables, 6/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/946 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 378/1324 variables, 252/613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1324 variables, 266/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 879 constraints, problems are : Problem set: 0 solved, 2 unsolved in 809 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/163 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:53:53] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 381/550 variables, 169/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/550 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 144/694 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/694 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/694 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 240/934 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/934 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/946 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/946 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:53:53] [INFO ] Deduced a trap composed of 3 places in 290 ms of which 3 ms to minimize.
[2024-05-24 04:53:54] [INFO ] Deduced a trap composed of 3 places in 310 ms of which 3 ms to minimize.
[2024-05-24 04:53:54] [INFO ] Deduced a trap composed of 3 places in 255 ms of which 2 ms to minimize.
[2024-05-24 04:53:54] [INFO ] Deduced a trap composed of 39 places in 347 ms of which 3 ms to minimize.
[2024-05-24 04:53:55] [INFO ] Deduced a trap composed of 3 places in 344 ms of which 4 ms to minimize.
[2024-05-24 04:53:55] [INFO ] Deduced a trap composed of 29 places in 336 ms of which 3 ms to minimize.
[2024-05-24 04:53:56] [INFO ] Deduced a trap composed of 4 places in 393 ms of which 4 ms to minimize.
[2024-05-24 04:53:56] [INFO ] Deduced a trap composed of 31 places in 380 ms of which 3 ms to minimize.
[2024-05-24 04:53:56] [INFO ] Deduced a trap composed of 37 places in 401 ms of which 4 ms to minimize.
[2024-05-24 04:53:57] [INFO ] Deduced a trap composed of 3 places in 414 ms of which 4 ms to minimize.
[2024-05-24 04:53:57] [INFO ] Deduced a trap composed of 15 places in 269 ms of which 2 ms to minimize.
[2024-05-24 04:53:57] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 2 ms to minimize.
[2024-05-24 04:53:57] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/946 variables, 13/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/946 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 378/1324 variables, 252/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1324 variables, 266/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:53:58] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1324 variables, 1/896 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1324 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/1324 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 896 constraints, problems are : Problem set: 0 solved, 2 unsolved in 6163 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 15/15 constraints]
After SMT, in 6992ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 872 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 106 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 487/487 places, 2916/2916 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 110 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 04:54:00] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:54:00] [INFO ] Invariant cache hit.
[2024-05-24 04:54:00] [INFO ] Implicit Places using invariants in 889 ms returned []
[2024-05-24 04:54:00] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:54:00] [INFO ] Invariant cache hit.
[2024-05-24 04:54:01] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 04:54:06] [INFO ] Implicit Places using invariants and state equation in 5286 ms returned []
Implicit Place search using SMT with State Equation took 6178 ms to find 0 implicit places.
[2024-05-24 04:54:06] [INFO ] Redundant transitions in 152 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-05-24 04:54:06] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:54:06] [INFO ] Invariant cache hit.
[2024-05-24 04:54:06] [INFO ] State equation strengthened by 364 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 33305ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 33350ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39802 ms. Remains : 487/487 places, 2916/2916 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2700 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 277 transitions
Ensure Unique test removed 2024 transitions
Reduce isomorphic transitions removed 2301 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 415 transition count 518
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 318 transition count 518
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 195 place count 318 transition count 500
Deduced a syphon composed of 18 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 239 place count 292 transition count 500
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 525 place count 149 transition count 357
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 595 place count 149 transition count 287
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 609 place count 142 transition count 287
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 616 place count 142 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 625 place count 142 transition count 271
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 699 place count 142 transition count 197
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 773 place count 68 transition count 197
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 782 place count 68 transition count 197
Applied a total of 782 rules in 35 ms. Remains 68 /487 variables (removed 419) and now considering 197/2916 (removed 2719) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 197 rows 68 cols
[2024-05-24 04:54:39] [INFO ] Computed 20 invariants in 1 ms
[2024-05-24 04:54:39] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 04:54:39] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-24 04:54:39] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:54:40] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 04:54:40] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-24 04:54:40] [INFO ] After 38ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 04:54:40] [INFO ] After 84ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 04:54:40] [INFO ] After 307ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 396 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 21 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 04:54:40] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-05-24 04:54:40] [INFO ] Computed 28 invariants in 4 ms
[2024-05-24 04:54:42] [INFO ] Implicit Places using invariants in 1327 ms returned []
[2024-05-24 04:54:42] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:54:42] [INFO ] Invariant cache hit.
[2024-05-24 04:54:42] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 04:54:46] [INFO ] Implicit Places using invariants and state equation in 4290 ms returned []
Implicit Place search using SMT with State Equation took 5618 ms to find 0 implicit places.
Running 2907 sub problems to find dead transitions.
[2024-05-24 04:54:46] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:54:46] [INFO ] Invariant cache hit.
[2024-05-24 04:54:46] [INFO ] State equation strengthened by 364 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 33287ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 33325ms
Finished structural reductions in LTL mode , in 1 iterations and 38968 ms. Remains : 487/487 places, 2916/2916 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 901 ms. (44 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 2/2 properties
[2024-05-24 04:55:20] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:55:20] [INFO ] Invariant cache hit.
[2024-05-24 04:55:20] [INFO ] State equation strengthened by 364 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/163 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 381/550 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 65/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/694 variables, 66/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/694 variables, 33/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/694 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 240/934 variables, 12/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/934 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/946 variables, 6/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/946 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 378/1324 variables, 252/613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1324 variables, 266/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 879 constraints, problems are : Problem set: 0 solved, 2 unsolved in 995 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/163 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:55:21] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 381/550 variables, 169/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/550 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 144/694 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/694 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/694 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 240/934 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/934 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/946 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/946 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:55:22] [INFO ] Deduced a trap composed of 3 places in 506 ms of which 4 ms to minimize.
[2024-05-24 04:55:23] [INFO ] Deduced a trap composed of 3 places in 551 ms of which 4 ms to minimize.
[2024-05-24 04:55:23] [INFO ] Deduced a trap composed of 3 places in 446 ms of which 5 ms to minimize.
[2024-05-24 04:55:24] [INFO ] Deduced a trap composed of 39 places in 452 ms of which 4 ms to minimize.
[2024-05-24 04:55:24] [INFO ] Deduced a trap composed of 3 places in 393 ms of which 4 ms to minimize.
[2024-05-24 04:55:25] [INFO ] Deduced a trap composed of 29 places in 390 ms of which 3 ms to minimize.
[2024-05-24 04:55:25] [INFO ] Deduced a trap composed of 4 places in 411 ms of which 4 ms to minimize.
[2024-05-24 04:55:26] [INFO ] Deduced a trap composed of 31 places in 383 ms of which 4 ms to minimize.
[2024-05-24 04:55:26] [INFO ] Deduced a trap composed of 37 places in 392 ms of which 3 ms to minimize.
SMT process timed out in 6106ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 165 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 487/487 places, 2916/2916 transitions.
RANDOM walk for 40000 steps (8 resets) in 1274 ms. (31 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 126470 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 2
Probabilistic random walk after 126470 steps, saw 86607 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
[2024-05-24 04:55:30] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:55:30] [INFO ] Invariant cache hit.
[2024-05-24 04:55:30] [INFO ] State equation strengthened by 364 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/163 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 381/550 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 65/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 144/694 variables, 66/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/694 variables, 33/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/694 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 240/934 variables, 12/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/934 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/946 variables, 6/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/946 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 378/1324 variables, 252/613 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1324 variables, 266/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/1324 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1324/1324 variables, and 879 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1074 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 147/152 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/163 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/169 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:55:31] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 381/550 variables, 169/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/550 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 144/694 variables, 66/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/694 variables, 33/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/694 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 240/934 variables, 12/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/934 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/946 variables, 6/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/946 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:55:32] [INFO ] Deduced a trap composed of 3 places in 413 ms of which 4 ms to minimize.
[2024-05-24 04:55:33] [INFO ] Deduced a trap composed of 3 places in 531 ms of which 5 ms to minimize.
[2024-05-24 04:55:33] [INFO ] Deduced a trap composed of 3 places in 456 ms of which 4 ms to minimize.
[2024-05-24 04:55:34] [INFO ] Deduced a trap composed of 39 places in 457 ms of which 4 ms to minimize.
[2024-05-24 04:55:34] [INFO ] Deduced a trap composed of 3 places in 406 ms of which 3 ms to minimize.
[2024-05-24 04:55:35] [INFO ] Deduced a trap composed of 29 places in 392 ms of which 4 ms to minimize.
[2024-05-24 04:55:35] [INFO ] Deduced a trap composed of 4 places in 411 ms of which 4 ms to minimize.
[2024-05-24 04:55:35] [INFO ] Deduced a trap composed of 31 places in 322 ms of which 4 ms to minimize.
[2024-05-24 04:55:36] [INFO ] Deduced a trap composed of 37 places in 415 ms of which 4 ms to minimize.
[2024-05-24 04:55:36] [INFO ] Deduced a trap composed of 3 places in 391 ms of which 3 ms to minimize.
[2024-05-24 04:55:37] [INFO ] Deduced a trap composed of 15 places in 346 ms of which 3 ms to minimize.
[2024-05-24 04:55:37] [INFO ] Deduced a trap composed of 3 places in 262 ms of which 3 ms to minimize.
[2024-05-24 04:55:37] [INFO ] Deduced a trap composed of 24 places in 201 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/946 variables, 13/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/946 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 378/1324 variables, 252/629 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1324 variables, 266/895 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:55:38] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1324 variables, 1/896 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1324 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/1324 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1324/1324 variables, and 896 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7588 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 487/487 constraints, ReadFeed: 364/364 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 15/15 constraints]
After SMT, in 8696ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 971 ms.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 140 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 142 ms. Remains : 487/487 places, 2916/2916 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 102 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 04:55:40] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:55:40] [INFO ] Invariant cache hit.
[2024-05-24 04:55:41] [INFO ] Implicit Places using invariants in 1107 ms returned []
[2024-05-24 04:55:41] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:55:41] [INFO ] Invariant cache hit.
[2024-05-24 04:55:41] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 04:55:45] [INFO ] Implicit Places using invariants and state equation in 4425 ms returned []
Implicit Place search using SMT with State Equation took 5534 ms to find 0 implicit places.
[2024-05-24 04:55:45] [INFO ] Redundant transitions in 153 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-05-24 04:55:45] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:55:45] [INFO ] Invariant cache hit.
[2024-05-24 04:55:45] [INFO ] State equation strengthened by 364 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 32867ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32911ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38711 ms. Remains : 487/487 places, 2916/2916 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2700 edges and 487 vertex of which 81 / 487 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 277 transitions
Ensure Unique test removed 2024 transitions
Reduce isomorphic transitions removed 2301 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 415 transition count 518
Reduce places removed 97 places and 0 transitions.
Iterating post reduction 1 with 97 rules applied. Total rules applied 195 place count 318 transition count 518
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 195 place count 318 transition count 500
Deduced a syphon composed of 18 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 239 place count 292 transition count 500
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 525 place count 149 transition count 357
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Iterating post reduction 2 with 70 rules applied. Total rules applied 595 place count 149 transition count 287
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 609 place count 142 transition count 287
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 616 place count 142 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 625 place count 142 transition count 271
Free-agglomeration rule applied 74 times.
Iterating global reduction 4 with 74 rules applied. Total rules applied 699 place count 142 transition count 197
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 4 with 74 rules applied. Total rules applied 773 place count 68 transition count 197
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 782 place count 68 transition count 197
Applied a total of 782 rules in 26 ms. Remains 68 /487 variables (removed 419) and now considering 197/2916 (removed 2719) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 197 rows 68 cols
[2024-05-24 04:56:18] [INFO ] Computed 20 invariants in 0 ms
[2024-05-24 04:56:18] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 04:56:18] [INFO ] [Nat]Absence check using 19 positive place invariants in 4 ms returned sat
[2024-05-24 04:56:18] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 04:56:18] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 04:56:18] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-24 04:56:18] [INFO ] After 23ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 04:56:19] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 04:56:19] [INFO ] After 187ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 252 ms.
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 110 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 925 ms.
Product exploration explored 100000 steps with 25000 reset in 738 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 177 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 04:56:21] [INFO ] Redundant transitions in 159 ms returned []
Running 2907 sub problems to find dead transitions.
[2024-05-24 04:56:21] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
// Phase 1: matrix 837 rows 487 cols
[2024-05-24 04:56:21] [INFO ] Computed 28 invariants in 3 ms
[2024-05-24 04:56:21] [INFO ] State equation strengthened by 364 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 32744ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32791ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 33140 ms. Remains : 487/487 places, 2916/2916 transitions.
Support contains 5 out of 487 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 487/487 places, 2916/2916 transitions.
Applied a total of 0 rules in 20 ms. Remains 487 /487 variables (removed 0) and now considering 2916/2916 (removed 0) transitions.
[2024-05-24 04:56:54] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:56:54] [INFO ] Invariant cache hit.
[2024-05-24 04:56:55] [INFO ] Implicit Places using invariants in 1238 ms returned []
[2024-05-24 04:56:55] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:56:55] [INFO ] Invariant cache hit.
[2024-05-24 04:56:56] [INFO ] State equation strengthened by 364 read => feed constraints.
[2024-05-24 04:56:59] [INFO ] Implicit Places using invariants and state equation in 3742 ms returned []
Implicit Place search using SMT with State Equation took 4982 ms to find 0 implicit places.
Running 2907 sub problems to find dead transitions.
[2024-05-24 04:56:59] [INFO ] Flow matrix only has 837 transitions (discarded 2079 similar events)
[2024-05-24 04:56:59] [INFO ] Invariant cache hit.
[2024-05-24 04:56:59] [INFO ] State equation strengthened by 364 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2907 unsolved
SMT process timed out in 32900ms, After SMT, problems are : Problem set: 0 solved, 2907 unsolved
Search for dead transitions found 0 dead transitions in 32949ms
Finished structural reductions in LTL mode , in 1 iterations and 37957 ms. Remains : 487/487 places, 2916/2916 transitions.
Treatment of property EisenbergMcGuire-PT-09-LTLFireability-13 finished in 272278 ms.
[2024-05-24 04:57:33] [INFO ] Flatten gal took : 200 ms
[2024-05-24 04:57:33] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2024-05-24 04:57:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 823 places, 3276 transitions and 16344 arcs took 48 ms.
Total runtime 3215033 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running EisenbergMcGuire-PT-09

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 823
TRANSITIONS: 3276
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.188s, Sys 0.012s]


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.027s, Sys 0.000s]


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

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

Process ID: 5793
MODEL NAME: /home/mcc/execution/415/model
823 places, 3276 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

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