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.r355-tall-171683760001020.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 ShieldRVt-PT-040B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683760001020
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 912K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 21:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 11 21:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 21:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 11 21:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 489K May 18 16:43 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 ShieldRVt-PT-040B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717084238041

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-040B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 15:50:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-30 15:50:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 15:50:39] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2024-05-30 15:50:39] [INFO ] Transformed 2003 places.
[2024-05-30 15:50:39] [INFO ] Transformed 2003 transitions.
[2024-05-30 15:50:39] [INFO ] Found NUPN structural information;
[2024-05-30 15:50:39] [INFO ] Parsed PT model containing 2003 places and 2003 transitions and 4726 arcs in 324 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldRVt-PT-040B-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Discarding 427 places :
Symmetric choice reduction at 0 with 427 rule applications. Total rules 427 place count 1576 transition count 1576
Iterating global reduction 0 with 427 rules applied. Total rules applied 854 place count 1576 transition count 1576
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 855 place count 1575 transition count 1575
Iterating global reduction 0 with 1 rules applied. Total rules applied 856 place count 1575 transition count 1575
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 857 place count 1574 transition count 1574
Iterating global reduction 0 with 1 rules applied. Total rules applied 858 place count 1574 transition count 1574
Applied a total of 858 rules in 745 ms. Remains 1574 /2003 variables (removed 429) and now considering 1574/2003 (removed 429) transitions.
// Phase 1: matrix 1574 rows 1574 cols
[2024-05-30 15:50:40] [INFO ] Computed 161 invariants in 35 ms
[2024-05-30 15:50:41] [INFO ] Implicit Places using invariants in 760 ms returned []
[2024-05-30 15:50:41] [INFO ] Invariant cache hit.
[2024-05-30 15:50:42] [INFO ] Implicit Places using invariants and state equation in 1254 ms returned []
Implicit Place search using SMT with State Equation took 2047 ms to find 0 implicit places.
Running 1573 sub problems to find dead transitions.
[2024-05-30 15:50:42] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1573/3148 variables, and 0 constraints, problems are : Problem set: 0 solved, 1573 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1574 constraints, PredecessorRefiner: 1573/1573 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1573 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 1573/3148 variables, and 0 constraints, problems are : Problem set: 0 solved, 1573 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1574 constraints, PredecessorRefiner: 0/1573 constraints, Known Traps: 0/0 constraints]
After SMT, in 60574ms problems are : Problem set: 0 solved, 1573 unsolved
Search for dead transitions found 0 dead transitions in 60608ms
Starting structural reductions in LTL mode, iteration 1 : 1574/2003 places, 1574/2003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63432 ms. Remains : 1574/2003 places, 1574/2003 transitions.
Support contains 28 out of 1574 places after structural reductions.
[2024-05-30 15:51:43] [INFO ] Flatten gal took : 126 ms
[2024-05-30 15:51:43] [INFO ] Flatten gal took : 76 ms
[2024-05-30 15:51:43] [INFO ] Input system was already deterministic with 1574 transitions.
Support contains 27 out of 1574 places (down from 28) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1516 ms. (26 steps per ms) remains 13/24 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 193 ms. (206 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 103 ms. (384 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 13/13 properties
[2024-05-30 15:51:44] [INFO ] Invariant cache hit.
Problem AtomicPropp15 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 237/254 variables, 19/19 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 1320/1574 variables, 142/161 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1574 variables, 0/161 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1574/3148 variables, 1574/1735 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3148 variables, 0/1735 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/3148 variables, 0/1735 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3148/3148 variables, and 1735 constraints, problems are : Problem set: 1 solved, 12 unsolved in 1997 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 1574/1574 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 198/213 variables, 15/15 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/213 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 1361/1574 variables, 146/161 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-30 15:51:47] [INFO ] Deduced a trap composed of 31 places in 245 ms of which 45 ms to minimize.
[2024-05-30 15:51:47] [INFO ] Deduced a trap composed of 21 places in 186 ms of which 4 ms to minimize.
[2024-05-30 15:51:47] [INFO ] Deduced a trap composed of 30 places in 191 ms of which 4 ms to minimize.
[2024-05-30 15:51:48] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 4 ms to minimize.
[2024-05-30 15:51:48] [INFO ] Deduced a trap composed of 30 places in 147 ms of which 4 ms to minimize.
[2024-05-30 15:51:48] [INFO ] Deduced a trap composed of 16 places in 135 ms of which 3 ms to minimize.
[2024-05-30 15:51:48] [INFO ] Deduced a trap composed of 31 places in 131 ms of which 4 ms to minimize.
[2024-05-30 15:51:48] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 3 ms to minimize.
[2024-05-30 15:51:48] [INFO ] Deduced a trap composed of 54 places in 129 ms of which 2 ms to minimize.
[2024-05-30 15:51:48] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 2 ms to minimize.
[2024-05-30 15:51:49] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 3 ms to minimize.
[2024-05-30 15:51:49] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 2 ms to minimize.
[2024-05-30 15:51:49] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1574 variables, 13/174 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1574 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 1574/3148 variables, 1574/1748 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3148 variables, 12/1760 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-30 15:51:50] [INFO ] Deduced a trap composed of 23 places in 190 ms of which 4 ms to minimize.
[2024-05-30 15:51:51] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 4 ms to minimize.
[2024-05-30 15:51:51] [INFO ] Deduced a trap composed of 20 places in 186 ms of which 4 ms to minimize.
[2024-05-30 15:51:51] [INFO ] Deduced a trap composed of 49 places in 188 ms of which 4 ms to minimize.
[2024-05-30 15:51:51] [INFO ] Deduced a trap composed of 50 places in 183 ms of which 4 ms to minimize.
SMT process timed out in 7041ms, After SMT, problems are : Problem set: 1 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 1574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 424 transitions
Trivial Post-agglo rules discarded 424 transitions
Performed 424 trivial Post agglomeration. Transition count delta: 424
Iterating post reduction 0 with 424 rules applied. Total rules applied 424 place count 1574 transition count 1150
Reduce places removed 424 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 429 rules applied. Total rules applied 853 place count 1150 transition count 1145
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 858 place count 1145 transition count 1145
Performed 310 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 310 Pre rules applied. Total rules applied 858 place count 1145 transition count 835
Deduced a syphon composed of 310 places in 2 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 3 with 620 rules applied. Total rules applied 1478 place count 835 transition count 835
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1483 place count 830 transition count 830
Iterating global reduction 3 with 5 rules applied. Total rules applied 1488 place count 830 transition count 830
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 1488 place count 830 transition count 826
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1496 place count 826 transition count 826
Performed 367 Post agglomeration using F-continuation condition.Transition count delta: 367
Deduced a syphon composed of 367 places in 1 ms
Reduce places removed 367 places and 0 transitions.
Iterating global reduction 3 with 734 rules applied. Total rules applied 2230 place count 459 transition count 459
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2231 place count 459 transition count 458
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2233 place count 458 transition count 457
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -93
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2435 place count 357 transition count 550
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 2457 place count 346 transition count 560
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2458 place count 346 transition count 559
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2460 place count 346 transition count 557
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2462 place count 344 transition count 557
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 2464 place count 344 transition count 555
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2465 place count 343 transition count 554
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2466 place count 342 transition count 554
Applied a total of 2466 rules in 388 ms. Remains 342 /1574 variables (removed 1232) and now considering 554/1574 (removed 1020) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 388 ms. Remains : 342/1574 places, 554/1574 transitions.
RANDOM walk for 40000 steps (11 resets) in 597 ms. (66 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 195 ms. (204 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 239 ms. (166 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (11 resets) in 147 ms. (270 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (9 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (10 resets) in 118 ms. (336 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40002 steps (9 resets) in 115 ms. (344 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
// Phase 1: matrix 554 rows 342 cols
[2024-05-30 15:51:52] [INFO ] Computed 160 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 28/39 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 89/128 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 219/347 variables, 80/130 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/347 variables, 39/169 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 2/349 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 229/578 variables, 92/262 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/578 variables, 44/306 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/578 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 1/579 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/579 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/579 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 94/673 variables, 42/350 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/673 variables, 19/369 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/673 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 2/675 variables, 2/371 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/675 variables, 2/373 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/675 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (OVERLAPS) 45/720 variables, 18/391 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/720 variables, 9/400 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/720 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (OVERLAPS) 44/764 variables, 16/416 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/764 variables, 8/424 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/764 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (OVERLAPS) 44/808 variables, 16/440 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/808 variables, 8/448 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/808 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (OVERLAPS) 44/852 variables, 16/464 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/852 variables, 8/472 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/852 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 34 (OVERLAPS) 38/890 variables, 16/488 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/890 variables, 8/496 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/890 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 37 (OVERLAPS) 6/896 variables, 4/500 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/896 variables, 2/502 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/896 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 40 (OVERLAPS) 0/896 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 896/896 variables, and 502 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1211 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 342/342 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 28/39 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 89/128 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 219/347 variables, 80/136 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/347 variables, 39/175 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 3/178 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 2/349 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 229/578 variables, 92/271 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/578 variables, 44/315 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/578 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 1/579 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/579 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/579 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 94/673 variables, 42/359 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/673 variables, 19/378 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/673 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (OVERLAPS) 2/675 variables, 2/380 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/675 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/675 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (OVERLAPS) 45/720 variables, 18/400 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/720 variables, 9/409 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/720 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (OVERLAPS) 44/764 variables, 16/425 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/764 variables, 8/433 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/764 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (OVERLAPS) 44/808 variables, 16/449 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/808 variables, 8/457 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/808 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (OVERLAPS) 44/852 variables, 16/473 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/852 variables, 8/481 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/852 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (OVERLAPS) 38/890 variables, 16/497 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/890 variables, 8/505 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/890 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 39 (OVERLAPS) 6/896 variables, 4/509 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/896 variables, 2/511 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/896 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 42 (OVERLAPS) 0/896 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 896/896 variables, and 511 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1531 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 342/342 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 2757ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 1059 ms.
Support contains 11 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 554/554 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 342 transition count 553
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 341 transition count 553
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 341 transition count 552
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 340 transition count 552
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 339 transition count 551
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 337 transition count 553
Applied a total of 10 rules in 44 ms. Remains 337 /342 variables (removed 5) and now considering 553/554 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 337/342 places, 553/554 transitions.
RANDOM walk for 40000 steps (16 resets) in 415 ms. (96 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (9 resets) in 196 ms. (203 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 179 ms. (222 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (9 resets) in 177 ms. (224 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (10 resets) in 181 ms. (219 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (9 resets) in 163 ms. (243 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 161 ms. (246 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 142312 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 9
Probabilistic random walk after 142312 steps, saw 100270 distinct states, run finished after 3015 ms. (steps per millisecond=47 ) properties seen :0
// Phase 1: matrix 553 rows 337 cols
[2024-05-30 15:52:00] [INFO ] Computed 160 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 28/39 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 91/130 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 220/350 variables, 80/130 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 40/170 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 227/577 variables, 90/260 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/577 variables, 45/305 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/577 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 92/669 variables, 42/347 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/669 variables, 21/368 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/669 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 45/714 variables, 18/386 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/714 variables, 9/395 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/714 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 44/758 variables, 16/411 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/758 variables, 8/419 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/758 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 44/802 variables, 16/435 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/802 variables, 8/443 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/802 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 44/846 variables, 16/459 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/846 variables, 8/467 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/846 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (OVERLAPS) 38/884 variables, 16/483 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/884 variables, 8/491 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/884 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (OVERLAPS) 6/890 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/890 variables, 2/497 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/890 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (OVERLAPS) 0/890 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 890/890 variables, and 497 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1036 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 28/39 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 91/130 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 220/350 variables, 80/136 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 40/176 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 3/179 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 227/577 variables, 90/269 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/577 variables, 45/314 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/577 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 92/669 variables, 42/356 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/669 variables, 21/377 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/669 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 45/714 variables, 18/395 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/714 variables, 9/404 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/714 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 44/758 variables, 16/420 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/758 variables, 8/428 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/758 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (OVERLAPS) 44/802 variables, 16/444 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/802 variables, 8/452 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/802 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (OVERLAPS) 44/846 variables, 16/468 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/846 variables, 8/476 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/846 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (OVERLAPS) 38/884 variables, 16/492 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/884 variables, 8/500 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/884 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (OVERLAPS) 6/890 variables, 4/504 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/890 variables, 2/506 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/890 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 34 (OVERLAPS) 0/890 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 890/890 variables, and 506 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1355 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 2415ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 1886 ms.
Support contains 11 out of 337 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 337/337 places, 553/553 transitions.
Applied a total of 0 rules in 10 ms. Remains 337 /337 variables (removed 0) and now considering 553/553 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 337/337 places, 553/553 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 337/337 places, 553/553 transitions.
Applied a total of 0 rules in 11 ms. Remains 337 /337 variables (removed 0) and now considering 553/553 (removed 0) transitions.
[2024-05-30 15:52:04] [INFO ] Invariant cache hit.
[2024-05-30 15:52:04] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-30 15:52:04] [INFO ] Invariant cache hit.
[2024-05-30 15:52:05] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
[2024-05-30 15:52:05] [INFO ] Redundant transitions in 25 ms returned []
Running 550 sub problems to find dead transitions.
[2024-05-30 15:52:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/337 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 2 (OVERLAPS) 553/890 variables, 337/497 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/890 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 4 (OVERLAPS) 0/890 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 550 unsolved
No progress, stopping.
After SMT solving in domain Real declared 890/890 variables, and 497 constraints, problems are : Problem set: 0 solved, 550 unsolved in 23262 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 550/550 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 550 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/337 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 2 (OVERLAPS) 553/890 variables, 337/497 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/890 variables, 550/1047 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/890 variables, 0/1047 constraints. Problems are: Problem set: 0 solved, 550 unsolved
At refinement iteration 5 (OVERLAPS) 0/890 variables, 0/1047 constraints. Problems are: Problem set: 0 solved, 550 unsolved
No progress, stopping.
After SMT solving in domain Int declared 890/890 variables, and 1047 constraints, problems are : Problem set: 0 solved, 550 unsolved in 25181 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 550/550 constraints, Known Traps: 0/0 constraints]
After SMT, in 48634ms problems are : Problem set: 0 solved, 550 unsolved
Search for dead transitions found 0 dead transitions in 48639ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49222 ms. Remains : 337/337 places, 553/553 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 143 edges and 337 vertex of which 4 / 337 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 334 transition count 546
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 334 transition count 545
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 332 transition count 545
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 330 transition count 544
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 13 place count 330 transition count 540
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 19 place count 330 transition count 534
Applied a total of 19 rules in 36 ms. Remains 330 /337 variables (removed 7) and now considering 534/553 (removed 19) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 534 rows 330 cols
[2024-05-30 15:52:54] [INFO ] Computed 157 invariants in 3 ms
[2024-05-30 15:52:54] [INFO ] [Real]Absence check using 157 positive place invariants in 20 ms returned sat
[2024-05-30 15:52:54] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-30 15:52:54] [INFO ] [Nat]Absence check using 157 positive place invariants in 18 ms returned sat
[2024-05-30 15:52:54] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
TRAPS : Iteration 0
[2024-05-30 15:52:54] [INFO ] After 534ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
[2024-05-30 15:52:55] [INFO ] After 842ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Over-approximation ignoring read arcs solved 0 properties in 1071 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 479 stabilizing places and 479 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((G(!p0)||(!p0&&F(p1))))))'
Support contains 2 out of 1574 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 434 transitions
Trivial Post-agglo rules discarded 434 transitions
Performed 434 trivial Post agglomeration. Transition count delta: 434
Iterating post reduction 0 with 434 rules applied. Total rules applied 434 place count 1573 transition count 1139
Reduce places removed 434 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 436 rules applied. Total rules applied 870 place count 1139 transition count 1137
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 872 place count 1137 transition count 1137
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 313 Pre rules applied. Total rules applied 872 place count 1137 transition count 824
Deduced a syphon composed of 313 places in 1 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 3 with 626 rules applied. Total rules applied 1498 place count 824 transition count 824
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1508 place count 814 transition count 814
Iterating global reduction 3 with 10 rules applied. Total rules applied 1518 place count 814 transition count 814
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 1518 place count 814 transition count 805
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1536 place count 805 transition count 805
Performed 359 Post agglomeration using F-continuation condition.Transition count delta: 359
Deduced a syphon composed of 359 places in 1 ms
Reduce places removed 359 places and 0 transitions.
Iterating global reduction 3 with 718 rules applied. Total rules applied 2254 place count 446 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2255 place count 446 transition count 445
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2257 place count 445 transition count 444
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2459 place count 344 transition count 544
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 2493 place count 327 transition count 560
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2495 place count 325 transition count 558
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2496 place count 324 transition count 558
Applied a total of 2496 rules in 186 ms. Remains 324 /1574 variables (removed 1250) and now considering 558/1574 (removed 1016) transitions.
// Phase 1: matrix 558 rows 324 cols
[2024-05-30 15:52:55] [INFO ] Computed 160 invariants in 7 ms
[2024-05-30 15:52:55] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-30 15:52:55] [INFO ] Invariant cache hit.
[2024-05-30 15:52:56] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
[2024-05-30 15:52:56] [INFO ] Redundant transitions in 10 ms returned []
Running 554 sub problems to find dead transitions.
[2024-05-30 15:52:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/324 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/324 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (OVERLAPS) 557/881 variables, 324/484 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/881 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 4 (OVERLAPS) 0/881 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 554 unsolved
No progress, stopping.
After SMT solving in domain Real declared 881/882 variables, and 484 constraints, problems are : Problem set: 0 solved, 554 unsolved in 17646 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 554 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/324 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/324 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (OVERLAPS) 557/881 variables, 324/484 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/881 variables, 554/1038 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/881 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 5 (OVERLAPS) 0/881 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 554 unsolved
No progress, stopping.
After SMT solving in domain Int declared 881/882 variables, and 1038 constraints, problems are : Problem set: 0 solved, 554 unsolved in 23333 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 0/0 constraints]
After SMT, in 41170ms problems are : Problem set: 0 solved, 554 unsolved
Search for dead transitions found 0 dead transitions in 41175ms
Starting structural reductions in SI_LTL mode, iteration 1 : 324/1574 places, 558/1574 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41893 ms. Remains : 324/1574 places, 558/1574 transitions.
Stuttering acceptance computed with spot in 291 ms :[p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-01
Product exploration explored 100000 steps with 18 reset in 561 ms.
Product exploration explored 100000 steps with 30 reset in 612 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 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 118 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 151 ms :[p0, (AND p0 (NOT p1)), p0]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (20 resets) in 825 ms. (48 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 1/1 properties
[2024-05-30 15:53:39] [INFO ] Invariant cache hit.
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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/27 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 55/82 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 87/169 variables, 30/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 15/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 88/257 variables, 32/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 16/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/257 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 88/345 variables, 32/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/345 variables, 16/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/345 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 88/433 variables, 32/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/433 variables, 16/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/433 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 88/521 variables, 32/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/521 variables, 16/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/521 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 88/609 variables, 32/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/609 variables, 16/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/609 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 63/672 variables, 26/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/672 variables, 13/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/672 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 40/712 variables, 18/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/712 variables, 9/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/712 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 22/734 variables, 8/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/734 variables, 4/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/734 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 22/756 variables, 8/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/756 variables, 4/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/756 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 22/778 variables, 8/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/778 variables, 4/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/778 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 22/800 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/800 variables, 4/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/800 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 22/822 variables, 8/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/822 variables, 4/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/822 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 22/844 variables, 8/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/844 variables, 4/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/844 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 20/864 variables, 8/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/864 variables, 4/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/864 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 14/878 variables, 6/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/878 variables, 3/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/878 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 3/881 variables, 2/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/881 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/881 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 0/881 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 881/882 variables, and 484 constraints, problems are : Problem set: 0 solved, 1 unsolved in 493 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/27 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 55/82 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 87/169 variables, 30/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 15/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 88/257 variables, 32/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/257 variables, 16/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/257 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 88/345 variables, 32/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/345 variables, 16/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/345 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 88/433 variables, 32/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/433 variables, 16/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/433 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 88/521 variables, 32/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/521 variables, 16/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/521 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 88/609 variables, 32/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/609 variables, 16/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/609 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 63/672 variables, 26/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/672 variables, 13/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/672 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 40/712 variables, 18/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/712 variables, 9/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/712 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 22/734 variables, 8/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/734 variables, 4/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/734 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 22/756 variables, 8/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/756 variables, 4/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/756 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 22/778 variables, 8/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/778 variables, 4/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/778 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 22/800 variables, 8/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/800 variables, 4/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/800 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 22/822 variables, 8/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/822 variables, 4/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/822 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 22/844 variables, 8/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/844 variables, 4/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/844 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 20/864 variables, 8/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/864 variables, 4/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/864 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 14/878 variables, 6/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/878 variables, 3/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/878 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 3/881 variables, 2/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/881 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/881 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 0/881 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 881/882 variables, and 485 constraints, problems are : Problem set: 0 solved, 1 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 883ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 558/558 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 324 transition count 557
Applied a total of 1 rules in 12 ms. Remains 324 /324 variables (removed 0) and now considering 557/558 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 324/324 places, 557/558 transitions.
RANDOM walk for 40000 steps (11 resets) in 242 ms. (164 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 491763 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :0 out of 1
Probabilistic random walk after 491763 steps, saw 360523 distinct states, run finished after 3001 ms. (steps per millisecond=163 ) properties seen :0
// Phase 1: matrix 557 rows 324 cols
[2024-05-30 15:53:43] [INFO ] Computed 160 invariants in 9 ms
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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/27 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 55/82 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 87/169 variables, 30/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 15/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 88/257 variables, 32/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 16/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/257 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 88/345 variables, 32/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/345 variables, 16/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/345 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 88/433 variables, 32/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/433 variables, 16/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/433 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 88/521 variables, 32/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/521 variables, 16/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/521 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 88/609 variables, 32/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/609 variables, 16/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/609 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 63/672 variables, 26/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/672 variables, 13/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/672 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 40/712 variables, 18/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/712 variables, 9/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/712 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 22/734 variables, 8/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/734 variables, 4/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/734 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 22/756 variables, 8/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/756 variables, 4/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/756 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 22/778 variables, 8/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/778 variables, 4/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/778 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 22/800 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/800 variables, 4/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/800 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 22/822 variables, 8/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/822 variables, 4/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/822 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 22/844 variables, 8/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/844 variables, 4/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/844 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 20/864 variables, 8/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/864 variables, 4/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/864 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 14/878 variables, 6/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/878 variables, 3/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/878 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 3/881 variables, 2/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/881 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/881 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 0/881 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 881/881 variables, and 484 constraints, problems are : Problem set: 0 solved, 1 unsolved in 491 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/27 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 55/82 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 87/169 variables, 30/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 15/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 88/257 variables, 32/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/257 variables, 16/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/257 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 88/345 variables, 32/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/345 variables, 16/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/345 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 88/433 variables, 32/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/433 variables, 16/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/433 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 88/521 variables, 32/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/521 variables, 16/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/521 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 88/609 variables, 32/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/609 variables, 16/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/609 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 63/672 variables, 26/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/672 variables, 13/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/672 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 40/712 variables, 18/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/712 variables, 9/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/712 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 22/734 variables, 8/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/734 variables, 4/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/734 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 22/756 variables, 8/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/756 variables, 4/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/756 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 22/778 variables, 8/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/778 variables, 4/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/778 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 22/800 variables, 8/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/800 variables, 4/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/800 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 22/822 variables, 8/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/822 variables, 4/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/822 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 22/844 variables, 8/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/844 variables, 4/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/844 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 20/864 variables, 8/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/864 variables, 4/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/864 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 14/878 variables, 6/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/878 variables, 3/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/878 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 3/881 variables, 2/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/881 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/881 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 0/881 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 881/881 variables, and 485 constraints, problems are : Problem set: 0 solved, 1 unsolved in 376 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 881ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 557/557 transitions.
Applied a total of 0 rules in 13 ms. Remains 324 /324 variables (removed 0) and now considering 557/557 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 324/324 places, 557/557 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 557/557 transitions.
Applied a total of 0 rules in 11 ms. Remains 324 /324 variables (removed 0) and now considering 557/557 (removed 0) transitions.
[2024-05-30 15:53:44] [INFO ] Invariant cache hit.
[2024-05-30 15:53:44] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-30 15:53:44] [INFO ] Invariant cache hit.
[2024-05-30 15:53:44] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
[2024-05-30 15:53:44] [INFO ] Redundant transitions in 5 ms returned []
Running 554 sub problems to find dead transitions.
[2024-05-30 15:53:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/324 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/324 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (OVERLAPS) 557/881 variables, 324/484 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/881 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 4 (OVERLAPS) 0/881 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 554 unsolved
No progress, stopping.
After SMT solving in domain Real declared 881/881 variables, and 484 constraints, problems are : Problem set: 0 solved, 554 unsolved in 17880 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 554 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/324 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/324 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (OVERLAPS) 557/881 variables, 324/484 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/881 variables, 554/1038 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/881 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 5 (OVERLAPS) 0/881 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 554 unsolved
No progress, stopping.
After SMT solving in domain Int declared 881/881 variables, and 1038 constraints, problems are : Problem set: 0 solved, 554 unsolved in 22797 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 0/0 constraints]
After SMT, in 40881ms problems are : Problem set: 0 solved, 554 unsolved
Search for dead transitions found 0 dead transitions in 40889ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41475 ms. Remains : 324/324 places, 557/557 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 158 edges and 324 vertex of which 4 / 324 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1105 edges and 322 vertex of which 320 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 155 edges and 318 vertex of which 4 / 318 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 316 transition count 548
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 154 edges and 314 vertex of which 6 / 314 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 311 transition count 539
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 152 edges and 308 vertex of which 8 / 308 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 304 transition count 528
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 148 edges and 300 vertex of which 8 / 300 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 296 transition count 514
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 144 edges and 292 vertex of which 8 / 292 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 288 transition count 500
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 140 edges and 284 vertex of which 8 / 284 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 280 transition count 486
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 136 edges and 276 vertex of which 8 / 276 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 272 transition count 472
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 132 edges and 268 vertex of which 8 / 268 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 264 transition count 458
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 128 edges and 260 vertex of which 8 / 260 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 256 transition count 444
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 124 edges and 252 vertex of which 8 / 252 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 248 transition count 430
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 120 edges and 244 vertex of which 8 / 244 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 240 transition count 416
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 116 edges and 236 vertex of which 8 / 236 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 232 transition count 402
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 112 edges and 228 vertex of which 8 / 228 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 224 transition count 388
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 108 edges and 220 vertex of which 8 / 220 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 216 transition count 374
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 104 edges and 212 vertex of which 8 / 212 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 208 transition count 360
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 100 edges and 204 vertex of which 6 / 204 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 201 transition count 346
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 97 edges and 198 vertex of which 6 / 198 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 16 with 14 rules applied. Total rules applied 296 place count 195 transition count 336
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 94 edges and 192 vertex of which 6 / 192 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 17 with 16 rules applied. Total rules applied 312 place count 189 transition count 324
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 92 edges and 186 vertex of which 8 / 186 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 15 rules applied. Total rules applied 327 place count 182 transition count 313
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 89 edges and 178 vertex of which 10 / 178 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 19 with 20 rules applied. Total rules applied 347 place count 173 transition count 298
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (trivial) has 83 edges and 168 vertex of which 8 / 168 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 20 with 25 rules applied. Total rules applied 372 place count 164 transition count 279
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 78 edges and 159 vertex of which 8 / 159 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 21 rules applied. Total rules applied 393 place count 155 transition count 264
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 74 edges and 151 vertex of which 8 / 151 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 412 place count 147 transition count 250
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 70 edges and 143 vertex of which 8 / 143 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 431 place count 139 transition count 236
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 66 edges and 135 vertex of which 8 / 135 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 450 place count 131 transition count 222
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 62 edges and 127 vertex of which 8 / 127 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 469 place count 123 transition count 208
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 58 edges and 119 vertex of which 8 / 119 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 488 place count 115 transition count 194
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 54 edges and 111 vertex of which 8 / 111 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 507 place count 107 transition count 180
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 50 edges and 103 vertex of which 8 / 103 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 526 place count 99 transition count 166
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 46 edges and 95 vertex of which 8 / 95 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 545 place count 91 transition count 152
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 42 edges and 87 vertex of which 8 / 87 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 564 place count 83 transition count 138
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 38 edges and 79 vertex of which 6 / 79 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 31 with 17 rules applied. Total rules applied 581 place count 76 transition count 126
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 35 edges and 73 vertex of which 6 / 73 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 32 with 17 rules applied. Total rules applied 598 place count 70 transition count 113
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 32 edges and 66 vertex of which 6 / 66 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 33 with 17 rules applied. Total rules applied 615 place count 63 transition count 101
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 30 edges and 60 vertex of which 8 / 60 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 15 rules applied. Total rules applied 630 place count 56 transition count 90
Discarding 40 places :
Also discarding 70 output transitions
Drop transitions (Output transitions of discarded places.) removed 70 transitions
Remove reverse transitions (loop back) rule discarded transition t45.t42.t43 and 40 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 35 with 11 rules applied. Total rules applied 641 place count 12 transition count 10
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 36 with 3 Pre rules applied. Total rules applied 641 place count 12 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 36 with 9 rules applied. Total rules applied 650 place count 6 transition count 7
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 36 with 1 rules applied. Total rules applied 651 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 37 with 2 Pre rules applied. Total rules applied 651 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 37 with 4 rules applied. Total rules applied 655 place count 4 transition count 4
Applied a total of 655 rules in 87 ms. Remains 4 /324 variables (removed 320) and now considering 4/557 (removed 553) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2024-05-30 15:54:25] [INFO ] Computed 2 invariants in 0 ms
[2024-05-30 15:54:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-30 15:54:25] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 15:54:25] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-30 15:54:25] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 126 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 162 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 134 ms :[p0, (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 122 ms :[p0, (AND p0 (NOT p1)), p0]
Support contains 2 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 558/558 transitions.
Applied a total of 0 rules in 21 ms. Remains 324 /324 variables (removed 0) and now considering 558/558 (removed 0) transitions.
// Phase 1: matrix 558 rows 324 cols
[2024-05-30 15:54:26] [INFO ] Computed 160 invariants in 3 ms
[2024-05-30 15:54:26] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-30 15:54:26] [INFO ] Invariant cache hit.
[2024-05-30 15:54:26] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
[2024-05-30 15:54:26] [INFO ] Redundant transitions in 10 ms returned []
Running 554 sub problems to find dead transitions.
[2024-05-30 15:54:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/324 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/324 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (OVERLAPS) 557/881 variables, 324/484 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/881 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 4 (OVERLAPS) 0/881 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 554 unsolved
No progress, stopping.
After SMT solving in domain Real declared 881/882 variables, and 484 constraints, problems are : Problem set: 0 solved, 554 unsolved in 17775 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 554 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/324 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/324 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (OVERLAPS) 557/881 variables, 324/484 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/881 variables, 554/1038 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/881 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 5 (OVERLAPS) 0/881 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 554 unsolved
No progress, stopping.
After SMT solving in domain Int declared 881/882 variables, and 1038 constraints, problems are : Problem set: 0 solved, 554 unsolved in 21657 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 0/0 constraints]
After SMT, in 39635ms problems are : Problem set: 0 solved, 554 unsolved
Search for dead transitions found 0 dead transitions in 39640ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40235 ms. Remains : 324/324 places, 558/558 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), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 131 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 109 ms :[p0, (AND p0 (NOT p1)), p0]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (14 resets) in 330 ms. (120 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 321 ms. (124 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 145 ms. (273 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 310251 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :2 out of 3
Probabilistic random walk after 310251 steps, saw 215767 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :2
[2024-05-30 15:55:10] [INFO ] Invariant cache hit.
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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/27 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 55/82 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 87/169 variables, 30/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 15/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 88/257 variables, 32/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 16/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/257 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 88/345 variables, 32/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/345 variables, 16/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/345 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 88/433 variables, 32/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/433 variables, 16/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/433 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 88/521 variables, 32/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/521 variables, 16/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/521 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 88/609 variables, 32/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/609 variables, 16/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/609 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 63/672 variables, 26/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/672 variables, 13/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/672 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 40/712 variables, 18/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/712 variables, 9/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/712 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 22/734 variables, 8/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/734 variables, 4/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/734 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 22/756 variables, 8/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/756 variables, 4/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/756 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 22/778 variables, 8/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/778 variables, 4/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/778 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 22/800 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/800 variables, 4/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/800 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 22/822 variables, 8/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/822 variables, 4/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/822 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 22/844 variables, 8/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/844 variables, 4/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/844 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 20/864 variables, 8/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/864 variables, 4/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/864 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 14/878 variables, 6/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/878 variables, 3/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/878 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 3/881 variables, 2/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/881 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/881 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 0/881 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 881/882 variables, and 484 constraints, problems are : Problem set: 0 solved, 1 unsolved in 442 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/27 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 55/82 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 87/169 variables, 30/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 15/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 88/257 variables, 32/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/257 variables, 16/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/257 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 88/345 variables, 32/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/345 variables, 16/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/345 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 88/433 variables, 32/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/433 variables, 16/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/433 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 88/521 variables, 32/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/521 variables, 16/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/521 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 88/609 variables, 32/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/609 variables, 16/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/609 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 63/672 variables, 26/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/672 variables, 13/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/672 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 40/712 variables, 18/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/712 variables, 9/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/712 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 22/734 variables, 8/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/734 variables, 4/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/734 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 22/756 variables, 8/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/756 variables, 4/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/756 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 22/778 variables, 8/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/778 variables, 4/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/778 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 22/800 variables, 8/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/800 variables, 4/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/800 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 22/822 variables, 8/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/822 variables, 4/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/822 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 22/844 variables, 8/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/844 variables, 4/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/844 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 20/864 variables, 8/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/864 variables, 4/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/864 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 14/878 variables, 6/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/878 variables, 3/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/878 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 3/881 variables, 2/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/881 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/881 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 0/881 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 881/882 variables, and 485 constraints, problems are : Problem set: 0 solved, 1 unsolved in 349 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 798ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 558/558 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 324 transition count 557
Applied a total of 1 rules in 14 ms. Remains 324 /324 variables (removed 0) and now considering 557/558 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 324/324 places, 557/558 transitions.
RANDOM walk for 40000 steps (10 resets) in 509 ms. (78 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (9 resets) in 248 ms. (160 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 538765 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :0 out of 1
Probabilistic random walk after 538765 steps, saw 394853 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
// Phase 1: matrix 557 rows 324 cols
[2024-05-30 15:55:14] [INFO ] Computed 160 invariants in 4 ms
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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/27 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 55/82 variables, 18/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 87/169 variables, 30/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 15/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 88/257 variables, 32/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 16/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/257 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 88/345 variables, 32/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/345 variables, 16/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/345 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 88/433 variables, 32/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/433 variables, 16/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/433 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 88/521 variables, 32/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/521 variables, 16/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/521 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 88/609 variables, 32/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/609 variables, 16/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/609 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 63/672 variables, 26/348 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/672 variables, 13/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/672 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 40/712 variables, 18/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/712 variables, 9/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/712 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 22/734 variables, 8/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/734 variables, 4/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/734 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 22/756 variables, 8/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/756 variables, 4/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/756 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 22/778 variables, 8/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/778 variables, 4/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/778 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 22/800 variables, 8/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/800 variables, 4/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/800 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 22/822 variables, 8/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/822 variables, 4/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/822 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 22/844 variables, 8/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/844 variables, 4/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/844 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 20/864 variables, 8/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/864 variables, 4/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/864 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 14/878 variables, 6/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/878 variables, 3/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/878 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 3/881 variables, 2/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/881 variables, 1/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/881 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 0/881 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 881/881 variables, and 484 constraints, problems are : Problem set: 0 solved, 1 unsolved in 471 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/27 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 55/82 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 87/169 variables, 30/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/169 variables, 15/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/169 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 88/257 variables, 32/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/257 variables, 16/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/257 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 88/345 variables, 32/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/345 variables, 16/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/345 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 88/433 variables, 32/211 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/433 variables, 16/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/433 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 88/521 variables, 32/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/521 variables, 16/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/521 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 88/609 variables, 32/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/609 variables, 16/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/609 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 63/672 variables, 26/349 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/672 variables, 13/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/672 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 40/712 variables, 18/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/712 variables, 9/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/712 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 22/734 variables, 8/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/734 variables, 4/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/734 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 22/756 variables, 8/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/756 variables, 4/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/756 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 22/778 variables, 8/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/778 variables, 4/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/778 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 22/800 variables, 8/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/800 variables, 4/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/800 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 22/822 variables, 8/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/822 variables, 4/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/822 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 22/844 variables, 8/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/844 variables, 4/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/844 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 20/864 variables, 8/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/864 variables, 4/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/864 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 14/878 variables, 6/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/878 variables, 3/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/878 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 3/881 variables, 2/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/881 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/881 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 0/881 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 881/881 variables, and 485 constraints, problems are : Problem set: 0 solved, 1 unsolved in 366 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 849ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 557/557 transitions.
Applied a total of 0 rules in 13 ms. Remains 324 /324 variables (removed 0) and now considering 557/557 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 324/324 places, 557/557 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 557/557 transitions.
Applied a total of 0 rules in 9 ms. Remains 324 /324 variables (removed 0) and now considering 557/557 (removed 0) transitions.
[2024-05-30 15:55:15] [INFO ] Invariant cache hit.
[2024-05-30 15:55:15] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-30 15:55:15] [INFO ] Invariant cache hit.
[2024-05-30 15:55:15] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
[2024-05-30 15:55:15] [INFO ] Redundant transitions in 4 ms returned []
Running 554 sub problems to find dead transitions.
[2024-05-30 15:55:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/324 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/324 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (OVERLAPS) 557/881 variables, 324/484 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/881 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 4 (OVERLAPS) 0/881 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 554 unsolved
No progress, stopping.
After SMT solving in domain Real declared 881/881 variables, and 484 constraints, problems are : Problem set: 0 solved, 554 unsolved in 18308 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 554 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/324 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/324 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (OVERLAPS) 557/881 variables, 324/484 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/881 variables, 554/1038 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/881 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 5 (OVERLAPS) 0/881 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 554 unsolved
No progress, stopping.
After SMT solving in domain Int declared 881/881 variables, and 1038 constraints, problems are : Problem set: 0 solved, 554 unsolved in 23880 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 0/0 constraints]
After SMT, in 42381ms problems are : Problem set: 0 solved, 554 unsolved
Search for dead transitions found 0 dead transitions in 42389ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42925 ms. Remains : 324/324 places, 557/557 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 158 edges and 324 vertex of which 4 / 324 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1105 edges and 322 vertex of which 320 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 155 edges and 318 vertex of which 4 / 318 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 316 transition count 548
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 154 edges and 314 vertex of which 6 / 314 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 311 transition count 539
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 152 edges and 308 vertex of which 8 / 308 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 304 transition count 528
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 148 edges and 300 vertex of which 8 / 300 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 296 transition count 514
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 144 edges and 292 vertex of which 8 / 292 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 288 transition count 500
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 140 edges and 284 vertex of which 8 / 284 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 280 transition count 486
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 136 edges and 276 vertex of which 8 / 276 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 272 transition count 472
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 132 edges and 268 vertex of which 8 / 268 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 264 transition count 458
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 128 edges and 260 vertex of which 8 / 260 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 256 transition count 444
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 124 edges and 252 vertex of which 8 / 252 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 248 transition count 430
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 120 edges and 244 vertex of which 8 / 244 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 240 transition count 416
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 116 edges and 236 vertex of which 8 / 236 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 232 transition count 402
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 112 edges and 228 vertex of which 8 / 228 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 224 transition count 388
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 108 edges and 220 vertex of which 8 / 220 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 216 transition count 374
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 104 edges and 212 vertex of which 8 / 212 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 208 transition count 360
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 100 edges and 204 vertex of which 6 / 204 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 201 transition count 346
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 97 edges and 198 vertex of which 6 / 198 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 16 with 14 rules applied. Total rules applied 296 place count 195 transition count 336
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 94 edges and 192 vertex of which 6 / 192 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 17 with 16 rules applied. Total rules applied 312 place count 189 transition count 324
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 92 edges and 186 vertex of which 8 / 186 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 15 rules applied. Total rules applied 327 place count 182 transition count 313
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 89 edges and 178 vertex of which 10 / 178 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Iterating post reduction 19 with 20 rules applied. Total rules applied 347 place count 173 transition count 298
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 18 transitions.
Graph (trivial) has 83 edges and 168 vertex of which 8 / 168 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 20 with 25 rules applied. Total rules applied 372 place count 164 transition count 279
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 78 edges and 159 vertex of which 8 / 159 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 21 rules applied. Total rules applied 393 place count 155 transition count 264
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 74 edges and 151 vertex of which 8 / 151 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 412 place count 147 transition count 250
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 70 edges and 143 vertex of which 8 / 143 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 431 place count 139 transition count 236
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 66 edges and 135 vertex of which 8 / 135 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 450 place count 131 transition count 222
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 62 edges and 127 vertex of which 8 / 127 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 469 place count 123 transition count 208
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 58 edges and 119 vertex of which 8 / 119 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 488 place count 115 transition count 194
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 54 edges and 111 vertex of which 8 / 111 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 507 place count 107 transition count 180
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 50 edges and 103 vertex of which 8 / 103 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 526 place count 99 transition count 166
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 46 edges and 95 vertex of which 8 / 95 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 545 place count 91 transition count 152
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 42 edges and 87 vertex of which 8 / 87 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 564 place count 83 transition count 138
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 38 edges and 79 vertex of which 6 / 79 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 31 with 17 rules applied. Total rules applied 581 place count 76 transition count 126
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 35 edges and 73 vertex of which 6 / 73 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 32 with 17 rules applied. Total rules applied 598 place count 70 transition count 113
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 32 edges and 66 vertex of which 6 / 66 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 33 with 17 rules applied. Total rules applied 615 place count 63 transition count 101
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 30 edges and 60 vertex of which 8 / 60 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 15 rules applied. Total rules applied 630 place count 56 transition count 90
Discarding 40 places :
Also discarding 70 output transitions
Drop transitions (Output transitions of discarded places.) removed 70 transitions
Remove reverse transitions (loop back) rule discarded transition t45.t42.t43 and 40 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 35 with 11 rules applied. Total rules applied 641 place count 12 transition count 10
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 36 with 3 Pre rules applied. Total rules applied 641 place count 12 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 36 with 9 rules applied. Total rules applied 650 place count 6 transition count 7
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 36 with 1 rules applied. Total rules applied 651 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 37 with 2 Pre rules applied. Total rules applied 651 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 37 with 4 rules applied. Total rules applied 655 place count 4 transition count 4
Applied a total of 655 rules in 60 ms. Remains 4 /324 variables (removed 320) and now considering 4/557 (removed 553) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2024-05-30 15:55:58] [INFO ] Computed 2 invariants in 0 ms
[2024-05-30 15:55:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-30 15:55:58] [INFO ] After 3ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 15:55:58] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-30 15:55:58] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 100 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 186 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 139 ms :[p0, (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 122 ms :[p0, (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 122 ms :[p0, (AND p0 (NOT p1)), p0]
Product exploration explored 100000 steps with 24 reset in 446 ms.
Product exploration explored 100000 steps with 22 reset in 546 ms.
Support contains 2 out of 324 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 324/324 places, 558/558 transitions.
Applied a total of 0 rules in 6 ms. Remains 324 /324 variables (removed 0) and now considering 558/558 (removed 0) transitions.
// Phase 1: matrix 558 rows 324 cols
[2024-05-30 15:55:59] [INFO ] Computed 160 invariants in 4 ms
[2024-05-30 15:55:59] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-30 15:55:59] [INFO ] Invariant cache hit.
[2024-05-30 15:56:00] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
[2024-05-30 15:56:00] [INFO ] Redundant transitions in 4 ms returned []
Running 554 sub problems to find dead transitions.
[2024-05-30 15:56:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/324 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/324 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (OVERLAPS) 557/881 variables, 324/484 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/881 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 4 (OVERLAPS) 0/881 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 554 unsolved
No progress, stopping.
After SMT solving in domain Real declared 881/882 variables, and 484 constraints, problems are : Problem set: 0 solved, 554 unsolved in 18335 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 554 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/324 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/324 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (OVERLAPS) 557/881 variables, 324/484 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/881 variables, 554/1038 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/881 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 5 (OVERLAPS) 0/881 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 554 unsolved
No progress, stopping.
After SMT solving in domain Int declared 881/882 variables, and 1038 constraints, problems are : Problem set: 0 solved, 554 unsolved in 23502 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 0/0 constraints]
After SMT, in 41987ms problems are : Problem set: 0 solved, 554 unsolved
Search for dead transitions found 0 dead transitions in 41992ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 42558 ms. Remains : 324/324 places, 558/558 transitions.
Treatment of property ShieldRVt-PT-040B-LTLFireability-01 finished in 227008 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G((p0&&X((p0 U (p1||G(p0))))))||(p2&&X(!p1))))))'
Support contains 3 out of 1574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1562 transition count 1562
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1562 transition count 1562
Applied a total of 24 rules in 95 ms. Remains 1562 /1574 variables (removed 12) and now considering 1562/1574 (removed 12) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2024-05-30 15:56:42] [INFO ] Computed 161 invariants in 12 ms
[2024-05-30 15:56:42] [INFO ] Implicit Places using invariants in 362 ms returned []
[2024-05-30 15:56:42] [INFO ] Invariant cache hit.
[2024-05-30 15:56:43] [INFO ] Implicit Places using invariants and state equation in 1143 ms returned []
Implicit Place search using SMT with State Equation took 1508 ms to find 0 implicit places.
Running 1561 sub problems to find dead transitions.
[2024-05-30 15:56:44] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 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 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 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1561/3124 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1562 constraints, PredecessorRefiner: 1561/1561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1561 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 1561/3124 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1562 constraints, PredecessorRefiner: 0/1561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60356ms problems are : Problem set: 0 solved, 1561 unsolved
Search for dead transitions found 0 dead transitions in 60374ms
Starting structural reductions in LTL mode, iteration 1 : 1562/1574 places, 1562/1574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61981 ms. Remains : 1562/1574 places, 1562/1574 transitions.
Stuttering acceptance computed with spot in 290 ms :[true, p1, (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-03
Entered a terminal (fully accepting) state of product in 384 steps with 0 reset in 3 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-03 finished in 62317 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((X(p0)||(G(p1)&&(p0||X(p0))))))'
Support contains 2 out of 1574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1562 transition count 1562
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1562 transition count 1562
Applied a total of 24 rules in 98 ms. Remains 1562 /1574 variables (removed 12) and now considering 1562/1574 (removed 12) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2024-05-30 15:57:44] [INFO ] Computed 161 invariants in 12 ms
[2024-05-30 15:57:45] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-05-30 15:57:45] [INFO ] Invariant cache hit.
[2024-05-30 15:57:46] [INFO ] Implicit Places using invariants and state equation in 1081 ms returned []
Implicit Place search using SMT with State Equation took 1462 ms to find 0 implicit places.
Running 1561 sub problems to find dead transitions.
[2024-05-30 15:57:46] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1561/3124 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1562 constraints, PredecessorRefiner: 1561/1561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1561 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 1561/3124 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1562 constraints, PredecessorRefiner: 0/1561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60351ms problems are : Problem set: 0 solved, 1561 unsolved
Search for dead transitions found 0 dead transitions in 60365ms
Starting structural reductions in LTL mode, iteration 1 : 1562/1574 places, 1562/1574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61930 ms. Remains : 1562/1574 places, 1562/1574 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-04
Product exploration explored 100000 steps with 33440 reset in 440 ms.
Product exploration explored 100000 steps with 33320 reset in 450 ms.
Computed a total of 479 stabilizing places and 479 stable transitions
Computed a total of 479 stabilizing places and 479 stable transitions
Detected a total of 479/1562 stabilizing places and 479/1562 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 160 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (8 resets) in 249 ms. (160 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 1/1 properties
[2024-05-30 15:58:48] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/75 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1487/1562 variables, 156/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1562 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1562/3124 variables, 1562/1723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3124 variables, 0/1723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3124 variables, 0/1723 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3124/3124 variables, and 1723 constraints, problems are : Problem set: 0 solved, 1 unsolved in 658 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 1562/1562 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) 73/75 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1487/1562 variables, 156/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 15:58:49] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 3 ms to minimize.
[2024-05-30 15:58:49] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 3 ms to minimize.
[2024-05-30 15:58:49] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-05-30 15:58:49] [INFO ] Deduced a trap composed of 57 places in 102 ms of which 2 ms to minimize.
[2024-05-30 15:58:49] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 2 ms to minimize.
[2024-05-30 15:58:49] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1562 variables, 6/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1562 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1562/3124 variables, 1562/1729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3124 variables, 1/1730 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 15:58:50] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 4 ms to minimize.
[2024-05-30 15:58:50] [INFO ] Deduced a trap composed of 54 places in 192 ms of which 4 ms to minimize.
[2024-05-30 15:58:51] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 4 ms to minimize.
[2024-05-30 15:58:51] [INFO ] Deduced a trap composed of 32 places in 181 ms of which 4 ms to minimize.
[2024-05-30 15:58:51] [INFO ] Deduced a trap composed of 40 places in 176 ms of which 4 ms to minimize.
[2024-05-30 15:58:51] [INFO ] Deduced a trap composed of 49 places in 167 ms of which 4 ms to minimize.
[2024-05-30 15:58:51] [INFO ] Deduced a trap composed of 54 places in 164 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/3124 variables, 7/1737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3124 variables, 0/1737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/3124 variables, 0/1737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3124/3124 variables, and 1737 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3188 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 1562/1562 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 3856ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 336 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=168 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1)))
Knowledge based reduction with 8 factoid took 475 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-040B-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-040B-LTLFireability-04 finished in 67923 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)))'
Support contains 3 out of 1574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1564 transition count 1564
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1564 transition count 1564
Applied a total of 20 rules in 103 ms. Remains 1564 /1574 variables (removed 10) and now considering 1564/1574 (removed 10) transitions.
// Phase 1: matrix 1564 rows 1564 cols
[2024-05-30 15:58:52] [INFO ] Computed 161 invariants in 14 ms
[2024-05-30 15:58:53] [INFO ] Implicit Places using invariants in 382 ms returned []
[2024-05-30 15:58:53] [INFO ] Invariant cache hit.
[2024-05-30 15:58:54] [INFO ] Implicit Places using invariants and state equation in 1237 ms returned []
Implicit Place search using SMT with State Equation took 1621 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-05-30 15:58:54] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1563/3128 variables, and 0 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1564 constraints, PredecessorRefiner: 1563/1563 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1563/3128 variables, and 0 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1564 constraints, PredecessorRefiner: 0/1563 constraints, Known Traps: 0/0 constraints]
After SMT, in 60355ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 60370ms
Starting structural reductions in LTL mode, iteration 1 : 1564/1574 places, 1564/1574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62098 ms. Remains : 1564/1574 places, 1564/1574 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 371 ms.
Stack based approach found an accepted trace after 2625 steps with 0 reset with depth 2626 and stack size 2626 in 17 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-07 finished in 62587 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 1574 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 435 transitions
Trivial Post-agglo rules discarded 435 transitions
Performed 435 trivial Post agglomeration. Transition count delta: 435
Iterating post reduction 0 with 435 rules applied. Total rules applied 435 place count 1573 transition count 1138
Reduce places removed 435 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 436 rules applied. Total rules applied 871 place count 1138 transition count 1137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 872 place count 1137 transition count 1137
Performed 314 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 314 Pre rules applied. Total rules applied 872 place count 1137 transition count 823
Deduced a syphon composed of 314 places in 1 ms
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 3 with 628 rules applied. Total rules applied 1500 place count 823 transition count 823
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1510 place count 813 transition count 813
Iterating global reduction 3 with 10 rules applied. Total rules applied 1520 place count 813 transition count 813
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 1520 place count 813 transition count 804
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1538 place count 804 transition count 804
Performed 360 Post agglomeration using F-continuation condition.Transition count delta: 360
Deduced a syphon composed of 360 places in 0 ms
Reduce places removed 360 places and 0 transitions.
Iterating global reduction 3 with 720 rules applied. Total rules applied 2258 place count 444 transition count 444
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2259 place count 444 transition count 443
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2261 place count 443 transition count 442
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2463 place count 342 transition count 542
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 2497 place count 325 transition count 558
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2499 place count 323 transition count 556
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2500 place count 322 transition count 556
Applied a total of 2500 rules in 211 ms. Remains 322 /1574 variables (removed 1252) and now considering 556/1574 (removed 1018) transitions.
// Phase 1: matrix 556 rows 322 cols
[2024-05-30 15:59:55] [INFO ] Computed 160 invariants in 2 ms
[2024-05-30 15:59:55] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-30 15:59:55] [INFO ] Invariant cache hit.
[2024-05-30 15:59:55] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
[2024-05-30 15:59:56] [INFO ] Redundant transitions in 4 ms returned []
Running 552 sub problems to find dead transitions.
[2024-05-30 15:59:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 2 (OVERLAPS) 555/877 variables, 322/482 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/877 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 4 (OVERLAPS) 0/877 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 552 unsolved
No progress, stopping.
After SMT solving in domain Real declared 877/878 variables, and 482 constraints, problems are : Problem set: 0 solved, 552 unsolved in 21979 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 552/552 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 552 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 2 (OVERLAPS) 555/877 variables, 322/482 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/877 variables, 552/1034 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/877 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 5 (OVERLAPS) 0/877 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 552 unsolved
No progress, stopping.
After SMT solving in domain Int declared 877/878 variables, and 1034 constraints, problems are : Problem set: 0 solved, 552 unsolved in 23354 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 552/552 constraints, Known Traps: 0/0 constraints]
After SMT, in 45493ms problems are : Problem set: 0 solved, 552 unsolved
Search for dead transitions found 0 dead transitions in 45498ms
Starting structural reductions in SI_LTL mode, iteration 1 : 322/1574 places, 556/1574 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46322 ms. Remains : 322/1574 places, 556/1574 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-08
Product exploration explored 100000 steps with 35 reset in 510 ms.
Product exploration explored 100000 steps with 27 reset in 584 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 93 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 (14 resets) in 561 ms. (71 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (9 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 501116 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :0 out of 1
Probabilistic random walk after 501116 steps, saw 343027 distinct states, run finished after 3001 ms. (steps per millisecond=166 ) properties seen :0
[2024-05-30 16:00:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/15 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/47 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 33/80 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/80 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 22/102 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 22/124 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/124 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/124 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 22/146 variables, 8/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/146 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/146 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/168 variables, 8/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/168 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/168 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 22/190 variables, 8/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/190 variables, 4/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/190 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 22/212 variables, 8/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/212 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/212 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 22/234 variables, 8/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/234 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/234 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 22/256 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/256 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/256 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 22/278 variables, 8/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/278 variables, 4/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/278 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 22/300 variables, 8/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/300 variables, 4/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/300 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 22/322 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/322 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/322 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 22/344 variables, 8/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/344 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/344 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 22/366 variables, 8/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/366 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/366 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 22/388 variables, 8/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/388 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/388 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 22/410 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/410 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/410 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 22/432 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/432 variables, 4/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/432 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 22/454 variables, 8/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/454 variables, 4/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/454 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 22/476 variables, 8/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/476 variables, 4/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/476 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 22/498 variables, 8/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/498 variables, 4/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/498 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 22/520 variables, 8/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/520 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/520 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 22/542 variables, 8/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/542 variables, 4/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/542 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 22/564 variables, 8/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/564 variables, 4/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/564 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 22/586 variables, 8/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/586 variables, 4/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/586 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 22/608 variables, 8/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/608 variables, 4/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/608 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 22/630 variables, 8/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/630 variables, 4/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/630 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 22/652 variables, 8/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/652 variables, 4/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/652 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 22/674 variables, 8/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/674 variables, 4/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/674 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 22/696 variables, 8/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/696 variables, 4/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/696 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 22/718 variables, 8/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/718 variables, 4/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/718 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (OVERLAPS) 22/740 variables, 8/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/740 variables, 4/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/740 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (OVERLAPS) 22/762 variables, 8/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/762 variables, 4/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/762 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (OVERLAPS) 22/784 variables, 8/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/784 variables, 4/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/784 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (OVERLAPS) 22/806 variables, 8/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/806 variables, 4/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/806 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (OVERLAPS) 22/828 variables, 8/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/828 variables, 4/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/828 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (OVERLAPS) 22/850 variables, 8/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/850 variables, 4/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/850 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (OVERLAPS) 19/869 variables, 8/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/869 variables, 4/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/869 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (OVERLAPS) 8/877 variables, 4/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/877 variables, 2/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/877 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (OVERLAPS) 0/877 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 877/878 variables, and 482 constraints, problems are : Problem set: 0 solved, 1 unsolved in 629 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/15 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 32/47 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/47 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/80 variables, 14/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/80 variables, 7/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/80 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 22/102 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/102 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/124 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/124 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/124 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/146 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/146 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/146 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 22/168 variables, 8/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/168 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/168 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 22/190 variables, 8/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/190 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/190 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 22/212 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/212 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/212 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 22/234 variables, 8/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/234 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/234 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 22/256 variables, 8/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/256 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/256 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 22/278 variables, 8/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/278 variables, 4/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/278 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 22/300 variables, 8/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/300 variables, 4/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/300 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 22/322 variables, 8/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/322 variables, 4/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/322 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 22/344 variables, 8/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/344 variables, 4/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/344 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 22/366 variables, 8/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/366 variables, 4/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/366 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 22/388 variables, 8/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/388 variables, 4/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/388 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 22/410 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/410 variables, 4/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/410 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 22/432 variables, 8/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/432 variables, 4/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/432 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 22/454 variables, 8/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/454 variables, 4/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/454 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 22/476 variables, 8/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/476 variables, 4/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/476 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 22/498 variables, 8/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/498 variables, 4/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/498 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 22/520 variables, 8/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/520 variables, 4/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/520 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 22/542 variables, 8/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/542 variables, 4/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/542 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 22/564 variables, 8/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/564 variables, 4/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/564 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 22/586 variables, 8/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/586 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/586 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 22/608 variables, 8/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/608 variables, 4/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/608 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 22/630 variables, 8/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/630 variables, 4/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/630 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (OVERLAPS) 22/652 variables, 8/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/652 variables, 4/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/652 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 22/674 variables, 8/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/674 variables, 4/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/674 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (OVERLAPS) 22/696 variables, 8/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/696 variables, 4/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/696 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (OVERLAPS) 22/718 variables, 8/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/718 variables, 4/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/718 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 22/740 variables, 8/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/740 variables, 4/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/740 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (OVERLAPS) 22/762 variables, 8/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/762 variables, 4/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/762 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (OVERLAPS) 22/784 variables, 8/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/784 variables, 4/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/784 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (OVERLAPS) 22/806 variables, 8/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/806 variables, 4/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/806 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (OVERLAPS) 22/828 variables, 8/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/828 variables, 4/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/828 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (OVERLAPS) 22/850 variables, 8/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/850 variables, 4/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/850 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (OVERLAPS) 19/869 variables, 8/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/869 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/869 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (OVERLAPS) 8/877 variables, 4/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/877 variables, 2/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/877 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (OVERLAPS) 0/877 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 877/878 variables, and 483 constraints, problems are : Problem set: 0 solved, 1 unsolved in 459 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1102ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 556/556 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 322 transition count 555
Applied a total of 1 rules in 10 ms. Remains 322 /322 variables (removed 0) and now considering 555/556 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 322/322 places, 555/556 transitions.
RANDOM walk for 40000 steps (14 resets) in 267 ms. (149 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (9 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 512494 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :0 out of 1
Probabilistic random walk after 512494 steps, saw 357618 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
// Phase 1: matrix 555 rows 322 cols
[2024-05-30 16:00:50] [INFO ] Computed 160 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/15 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/47 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 33/80 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/80 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 22/102 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 22/124 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/124 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/124 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 22/146 variables, 8/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/146 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/146 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/168 variables, 8/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/168 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/168 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 22/190 variables, 8/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/190 variables, 4/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/190 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 22/212 variables, 8/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/212 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/212 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 22/234 variables, 8/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/234 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/234 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 22/256 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/256 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/256 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 22/278 variables, 8/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/278 variables, 4/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/278 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 22/300 variables, 8/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/300 variables, 4/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/300 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 22/322 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/322 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/322 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 22/344 variables, 8/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/344 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/344 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 22/366 variables, 8/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/366 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/366 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 22/388 variables, 8/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/388 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/388 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 22/410 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/410 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/410 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 22/432 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/432 variables, 4/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/432 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 22/454 variables, 8/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/454 variables, 4/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/454 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 22/476 variables, 8/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/476 variables, 4/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/476 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 22/498 variables, 8/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/498 variables, 4/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/498 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 22/520 variables, 8/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/520 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/520 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 22/542 variables, 8/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/542 variables, 4/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/542 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 22/564 variables, 8/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/564 variables, 4/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/564 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 22/586 variables, 8/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/586 variables, 4/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/586 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 22/608 variables, 8/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/608 variables, 4/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/608 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 22/630 variables, 8/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/630 variables, 4/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/630 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 22/652 variables, 8/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/652 variables, 4/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/652 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 22/674 variables, 8/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/674 variables, 4/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/674 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 22/696 variables, 8/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/696 variables, 4/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/696 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 22/718 variables, 8/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/718 variables, 4/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/718 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (OVERLAPS) 22/740 variables, 8/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/740 variables, 4/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/740 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (OVERLAPS) 22/762 variables, 8/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/762 variables, 4/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/762 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (OVERLAPS) 22/784 variables, 8/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/784 variables, 4/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/784 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (OVERLAPS) 22/806 variables, 8/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/806 variables, 4/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/806 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (OVERLAPS) 22/828 variables, 8/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/828 variables, 4/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/828 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (OVERLAPS) 22/850 variables, 8/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/850 variables, 4/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/850 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (OVERLAPS) 19/869 variables, 8/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/869 variables, 4/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/869 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (OVERLAPS) 8/877 variables, 4/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/877 variables, 2/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/877 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (OVERLAPS) 0/877 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 877/877 variables, and 482 constraints, problems are : Problem set: 0 solved, 1 unsolved in 667 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/15 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 32/47 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/47 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/80 variables, 14/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/80 variables, 7/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/80 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 22/102 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/102 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/124 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/124 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/124 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/146 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/146 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/146 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 22/168 variables, 8/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/168 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/168 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 22/190 variables, 8/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/190 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/190 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 22/212 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/212 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/212 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 22/234 variables, 8/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/234 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/234 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 22/256 variables, 8/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/256 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/256 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 22/278 variables, 8/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/278 variables, 4/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/278 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 22/300 variables, 8/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/300 variables, 4/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/300 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 22/322 variables, 8/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/322 variables, 4/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/322 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 22/344 variables, 8/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/344 variables, 4/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/344 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 22/366 variables, 8/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/366 variables, 4/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/366 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 22/388 variables, 8/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/388 variables, 4/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/388 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 22/410 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/410 variables, 4/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/410 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 22/432 variables, 8/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/432 variables, 4/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/432 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 22/454 variables, 8/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/454 variables, 4/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/454 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 22/476 variables, 8/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/476 variables, 4/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/476 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 22/498 variables, 8/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/498 variables, 4/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/498 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 22/520 variables, 8/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/520 variables, 4/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/520 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 22/542 variables, 8/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/542 variables, 4/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/542 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 22/564 variables, 8/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/564 variables, 4/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/564 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 22/586 variables, 8/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/586 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/586 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 22/608 variables, 8/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/608 variables, 4/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/608 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 22/630 variables, 8/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/630 variables, 4/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/630 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (OVERLAPS) 22/652 variables, 8/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/652 variables, 4/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/652 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 22/674 variables, 8/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/674 variables, 4/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/674 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (OVERLAPS) 22/696 variables, 8/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/696 variables, 4/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/696 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (OVERLAPS) 22/718 variables, 8/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/718 variables, 4/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/718 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 22/740 variables, 8/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/740 variables, 4/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/740 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (OVERLAPS) 22/762 variables, 8/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/762 variables, 4/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/762 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (OVERLAPS) 22/784 variables, 8/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/784 variables, 4/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/784 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (OVERLAPS) 22/806 variables, 8/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/806 variables, 4/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/806 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (OVERLAPS) 22/828 variables, 8/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/828 variables, 4/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/828 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (OVERLAPS) 22/850 variables, 8/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/850 variables, 4/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/850 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (OVERLAPS) 19/869 variables, 8/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/869 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/869 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (OVERLAPS) 8/877 variables, 4/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/877 variables, 2/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/877 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (OVERLAPS) 0/877 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 877/877 variables, and 483 constraints, problems are : Problem set: 0 solved, 1 unsolved in 470 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1146ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 555/555 transitions.
Applied a total of 0 rules in 8 ms. Remains 322 /322 variables (removed 0) and now considering 555/555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 322/322 places, 555/555 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 555/555 transitions.
Applied a total of 0 rules in 10 ms. Remains 322 /322 variables (removed 0) and now considering 555/555 (removed 0) transitions.
[2024-05-30 16:00:51] [INFO ] Invariant cache hit.
[2024-05-30 16:00:51] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-30 16:00:51] [INFO ] Invariant cache hit.
[2024-05-30 16:00:51] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2024-05-30 16:00:51] [INFO ] Redundant transitions in 3 ms returned []
Running 552 sub problems to find dead transitions.
[2024-05-30 16:00:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 2 (OVERLAPS) 555/877 variables, 322/482 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/877 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 4 (OVERLAPS) 0/877 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 552 unsolved
No progress, stopping.
After SMT solving in domain Real declared 877/877 variables, and 482 constraints, problems are : Problem set: 0 solved, 552 unsolved in 22044 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 552/552 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 552 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 2 (OVERLAPS) 555/877 variables, 322/482 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/877 variables, 552/1034 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/877 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 5 (OVERLAPS) 0/877 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 552 unsolved
No progress, stopping.
After SMT solving in domain Int declared 877/877 variables, and 1034 constraints, problems are : Problem set: 0 solved, 552 unsolved in 23727 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 552/552 constraints, Known Traps: 0/0 constraints]
After SMT, in 45965ms problems are : Problem set: 0 solved, 552 unsolved
Search for dead transitions found 0 dead transitions in 45972ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46522 ms. Remains : 322/322 places, 555/555 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 159 edges and 322 vertex of which 4 / 322 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1102 edges and 320 vertex of which 318 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 156 edges and 316 vertex of which 4 / 316 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 314 transition count 546
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 155 edges and 312 vertex of which 6 / 312 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 309 transition count 537
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 153 edges and 306 vertex of which 8 / 306 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 302 transition count 526
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 149 edges and 298 vertex of which 8 / 298 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 294 transition count 512
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 145 edges and 290 vertex of which 8 / 290 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 286 transition count 498
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 141 edges and 282 vertex of which 8 / 282 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 278 transition count 484
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 137 edges and 274 vertex of which 8 / 274 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 270 transition count 470
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 133 edges and 266 vertex of which 8 / 266 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 262 transition count 456
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 129 edges and 258 vertex of which 8 / 258 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 254 transition count 442
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 125 edges and 250 vertex of which 8 / 250 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 246 transition count 428
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 121 edges and 242 vertex of which 8 / 242 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 238 transition count 414
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 117 edges and 234 vertex of which 8 / 234 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 230 transition count 400
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 113 edges and 226 vertex of which 8 / 226 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 222 transition count 386
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 109 edges and 218 vertex of which 8 / 218 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 214 transition count 372
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 105 edges and 210 vertex of which 8 / 210 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 206 transition count 358
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 101 edges and 202 vertex of which 8 / 202 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 198 transition count 344
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 97 edges and 194 vertex of which 8 / 194 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 190 transition count 330
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 93 edges and 186 vertex of which 8 / 186 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 182 transition count 316
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 89 edges and 178 vertex of which 8 / 178 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 174 transition count 302
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 85 edges and 170 vertex of which 8 / 170 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 166 transition count 288
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 81 edges and 162 vertex of which 8 / 162 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 158 transition count 274
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 77 edges and 154 vertex of which 8 / 154 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 150 transition count 260
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 73 edges and 146 vertex of which 8 / 146 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 142 transition count 246
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 69 edges and 138 vertex of which 8 / 138 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 134 transition count 232
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 65 edges and 130 vertex of which 8 / 130 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 453 place count 126 transition count 218
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 61 edges and 122 vertex of which 8 / 122 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 472 place count 118 transition count 204
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 57 edges and 114 vertex of which 8 / 114 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 491 place count 110 transition count 190
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 53 edges and 106 vertex of which 8 / 106 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 510 place count 102 transition count 176
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 49 edges and 98 vertex of which 8 / 98 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 529 place count 94 transition count 162
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 45 edges and 90 vertex of which 8 / 90 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 548 place count 86 transition count 148
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 41 edges and 82 vertex of which 8 / 82 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 567 place count 78 transition count 134
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 37 edges and 74 vertex of which 8 / 74 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 586 place count 70 transition count 120
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 33 edges and 66 vertex of which 8 / 66 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 605 place count 62 transition count 106
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 29 edges and 58 vertex of which 8 / 58 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 33 with 19 rules applied. Total rules applied 624 place count 54 transition count 92
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 25 edges and 50 vertex of which 8 / 50 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 19 rules applied. Total rules applied 643 place count 46 transition count 78
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 21 edges and 42 vertex of which 8 / 42 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 19 rules applied. Total rules applied 662 place count 38 transition count 64
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 17 edges and 34 vertex of which 6 / 34 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 681 place count 31 transition count 50
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 13 edges and 28 vertex of which 4 / 28 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 37 with 14 rules applied. Total rules applied 695 place count 26 transition count 40
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 10 edges and 24 vertex of which 2 / 24 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 38 with 9 rules applied. Total rules applied 704 place count 23 transition count 34
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 39 with 5 rules applied. Total rules applied 709 place count 22 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 40 with 1 Pre rules applied. Total rules applied 709 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 40 with 3 rules applied. Total rules applied 712 place count 20 transition count 29
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 40 with 3 rules applied. Total rules applied 715 place count 18 transition count 28
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 40 with 3 rules applied. Total rules applied 718 place count 18 transition count 25
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 41 with 1 rules applied. Total rules applied 719 place count 18 transition count 24
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 41 with 1 rules applied. Total rules applied 720 place count 18 transition count 24
Applied a total of 720 rules in 32 ms. Remains 18 /322 variables (removed 304) and now considering 24/555 (removed 531) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 24 rows 18 cols
[2024-05-30 16:01:37] [INFO ] Computed 8 invariants in 0 ms
[2024-05-30 16:01:38] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-30 16:01:38] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 16:01:38] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-30 16:01:38] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 16:01:38] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-30 16:01:38] [INFO ] After 81ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 175 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 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)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 1 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 556/556 transitions.
Applied a total of 0 rules in 10 ms. Remains 322 /322 variables (removed 0) and now considering 556/556 (removed 0) transitions.
// Phase 1: matrix 556 rows 322 cols
[2024-05-30 16:01:38] [INFO ] Computed 160 invariants in 3 ms
[2024-05-30 16:01:38] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-30 16:01:38] [INFO ] Invariant cache hit.
[2024-05-30 16:01:38] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
[2024-05-30 16:01:39] [INFO ] Redundant transitions in 3 ms returned []
Running 552 sub problems to find dead transitions.
[2024-05-30 16:01:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 2 (OVERLAPS) 555/877 variables, 322/482 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/877 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 4 (OVERLAPS) 0/877 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 552 unsolved
No progress, stopping.
After SMT solving in domain Real declared 877/878 variables, and 482 constraints, problems are : Problem set: 0 solved, 552 unsolved in 22708 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 552/552 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 552 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 2 (OVERLAPS) 555/877 variables, 322/482 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/877 variables, 552/1034 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/877 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 5 (OVERLAPS) 0/877 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 552 unsolved
No progress, stopping.
After SMT solving in domain Int declared 877/878 variables, and 1034 constraints, problems are : Problem set: 0 solved, 552 unsolved in 23417 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 552/552 constraints, Known Traps: 0/0 constraints]
After SMT, in 46284ms problems are : Problem set: 0 solved, 552 unsolved
Search for dead transitions found 0 dead transitions in 46289ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 47042 ms. Remains : 322/322 places, 556/556 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 84 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)]
RANDOM walk for 40000 steps (11 resets) in 257 ms. (155 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 512786 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :0 out of 1
Probabilistic random walk after 512786 steps, saw 351320 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
[2024-05-30 16:02:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/15 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/47 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 33/80 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/80 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 22/102 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 22/124 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/124 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/124 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 22/146 variables, 8/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/146 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/146 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/168 variables, 8/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/168 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/168 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 22/190 variables, 8/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/190 variables, 4/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/190 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 22/212 variables, 8/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/212 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/212 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 22/234 variables, 8/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/234 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/234 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 22/256 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/256 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/256 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 22/278 variables, 8/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/278 variables, 4/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/278 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 22/300 variables, 8/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/300 variables, 4/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/300 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 22/322 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/322 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/322 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 22/344 variables, 8/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/344 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/344 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 22/366 variables, 8/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/366 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/366 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 22/388 variables, 8/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/388 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/388 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 22/410 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/410 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/410 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 22/432 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/432 variables, 4/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/432 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 22/454 variables, 8/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/454 variables, 4/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/454 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 22/476 variables, 8/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/476 variables, 4/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/476 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 22/498 variables, 8/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/498 variables, 4/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/498 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 22/520 variables, 8/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/520 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/520 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 22/542 variables, 8/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/542 variables, 4/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/542 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 22/564 variables, 8/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/564 variables, 4/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/564 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 22/586 variables, 8/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/586 variables, 4/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/586 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 22/608 variables, 8/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/608 variables, 4/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/608 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 22/630 variables, 8/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/630 variables, 4/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/630 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 22/652 variables, 8/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/652 variables, 4/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/652 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 22/674 variables, 8/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/674 variables, 4/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/674 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 22/696 variables, 8/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/696 variables, 4/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/696 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 22/718 variables, 8/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/718 variables, 4/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/718 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (OVERLAPS) 22/740 variables, 8/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/740 variables, 4/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/740 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (OVERLAPS) 22/762 variables, 8/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/762 variables, 4/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/762 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (OVERLAPS) 22/784 variables, 8/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/784 variables, 4/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/784 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (OVERLAPS) 22/806 variables, 8/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/806 variables, 4/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/806 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (OVERLAPS) 22/828 variables, 8/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/828 variables, 4/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/828 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (OVERLAPS) 22/850 variables, 8/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/850 variables, 4/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/850 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (OVERLAPS) 19/869 variables, 8/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/869 variables, 4/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/869 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (OVERLAPS) 8/877 variables, 4/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/877 variables, 2/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/877 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (OVERLAPS) 0/877 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 877/878 variables, and 482 constraints, problems are : Problem set: 0 solved, 1 unsolved in 642 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/15 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 32/47 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/47 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/80 variables, 14/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/80 variables, 7/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/80 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 22/102 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/102 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/124 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/124 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/124 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/146 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/146 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/146 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 22/168 variables, 8/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/168 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/168 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 22/190 variables, 8/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/190 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/190 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 22/212 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/212 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/212 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 22/234 variables, 8/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/234 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/234 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 22/256 variables, 8/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/256 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/256 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 22/278 variables, 8/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/278 variables, 4/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/278 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 22/300 variables, 8/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/300 variables, 4/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/300 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 22/322 variables, 8/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/322 variables, 4/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/322 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 22/344 variables, 8/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/344 variables, 4/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/344 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 22/366 variables, 8/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/366 variables, 4/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/366 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 22/388 variables, 8/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/388 variables, 4/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/388 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 22/410 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/410 variables, 4/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/410 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 22/432 variables, 8/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/432 variables, 4/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/432 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 22/454 variables, 8/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/454 variables, 4/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/454 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 22/476 variables, 8/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/476 variables, 4/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/476 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 22/498 variables, 8/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/498 variables, 4/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/498 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 22/520 variables, 8/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/520 variables, 4/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/520 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 22/542 variables, 8/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/542 variables, 4/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/542 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 22/564 variables, 8/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/564 variables, 4/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/564 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 22/586 variables, 8/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/586 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/586 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 22/608 variables, 8/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/608 variables, 4/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/608 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 22/630 variables, 8/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/630 variables, 4/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/630 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (OVERLAPS) 22/652 variables, 8/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/652 variables, 4/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/652 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 22/674 variables, 8/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/674 variables, 4/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/674 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (OVERLAPS) 22/696 variables, 8/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/696 variables, 4/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/696 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (OVERLAPS) 22/718 variables, 8/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/718 variables, 4/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/718 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 22/740 variables, 8/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/740 variables, 4/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/740 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (OVERLAPS) 22/762 variables, 8/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/762 variables, 4/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/762 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (OVERLAPS) 22/784 variables, 8/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/784 variables, 4/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/784 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (OVERLAPS) 22/806 variables, 8/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/806 variables, 4/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/806 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (OVERLAPS) 22/828 variables, 8/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/828 variables, 4/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/828 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (OVERLAPS) 22/850 variables, 8/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/850 variables, 4/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/850 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (OVERLAPS) 19/869 variables, 8/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/869 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/869 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (OVERLAPS) 8/877 variables, 4/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/877 variables, 2/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/877 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (OVERLAPS) 0/877 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 877/878 variables, and 483 constraints, problems are : Problem set: 0 solved, 1 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1120ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 556/556 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 322 transition count 555
Applied a total of 1 rules in 21 ms. Remains 322 /322 variables (removed 0) and now considering 555/556 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 322/322 places, 555/556 transitions.
RANDOM walk for 40000 steps (17 resets) in 329 ms. (121 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (9 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 533055 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :0 out of 1
Probabilistic random walk after 533055 steps, saw 371861 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
// Phase 1: matrix 555 rows 322 cols
[2024-05-30 16:02:32] [INFO ] Computed 160 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/15 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/47 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 33/80 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 7/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/80 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 22/102 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 22/124 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/124 variables, 4/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/124 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 22/146 variables, 8/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/146 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/146 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 22/168 variables, 8/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/168 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/168 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 22/190 variables, 8/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/190 variables, 4/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/190 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 22/212 variables, 8/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/212 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/212 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 22/234 variables, 8/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/234 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/234 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 22/256 variables, 8/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/256 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/256 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 22/278 variables, 8/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/278 variables, 4/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/278 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 22/300 variables, 8/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/300 variables, 4/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/300 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 22/322 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/322 variables, 4/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/322 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 22/344 variables, 8/184 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/344 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/344 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 22/366 variables, 8/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/366 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/366 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 22/388 variables, 8/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/388 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/388 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 22/410 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/410 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/410 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 22/432 variables, 8/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/432 variables, 4/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/432 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 22/454 variables, 8/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/454 variables, 4/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/454 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 22/476 variables, 8/256 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/476 variables, 4/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/476 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 22/498 variables, 8/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/498 variables, 4/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/498 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 22/520 variables, 8/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/520 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/520 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 22/542 variables, 8/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/542 variables, 4/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/542 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 22/564 variables, 8/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/564 variables, 4/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/564 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 22/586 variables, 8/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/586 variables, 4/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/586 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 22/608 variables, 8/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/608 variables, 4/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/608 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 22/630 variables, 8/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/630 variables, 4/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/630 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 22/652 variables, 8/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/652 variables, 4/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/652 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 22/674 variables, 8/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/674 variables, 4/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/674 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 22/696 variables, 8/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/696 variables, 4/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/696 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 22/718 variables, 8/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (INCLUDED_ONLY) 0/718 variables, 4/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/718 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (OVERLAPS) 22/740 variables, 8/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (INCLUDED_ONLY) 0/740 variables, 4/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/740 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (OVERLAPS) 22/762 variables, 8/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (INCLUDED_ONLY) 0/762 variables, 4/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/762 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (OVERLAPS) 22/784 variables, 8/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (INCLUDED_ONLY) 0/784 variables, 4/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/784 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (OVERLAPS) 22/806 variables, 8/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (INCLUDED_ONLY) 0/806 variables, 4/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/806 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (OVERLAPS) 22/828 variables, 8/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (INCLUDED_ONLY) 0/828 variables, 4/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/828 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (OVERLAPS) 22/850 variables, 8/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (INCLUDED_ONLY) 0/850 variables, 4/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/850 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (OVERLAPS) 19/869 variables, 8/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (INCLUDED_ONLY) 0/869 variables, 4/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/869 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (OVERLAPS) 8/877 variables, 4/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (INCLUDED_ONLY) 0/877 variables, 2/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/877 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (OVERLAPS) 0/877 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 877/877 variables, and 482 constraints, problems are : Problem set: 0 solved, 1 unsolved in 837 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/15 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 32/47 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/47 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 33/80 variables, 14/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/80 variables, 7/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/80 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 22/102 variables, 8/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/102 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/102 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/124 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/124 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/124 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/146 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/146 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/146 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 22/168 variables, 8/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/168 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/168 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 22/190 variables, 8/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/190 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/190 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 22/212 variables, 8/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/212 variables, 4/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/212 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 22/234 variables, 8/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/234 variables, 4/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/234 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 22/256 variables, 8/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/256 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/256 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 22/278 variables, 8/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/278 variables, 4/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/278 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 22/300 variables, 8/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/300 variables, 4/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/300 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 22/322 variables, 8/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/322 variables, 4/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/322 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 22/344 variables, 8/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/344 variables, 4/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/344 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 22/366 variables, 8/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/366 variables, 4/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/366 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 22/388 variables, 8/209 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/388 variables, 4/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/388 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 22/410 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/410 variables, 4/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/410 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 22/432 variables, 8/233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/432 variables, 4/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/432 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 22/454 variables, 8/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/454 variables, 4/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/454 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 22/476 variables, 8/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/476 variables, 4/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/476 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 22/498 variables, 8/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/498 variables, 4/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/498 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 22/520 variables, 8/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/520 variables, 4/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/520 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 22/542 variables, 8/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/542 variables, 4/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/542 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 22/564 variables, 8/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/564 variables, 4/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/564 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 22/586 variables, 8/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/586 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/586 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 22/608 variables, 8/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/608 variables, 4/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/608 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 22/630 variables, 8/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/630 variables, 4/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/630 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (OVERLAPS) 22/652 variables, 8/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/652 variables, 4/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/652 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 22/674 variables, 8/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/674 variables, 4/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/674 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (OVERLAPS) 22/696 variables, 8/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/696 variables, 4/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (INCLUDED_ONLY) 0/696 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 96 (OVERLAPS) 22/718 variables, 8/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 97 (INCLUDED_ONLY) 0/718 variables, 4/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 98 (INCLUDED_ONLY) 0/718 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 99 (OVERLAPS) 22/740 variables, 8/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 100 (INCLUDED_ONLY) 0/740 variables, 4/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 101 (INCLUDED_ONLY) 0/740 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 102 (OVERLAPS) 22/762 variables, 8/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 103 (INCLUDED_ONLY) 0/762 variables, 4/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 104 (INCLUDED_ONLY) 0/762 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 105 (OVERLAPS) 22/784 variables, 8/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 106 (INCLUDED_ONLY) 0/784 variables, 4/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 107 (INCLUDED_ONLY) 0/784 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 108 (OVERLAPS) 22/806 variables, 8/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 109 (INCLUDED_ONLY) 0/806 variables, 4/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 110 (INCLUDED_ONLY) 0/806 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 111 (OVERLAPS) 22/828 variables, 8/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 112 (INCLUDED_ONLY) 0/828 variables, 4/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 113 (INCLUDED_ONLY) 0/828 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 114 (OVERLAPS) 22/850 variables, 8/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 115 (INCLUDED_ONLY) 0/850 variables, 4/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 116 (INCLUDED_ONLY) 0/850 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 117 (OVERLAPS) 19/869 variables, 8/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 118 (INCLUDED_ONLY) 0/869 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 119 (INCLUDED_ONLY) 0/869 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 120 (OVERLAPS) 8/877 variables, 4/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 121 (INCLUDED_ONLY) 0/877 variables, 2/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 122 (INCLUDED_ONLY) 0/877 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 123 (OVERLAPS) 0/877 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 877/877 variables, and 483 constraints, problems are : Problem set: 0 solved, 1 unsolved in 509 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1360ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 555/555 transitions.
Applied a total of 0 rules in 8 ms. Remains 322 /322 variables (removed 0) and now considering 555/555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 322/322 places, 555/555 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 555/555 transitions.
Applied a total of 0 rules in 7 ms. Remains 322 /322 variables (removed 0) and now considering 555/555 (removed 0) transitions.
[2024-05-30 16:02:34] [INFO ] Invariant cache hit.
[2024-05-30 16:02:34] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-30 16:02:34] [INFO ] Invariant cache hit.
[2024-05-30 16:02:34] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
[2024-05-30 16:02:34] [INFO ] Redundant transitions in 4 ms returned []
Running 552 sub problems to find dead transitions.
[2024-05-30 16:02:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 2 (OVERLAPS) 555/877 variables, 322/482 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/877 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 4 (OVERLAPS) 0/877 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 552 unsolved
No progress, stopping.
After SMT solving in domain Real declared 877/877 variables, and 482 constraints, problems are : Problem set: 0 solved, 552 unsolved in 22782 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 552/552 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 552 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 2 (OVERLAPS) 555/877 variables, 322/482 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/877 variables, 552/1034 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/877 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 5 (OVERLAPS) 0/877 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 552 unsolved
No progress, stopping.
After SMT solving in domain Int declared 877/877 variables, and 1034 constraints, problems are : Problem set: 0 solved, 552 unsolved in 23443 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 552/552 constraints, Known Traps: 0/0 constraints]
After SMT, in 46405ms problems are : Problem set: 0 solved, 552 unsolved
Search for dead transitions found 0 dead transitions in 46411ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46968 ms. Remains : 322/322 places, 555/555 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 159 edges and 322 vertex of which 4 / 322 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1102 edges and 320 vertex of which 318 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 156 edges and 316 vertex of which 4 / 316 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 314 transition count 546
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 155 edges and 312 vertex of which 6 / 312 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 309 transition count 537
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 153 edges and 306 vertex of which 8 / 306 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 302 transition count 526
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 149 edges and 298 vertex of which 8 / 298 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 294 transition count 512
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 145 edges and 290 vertex of which 8 / 290 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 286 transition count 498
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 141 edges and 282 vertex of which 8 / 282 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 278 transition count 484
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 137 edges and 274 vertex of which 8 / 274 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 270 transition count 470
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 133 edges and 266 vertex of which 8 / 266 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 262 transition count 456
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 129 edges and 258 vertex of which 8 / 258 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 254 transition count 442
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 125 edges and 250 vertex of which 8 / 250 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 246 transition count 428
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 121 edges and 242 vertex of which 8 / 242 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 238 transition count 414
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 117 edges and 234 vertex of which 8 / 234 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 230 transition count 400
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 113 edges and 226 vertex of which 8 / 226 are part of one of the 4 SCC in 2 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 222 transition count 386
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 109 edges and 218 vertex of which 8 / 218 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 214 transition count 372
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 105 edges and 210 vertex of which 8 / 210 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 206 transition count 358
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 101 edges and 202 vertex of which 8 / 202 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 198 transition count 344
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 97 edges and 194 vertex of which 8 / 194 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 301 place count 190 transition count 330
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 93 edges and 186 vertex of which 8 / 186 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 17 with 19 rules applied. Total rules applied 320 place count 182 transition count 316
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 89 edges and 178 vertex of which 8 / 178 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 174 transition count 302
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 85 edges and 170 vertex of which 8 / 170 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 19 rules applied. Total rules applied 358 place count 166 transition count 288
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 81 edges and 162 vertex of which 8 / 162 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 377 place count 158 transition count 274
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 77 edges and 154 vertex of which 8 / 154 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 396 place count 150 transition count 260
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 73 edges and 146 vertex of which 8 / 146 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 415 place count 142 transition count 246
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 69 edges and 138 vertex of which 8 / 138 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 434 place count 134 transition count 232
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 65 edges and 130 vertex of which 8 / 130 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 453 place count 126 transition count 218
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 61 edges and 122 vertex of which 8 / 122 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 472 place count 118 transition count 204
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 57 edges and 114 vertex of which 8 / 114 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 491 place count 110 transition count 190
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 53 edges and 106 vertex of which 8 / 106 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 27 with 19 rules applied. Total rules applied 510 place count 102 transition count 176
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 49 edges and 98 vertex of which 8 / 98 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 28 with 19 rules applied. Total rules applied 529 place count 94 transition count 162
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 45 edges and 90 vertex of which 8 / 90 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 29 with 19 rules applied. Total rules applied 548 place count 86 transition count 148
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 41 edges and 82 vertex of which 8 / 82 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 30 with 19 rules applied. Total rules applied 567 place count 78 transition count 134
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 37 edges and 74 vertex of which 8 / 74 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 31 with 19 rules applied. Total rules applied 586 place count 70 transition count 120
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 33 edges and 66 vertex of which 8 / 66 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 32 with 19 rules applied. Total rules applied 605 place count 62 transition count 106
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 29 edges and 58 vertex of which 8 / 58 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 33 with 19 rules applied. Total rules applied 624 place count 54 transition count 92
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 25 edges and 50 vertex of which 8 / 50 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 34 with 19 rules applied. Total rules applied 643 place count 46 transition count 78
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 21 edges and 42 vertex of which 8 / 42 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 35 with 19 rules applied. Total rules applied 662 place count 38 transition count 64
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 17 edges and 34 vertex of which 6 / 34 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 36 with 19 rules applied. Total rules applied 681 place count 31 transition count 50
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 13 edges and 28 vertex of which 4 / 28 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 37 with 14 rules applied. Total rules applied 695 place count 26 transition count 40
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 10 edges and 24 vertex of which 2 / 24 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 38 with 9 rules applied. Total rules applied 704 place count 23 transition count 34
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 39 with 5 rules applied. Total rules applied 709 place count 22 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 40 with 1 Pre rules applied. Total rules applied 709 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 40 with 3 rules applied. Total rules applied 712 place count 20 transition count 29
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 40 with 3 rules applied. Total rules applied 715 place count 18 transition count 28
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 40 with 3 rules applied. Total rules applied 718 place count 18 transition count 25
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 41 with 1 rules applied. Total rules applied 719 place count 18 transition count 24
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 41 with 1 rules applied. Total rules applied 720 place count 18 transition count 24
Applied a total of 720 rules in 44 ms. Remains 18 /322 variables (removed 304) and now considering 24/555 (removed 531) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 24 rows 18 cols
[2024-05-30 16:03:21] [INFO ] Computed 8 invariants in 0 ms
[2024-05-30 16:03:21] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-30 16:03:21] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 16:03:21] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-30 16:03:21] [INFO ] After 7ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 16:03:21] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-30 16:03:21] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 165 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 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 55 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 35 reset in 482 ms.
Product exploration explored 100000 steps with 17 reset in 566 ms.
Support contains 1 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 556/556 transitions.
Applied a total of 0 rules in 7 ms. Remains 322 /322 variables (removed 0) and now considering 556/556 (removed 0) transitions.
// Phase 1: matrix 556 rows 322 cols
[2024-05-30 16:03:22] [INFO ] Computed 160 invariants in 2 ms
[2024-05-30 16:03:22] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-30 16:03:22] [INFO ] Invariant cache hit.
[2024-05-30 16:03:23] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 556 ms to find 0 implicit places.
[2024-05-30 16:03:23] [INFO ] Redundant transitions in 4 ms returned []
Running 552 sub problems to find dead transitions.
[2024-05-30 16:03:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 2 (OVERLAPS) 555/877 variables, 322/482 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/877 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 4 (OVERLAPS) 0/877 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 552 unsolved
No progress, stopping.
After SMT solving in domain Real declared 877/878 variables, and 482 constraints, problems are : Problem set: 0 solved, 552 unsolved in 22256 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 552/552 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 552 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 2 (OVERLAPS) 555/877 variables, 322/482 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/877 variables, 552/1034 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/877 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 5 (OVERLAPS) 0/877 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 552 unsolved
No progress, stopping.
After SMT solving in domain Int declared 877/878 variables, and 1034 constraints, problems are : Problem set: 0 solved, 552 unsolved in 23822 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 552/552 constraints, Known Traps: 0/0 constraints]
After SMT, in 46225ms problems are : Problem set: 0 solved, 552 unsolved
Search for dead transitions found 0 dead transitions in 46233ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 46812 ms. Remains : 322/322 places, 556/556 transitions.
Treatment of property ShieldRVt-PT-040B-LTLFireability-08 finished in 254397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1574 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 437 transitions
Trivial Post-agglo rules discarded 437 transitions
Performed 437 trivial Post agglomeration. Transition count delta: 437
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 1573 transition count 1136
Reduce places removed 437 places and 0 transitions.
Iterating post reduction 1 with 437 rules applied. Total rules applied 874 place count 1136 transition count 1136
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 313 Pre rules applied. Total rules applied 874 place count 1136 transition count 823
Deduced a syphon composed of 313 places in 1 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 2 with 626 rules applied. Total rules applied 1500 place count 823 transition count 823
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1510 place count 813 transition count 813
Iterating global reduction 2 with 10 rules applied. Total rules applied 1520 place count 813 transition count 813
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 1520 place count 813 transition count 804
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 1538 place count 804 transition count 804
Performed 360 Post agglomeration using F-continuation condition.Transition count delta: 360
Deduced a syphon composed of 360 places in 0 ms
Reduce places removed 360 places and 0 transitions.
Iterating global reduction 2 with 720 rules applied. Total rules applied 2258 place count 444 transition count 444
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2259 place count 444 transition count 443
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2261 place count 443 transition count 442
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2463 place count 342 transition count 542
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 2499 place count 324 transition count 560
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2501 place count 322 transition count 558
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2502 place count 321 transition count 558
Applied a total of 2502 rules in 199 ms. Remains 321 /1574 variables (removed 1253) and now considering 558/1574 (removed 1016) transitions.
// Phase 1: matrix 558 rows 321 cols
[2024-05-30 16:04:09] [INFO ] Computed 160 invariants in 1 ms
[2024-05-30 16:04:10] [INFO ] Implicit Places using invariants in 415 ms returned []
[2024-05-30 16:04:10] [INFO ] Invariant cache hit.
[2024-05-30 16:04:10] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
[2024-05-30 16:04:10] [INFO ] Redundant transitions in 4 ms returned []
Running 554 sub problems to find dead transitions.
[2024-05-30 16:04:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (OVERLAPS) 557/878 variables, 321/481 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/878 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 4 (OVERLAPS) 0/878 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 554 unsolved
No progress, stopping.
After SMT solving in domain Real declared 878/879 variables, and 481 constraints, problems are : Problem set: 0 solved, 554 unsolved in 19266 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 554 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (OVERLAPS) 557/878 variables, 321/481 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/878 variables, 554/1035 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/878 variables, 0/1035 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 5 (OVERLAPS) 0/878 variables, 0/1035 constraints. Problems are: Problem set: 0 solved, 554 unsolved
No progress, stopping.
After SMT solving in domain Int declared 878/879 variables, and 1035 constraints, problems are : Problem set: 0 solved, 554 unsolved in 23304 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 321/321 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 0/0 constraints]
After SMT, in 42731ms problems are : Problem set: 0 solved, 554 unsolved
Search for dead transitions found 0 dead transitions in 42736ms
Starting structural reductions in SI_LTL mode, iteration 1 : 321/1574 places, 558/1574 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43714 ms. Remains : 321/1574 places, 558/1574 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-09 finished in 43808 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((G(p1) U (p0&&G(p1))))))))'
Support contains 2 out of 1574 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 435 transitions
Trivial Post-agglo rules discarded 435 transitions
Performed 435 trivial Post agglomeration. Transition count delta: 435
Iterating post reduction 0 with 435 rules applied. Total rules applied 435 place count 1573 transition count 1138
Reduce places removed 435 places and 0 transitions.
Iterating post reduction 1 with 435 rules applied. Total rules applied 870 place count 1138 transition count 1138
Performed 314 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 314 Pre rules applied. Total rules applied 870 place count 1138 transition count 824
Deduced a syphon composed of 314 places in 1 ms
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 2 with 628 rules applied. Total rules applied 1498 place count 824 transition count 824
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1508 place count 814 transition count 814
Iterating global reduction 2 with 10 rules applied. Total rules applied 1518 place count 814 transition count 814
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 1518 place count 814 transition count 805
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 1536 place count 805 transition count 805
Performed 359 Post agglomeration using F-continuation condition.Transition count delta: 359
Deduced a syphon composed of 359 places in 0 ms
Reduce places removed 359 places and 0 transitions.
Iterating global reduction 2 with 718 rules applied. Total rules applied 2254 place count 446 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2255 place count 446 transition count 445
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2257 place count 445 transition count 444
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2459 place count 344 transition count 544
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 2493 place count 327 transition count 560
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 2494 place count 327 transition count 560
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2496 place count 325 transition count 558
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2497 place count 324 transition count 558
Applied a total of 2497 rules in 188 ms. Remains 324 /1574 variables (removed 1250) and now considering 558/1574 (removed 1016) transitions.
// Phase 1: matrix 558 rows 324 cols
[2024-05-30 16:04:53] [INFO ] Computed 160 invariants in 1 ms
[2024-05-30 16:04:53] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-30 16:04:53] [INFO ] Invariant cache hit.
[2024-05-30 16:04:54] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
[2024-05-30 16:04:54] [INFO ] Redundant transitions in 3 ms returned []
Running 554 sub problems to find dead transitions.
[2024-05-30 16:04:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/324 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/324 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (OVERLAPS) 557/881 variables, 324/484 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/881 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 4 (OVERLAPS) 0/881 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 554 unsolved
No progress, stopping.
After SMT solving in domain Real declared 881/882 variables, and 484 constraints, problems are : Problem set: 0 solved, 554 unsolved in 22832 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 554 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/324 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/324 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 2 (OVERLAPS) 557/881 variables, 324/484 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/881 variables, 554/1038 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/881 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 554 unsolved
At refinement iteration 5 (OVERLAPS) 0/881 variables, 0/1038 constraints. Problems are: Problem set: 0 solved, 554 unsolved
No progress, stopping.
After SMT solving in domain Int declared 881/882 variables, and 1038 constraints, problems are : Problem set: 0 solved, 554 unsolved in 22575 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 324/324 constraints, PredecessorRefiner: 554/554 constraints, Known Traps: 0/0 constraints]
After SMT, in 45571ms problems are : Problem set: 0 solved, 554 unsolved
Search for dead transitions found 0 dead transitions in 45575ms
Starting structural reductions in SI_LTL mode, iteration 1 : 324/1574 places, 558/1574 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46462 ms. Remains : 324/1574 places, 558/1574 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-10 finished in 46585 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((p1||X(p1)))||p0)))'
Support contains 3 out of 1574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1562 transition count 1562
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1562 transition count 1562
Applied a total of 24 rules in 94 ms. Remains 1562 /1574 variables (removed 12) and now considering 1562/1574 (removed 12) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2024-05-30 16:05:40] [INFO ] Computed 161 invariants in 10 ms
[2024-05-30 16:05:40] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-30 16:05:40] [INFO ] Invariant cache hit.
[2024-05-30 16:05:41] [INFO ] Implicit Places using invariants and state equation in 1145 ms returned []
Implicit Place search using SMT with State Equation took 1537 ms to find 0 implicit places.
Running 1561 sub problems to find dead transitions.
[2024-05-30 16:05:41] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1561/3124 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1562 constraints, PredecessorRefiner: 1561/1561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1561/3124 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1562 constraints, PredecessorRefiner: 0/1561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60319ms problems are : Problem set: 0 solved, 1561 unsolved
Search for dead transitions found 0 dead transitions in 60331ms
Starting structural reductions in LTL mode, iteration 1 : 1562/1574 places, 1562/1574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61965 ms. Remains : 1562/1574 places, 1562/1574 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-11
Product exploration explored 100000 steps with 2 reset in 427 ms.
Product exploration explored 100000 steps with 1 reset in 633 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X p0), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 178 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 600 ms. (66 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 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
Interrupted probabilistic random walk after 125731 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 4
Probabilistic random walk after 125731 steps, saw 70263 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
[2024-05-30 16:06:46] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1504/1562 variables, 158/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1562 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1562/3124 variables, 1562/1723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3124 variables, 0/1723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/3124 variables, 0/1723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3124/3124 variables, and 1723 constraints, problems are : Problem set: 0 solved, 4 unsolved in 938 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 1562/1562 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1504/1562 variables, 158/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 16:06:48] [INFO ] Deduced a trap composed of 50 places in 239 ms of which 4 ms to minimize.
[2024-05-30 16:06:48] [INFO ] Deduced a trap composed of 40 places in 176 ms of which 3 ms to minimize.
[2024-05-30 16:06:48] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 6 ms to minimize.
[2024-05-30 16:06:48] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 3 ms to minimize.
[2024-05-30 16:06:49] [INFO ] Deduced a trap composed of 48 places in 147 ms of which 3 ms to minimize.
[2024-05-30 16:06:49] [INFO ] Deduced a trap composed of 38 places in 153 ms of which 3 ms to minimize.
[2024-05-30 16:06:49] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 3 ms to minimize.
[2024-05-30 16:06:49] [INFO ] Deduced a trap composed of 49 places in 144 ms of which 3 ms to minimize.
[2024-05-30 16:06:49] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 3 ms to minimize.
[2024-05-30 16:06:49] [INFO ] Deduced a trap composed of 56 places in 131 ms of which 3 ms to minimize.
[2024-05-30 16:06:50] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 3 ms to minimize.
[2024-05-30 16:06:50] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 3 ms to minimize.
[2024-05-30 16:06:50] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
[2024-05-30 16:06:50] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2024-05-30 16:06:50] [INFO ] Deduced a trap composed of 50 places in 100 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1562 variables, 15/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1562 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1562/3124 variables, 1562/1738 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3124 variables, 4/1742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 16:06:51] [INFO ] Deduced a trap composed of 23 places in 269 ms of which 6 ms to minimize.
[2024-05-30 16:06:51] [INFO ] Deduced a trap composed of 43 places in 247 ms of which 5 ms to minimize.
[2024-05-30 16:06:52] [INFO ] Deduced a trap composed of 23 places in 233 ms of which 4 ms to minimize.
[2024-05-30 16:06:52] [INFO ] Deduced a trap composed of 51 places in 230 ms of which 5 ms to minimize.
[2024-05-30 16:06:52] [INFO ] Deduced a trap composed of 29 places in 217 ms of which 21 ms to minimize.
[2024-05-30 16:06:52] [INFO ] Deduced a trap composed of 22 places in 197 ms of which 4 ms to minimize.
SMT process timed out in 5962ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1562/1562 places, 1562/1562 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 435 transitions
Trivial Post-agglo rules discarded 435 transitions
Performed 435 trivial Post agglomeration. Transition count delta: 435
Iterating post reduction 0 with 435 rules applied. Total rules applied 435 place count 1562 transition count 1127
Reduce places removed 435 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 436 rules applied. Total rules applied 871 place count 1127 transition count 1126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 872 place count 1126 transition count 1126
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 319 Pre rules applied. Total rules applied 872 place count 1126 transition count 807
Deduced a syphon composed of 319 places in 1 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 1510 place count 807 transition count 807
Performed 362 Post agglomeration using F-continuation condition.Transition count delta: 362
Deduced a syphon composed of 362 places in 0 ms
Reduce places removed 362 places and 0 transitions.
Iterating global reduction 3 with 724 rules applied. Total rules applied 2234 place count 445 transition count 445
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2235 place count 445 transition count 444
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2237 place count 444 transition count 443
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2439 place count 343 transition count 541
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 2471 place count 327 transition count 557
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2472 place count 327 transition count 556
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2473 place count 326 transition count 555
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2474 place count 325 transition count 555
Applied a total of 2474 rules in 106 ms. Remains 325 /1562 variables (removed 1237) and now considering 555/1562 (removed 1007) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 325/1562 places, 555/1562 transitions.
RANDOM walk for 35023 steps (8 resets) in 1011 ms. (34 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X p0), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p1) p0))), (F (NOT (OR p1 p0))), (F (NOT p1))]
Knowledge based reduction with 9 factoid took 186 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 1562/1562 transitions.
Applied a total of 0 rules in 52 ms. Remains 1562 /1562 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
[2024-05-30 16:06:53] [INFO ] Invariant cache hit.
[2024-05-30 16:06:54] [INFO ] Implicit Places using invariants in 364 ms returned []
[2024-05-30 16:06:54] [INFO ] Invariant cache hit.
[2024-05-30 16:06:55] [INFO ] Implicit Places using invariants and state equation in 1129 ms returned []
Implicit Place search using SMT with State Equation took 1506 ms to find 0 implicit places.
Running 1561 sub problems to find dead transitions.
[2024-05-30 16:06:55] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1561/3124 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1562 constraints, PredecessorRefiner: 1561/1561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1561 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 1561/3124 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1562 constraints, PredecessorRefiner: 0/1561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60322ms problems are : Problem set: 0 solved, 1561 unsolved
Search for dead transitions found 0 dead transitions in 60334ms
Finished structural reductions in LTL mode , in 1 iterations and 61895 ms. Remains : 1562/1562 places, 1562/1562 transitions.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 97 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 1874 ms. (21 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 62 ms. (634 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 121176 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 4
Probabilistic random walk after 121176 steps, saw 68425 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
[2024-05-30 16:07:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1504/1562 variables, 158/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1562 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1562/3124 variables, 1562/1723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3124 variables, 0/1723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/3124 variables, 0/1723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3124/3124 variables, and 1723 constraints, problems are : Problem set: 0 solved, 4 unsolved in 980 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 1562/1562 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 55/58 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1504/1562 variables, 158/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 16:08:01] [INFO ] Deduced a trap composed of 50 places in 227 ms of which 4 ms to minimize.
[2024-05-30 16:08:01] [INFO ] Deduced a trap composed of 40 places in 192 ms of which 4 ms to minimize.
[2024-05-30 16:08:01] [INFO ] Deduced a trap composed of 32 places in 190 ms of which 4 ms to minimize.
[2024-05-30 16:08:01] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 12 ms to minimize.
[2024-05-30 16:08:02] [INFO ] Deduced a trap composed of 48 places in 172 ms of which 3 ms to minimize.
[2024-05-30 16:08:02] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 3 ms to minimize.
[2024-05-30 16:08:02] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 3 ms to minimize.
[2024-05-30 16:08:02] [INFO ] Deduced a trap composed of 49 places in 151 ms of which 3 ms to minimize.
[2024-05-30 16:08:02] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 3 ms to minimize.
[2024-05-30 16:08:03] [INFO ] Deduced a trap composed of 56 places in 128 ms of which 3 ms to minimize.
[2024-05-30 16:08:03] [INFO ] Deduced a trap composed of 43 places in 166 ms of which 3 ms to minimize.
[2024-05-30 16:08:03] [INFO ] Deduced a trap composed of 53 places in 104 ms of which 3 ms to minimize.
[2024-05-30 16:08:03] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 2 ms to minimize.
[2024-05-30 16:08:03] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 2 ms to minimize.
[2024-05-30 16:08:03] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1562 variables, 15/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1562 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1562/3124 variables, 1562/1738 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3124 variables, 4/1742 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 16:08:04] [INFO ] Deduced a trap composed of 23 places in 262 ms of which 5 ms to minimize.
[2024-05-30 16:08:05] [INFO ] Deduced a trap composed of 43 places in 258 ms of which 5 ms to minimize.
[2024-05-30 16:08:05] [INFO ] Deduced a trap composed of 23 places in 258 ms of which 5 ms to minimize.
[2024-05-30 16:08:05] [INFO ] Deduced a trap composed of 51 places in 234 ms of which 5 ms to minimize.
[2024-05-30 16:08:05] [INFO ] Deduced a trap composed of 29 places in 217 ms of which 4 ms to minimize.
SMT process timed out in 6095ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 1562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1562/1562 places, 1562/1562 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 435 transitions
Trivial Post-agglo rules discarded 435 transitions
Performed 435 trivial Post agglomeration. Transition count delta: 435
Iterating post reduction 0 with 435 rules applied. Total rules applied 435 place count 1562 transition count 1127
Reduce places removed 435 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 436 rules applied. Total rules applied 871 place count 1127 transition count 1126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 872 place count 1126 transition count 1126
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 319 Pre rules applied. Total rules applied 872 place count 1126 transition count 807
Deduced a syphon composed of 319 places in 1 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 1510 place count 807 transition count 807
Performed 362 Post agglomeration using F-continuation condition.Transition count delta: 362
Deduced a syphon composed of 362 places in 0 ms
Reduce places removed 362 places and 0 transitions.
Iterating global reduction 3 with 724 rules applied. Total rules applied 2234 place count 445 transition count 445
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2235 place count 445 transition count 444
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2237 place count 444 transition count 443
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2439 place count 343 transition count 541
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 2471 place count 327 transition count 557
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2472 place count 327 transition count 556
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2473 place count 326 transition count 555
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2474 place count 325 transition count 555
Applied a total of 2474 rules in 112 ms. Remains 325 /1562 variables (removed 1237) and now considering 555/1562 (removed 1007) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 325/1562 places, 555/1562 transitions.
RANDOM walk for 40000 steps (11 resets) in 1332 ms. (30 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (10 resets) in 285 ms. (139 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 310 ms. (128 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (10 resets) in 319 ms. (125 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 125831 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 4
Probabilistic random walk after 125831 steps, saw 84421 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
// Phase 1: matrix 555 rows 325 cols
[2024-05-30 16:08:09] [INFO ] Computed 160 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 25/36 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 64/100 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 71/171 variables, 26/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 13/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 66/237 variables, 24/113 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 12/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 66/303 variables, 24/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/303 variables, 12/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/303 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 66/369 variables, 24/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/369 variables, 12/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/369 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 66/435 variables, 24/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/435 variables, 12/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/435 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 66/501 variables, 24/257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/501 variables, 12/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/501 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 66/567 variables, 24/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/567 variables, 12/305 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/567 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 66/633 variables, 24/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/633 variables, 12/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/633 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 64/697 variables, 24/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/697 variables, 12/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/697 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 36/733 variables, 16/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/733 variables, 8/401 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/733 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (OVERLAPS) 22/755 variables, 8/409 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/755 variables, 4/413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/755 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 22/777 variables, 8/421 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/777 variables, 4/425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/777 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (OVERLAPS) 22/799 variables, 8/433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/799 variables, 4/437 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/799 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (OVERLAPS) 22/821 variables, 8/445 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/821 variables, 4/449 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/821 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (OVERLAPS) 22/843 variables, 8/457 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/843 variables, 4/461 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/843 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (OVERLAPS) 22/865 variables, 8/469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/865 variables, 4/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/865 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (OVERLAPS) 15/880 variables, 8/481 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/880 variables, 4/485 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/880 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (OVERLAPS) 0/880 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 880/880 variables, and 485 constraints, problems are : Problem set: 0 solved, 4 unsolved in 762 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 325/325 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 25/36 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 64/100 variables, 24/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 71/171 variables, 26/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 13/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 66/237 variables, 24/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/237 variables, 12/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/237 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 66/303 variables, 24/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/303 variables, 12/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/303 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 66/369 variables, 24/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/369 variables, 12/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/369 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 66/435 variables, 24/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/435 variables, 12/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/435 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 66/501 variables, 24/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/501 variables, 12/273 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/501 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 66/567 variables, 24/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/567 variables, 12/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/567 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 66/633 variables, 24/333 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/633 variables, 12/345 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/633 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (OVERLAPS) 64/697 variables, 24/369 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/697 variables, 12/381 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/697 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 36/733 variables, 16/397 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/733 variables, 8/405 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/733 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (OVERLAPS) 22/755 variables, 8/413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/755 variables, 4/417 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/755 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (OVERLAPS) 22/777 variables, 8/425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/777 variables, 4/429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/777 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (OVERLAPS) 22/799 variables, 8/437 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/799 variables, 4/441 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/799 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (OVERLAPS) 22/821 variables, 8/449 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/821 variables, 4/453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/821 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (OVERLAPS) 22/843 variables, 8/461 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/843 variables, 4/465 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/843 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (OVERLAPS) 22/865 variables, 8/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/865 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/865 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (OVERLAPS) 15/880 variables, 8/485 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/880 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/880 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (OVERLAPS) 0/880 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 880/880 variables, and 489 constraints, problems are : Problem set: 0 solved, 4 unsolved in 927 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 325/325 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1736ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 392 ms.
Support contains 3 out of 325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 555/555 transitions.
Applied a total of 0 rules in 6 ms. Remains 325 /325 variables (removed 0) and now considering 555/555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 325/325 places, 555/555 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 555/555 transitions.
Applied a total of 0 rules in 5 ms. Remains 325 /325 variables (removed 0) and now considering 555/555 (removed 0) transitions.
[2024-05-30 16:08:12] [INFO ] Invariant cache hit.
[2024-05-30 16:08:12] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-30 16:08:12] [INFO ] Invariant cache hit.
[2024-05-30 16:08:12] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
[2024-05-30 16:08:12] [INFO ] Redundant transitions in 3 ms returned []
Running 552 sub problems to find dead transitions.
[2024-05-30 16:08:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 2 (OVERLAPS) 555/880 variables, 325/485 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/880 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 4 (OVERLAPS) 0/880 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 552 unsolved
No progress, stopping.
After SMT solving in domain Real declared 880/880 variables, and 485 constraints, problems are : Problem set: 0 solved, 552 unsolved in 22775 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 325/325 constraints, PredecessorRefiner: 552/552 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 552 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 2 (OVERLAPS) 555/880 variables, 325/485 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/880 variables, 552/1037 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/880 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 5 (OVERLAPS) 0/880 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 552 unsolved
No progress, stopping.
After SMT solving in domain Int declared 880/880 variables, and 1037 constraints, problems are : Problem set: 0 solved, 552 unsolved in 24322 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 325/325 constraints, PredecessorRefiner: 552/552 constraints, Known Traps: 0/0 constraints]
After SMT, in 47271ms problems are : Problem set: 0 solved, 552 unsolved
Search for dead transitions found 0 dead transitions in 47276ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47869 ms. Remains : 325/325 places, 555/555 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 156 edges and 325 vertex of which 4 / 325 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 322 transition count 548
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 322 transition count 547
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 320 transition count 547
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 318 transition count 546
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 13 place count 318 transition count 542
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 318 transition count 541
Applied a total of 14 rules in 21 ms. Remains 318 /325 variables (removed 7) and now considering 541/555 (removed 14) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 541 rows 318 cols
[2024-05-30 16:08:59] [INFO ] Computed 157 invariants in 1 ms
[2024-05-30 16:09:00] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-30 16:09:00] [INFO ] [Nat]Absence check using 157 positive place invariants in 18 ms returned sat
[2024-05-30 16:09:00] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-30 16:09:00] [INFO ] After 332ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-30 16:09:00] [INFO ] After 531ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 653 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 91 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1 reset in 391 ms.
Product exploration explored 100000 steps with 3 reset in 536 ms.
Support contains 3 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 1562/1562 transitions.
Applied a total of 0 rules in 47 ms. Remains 1562 /1562 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2024-05-30 16:09:02] [INFO ] Computed 161 invariants in 6 ms
[2024-05-30 16:09:02] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-30 16:09:02] [INFO ] Invariant cache hit.
[2024-05-30 16:09:03] [INFO ] Implicit Places using invariants and state equation in 1111 ms returned []
Implicit Place search using SMT with State Equation took 1506 ms to find 0 implicit places.
Running 1561 sub problems to find dead transitions.
[2024-05-30 16:09:03] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1561/3124 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1562 constraints, PredecessorRefiner: 1561/1561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1561/3124 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1562 constraints, PredecessorRefiner: 0/1561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60321ms problems are : Problem set: 0 solved, 1561 unsolved
Search for dead transitions found 0 dead transitions in 60333ms
Finished structural reductions in LTL mode , in 1 iterations and 61892 ms. Remains : 1562/1562 places, 1562/1562 transitions.
Treatment of property ShieldRVt-PT-040B-LTLFireability-11 finished in 264111 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(!p0)||(!p0&&F(G(p0)))))))'
Support contains 1 out of 1574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1561 transition count 1561
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1561 transition count 1561
Applied a total of 26 rules in 92 ms. Remains 1561 /1574 variables (removed 13) and now considering 1561/1574 (removed 13) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2024-05-30 16:10:04] [INFO ] Computed 161 invariants in 14 ms
[2024-05-30 16:10:04] [INFO ] Implicit Places using invariants in 364 ms returned []
[2024-05-30 16:10:04] [INFO ] Invariant cache hit.
[2024-05-30 16:10:05] [INFO ] Implicit Places using invariants and state equation in 1220 ms returned []
Implicit Place search using SMT with State Equation took 1614 ms to find 0 implicit places.
Running 1560 sub problems to find dead transitions.
[2024-05-30 16:10:05] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1560/3122 variables, and 0 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1561 constraints, PredecessorRefiner: 1560/1560 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1560/3122 variables, and 0 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1561 constraints, PredecessorRefiner: 0/1560 constraints, Known Traps: 0/0 constraints]
After SMT, in 60314ms problems are : Problem set: 0 solved, 1560 unsolved
Search for dead transitions found 0 dead transitions in 60327ms
Starting structural reductions in LTL mode, iteration 1 : 1561/1574 places, 1561/1574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62037 ms. Remains : 1561/1574 places, 1561/1574 transitions.
Stuttering acceptance computed with spot in 187 ms :[p0, p0, p0, true, false, (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-12
Stuttering criterion allowed to conclude after 70027 steps with 0 reset in 283 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-12 finished in 62535 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||((p0||X((X(p1) U (p0&&X(p1))))) U p2)))'
Support contains 4 out of 1574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1562 transition count 1562
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1562 transition count 1562
Applied a total of 24 rules in 94 ms. Remains 1562 /1574 variables (removed 12) and now considering 1562/1574 (removed 12) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2024-05-30 16:11:06] [INFO ] Computed 161 invariants in 4 ms
[2024-05-30 16:11:07] [INFO ] Implicit Places using invariants in 597 ms returned []
[2024-05-30 16:11:07] [INFO ] Invariant cache hit.
[2024-05-30 16:11:08] [INFO ] Implicit Places using invariants and state equation in 1178 ms returned []
Implicit Place search using SMT with State Equation took 1796 ms to find 0 implicit places.
Running 1561 sub problems to find dead transitions.
[2024-05-30 16:11:08] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1561/3124 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1562 constraints, PredecessorRefiner: 1561/1561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1561/3124 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1562 constraints, PredecessorRefiner: 0/1561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60344ms problems are : Problem set: 0 solved, 1561 unsolved
Search for dead transitions found 0 dead transitions in 60359ms
Starting structural reductions in LTL mode, iteration 1 : 1562/1574 places, 1562/1574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62263 ms. Remains : 1562/1574 places, 1562/1574 transitions.
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), true]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-13
Product exploration explored 100000 steps with 20040 reset in 235 ms.
Product exploration explored 100000 steps with 20002 reset in 371 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Detected a total of 478/1562 stabilizing places and 478/1562 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 173 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), true]
RANDOM walk for 33036 steps (6 resets) in 262 ms. (125 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F p0)]
Knowledge based reduction with 11 factoid took 288 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), true]
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), true]
[2024-05-30 16:12:10] [INFO ] Invariant cache hit.
[2024-05-30 16:12:11] [INFO ] [Real]Absence check using 161 positive place invariants in 114 ms returned sat
[2024-05-30 16:12:15] [INFO ] [Real]Absence check using state equation in 3605 ms returned sat
[2024-05-30 16:12:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 16:12:15] [INFO ] [Nat]Absence check using 161 positive place invariants in 118 ms returned sat
[2024-05-30 16:12:19] [INFO ] [Nat]Absence check using state equation in 3807 ms returned sat
[2024-05-30 16:12:19] [INFO ] Computed and/alt/rep : 1561/2282/1561 causal constraints (skipped 0 transitions) in 77 ms.
Could not prove EG (NOT p2)
[2024-05-30 16:12:30] [INFO ] Invariant cache hit.
[2024-05-30 16:12:30] [INFO ] [Real]Absence check using 161 positive place invariants in 117 ms returned sat
[2024-05-30 16:12:34] [INFO ] [Real]Absence check using state equation in 3753 ms returned sat
[2024-05-30 16:12:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 16:12:35] [INFO ] [Nat]Absence check using 161 positive place invariants in 127 ms returned sat
[2024-05-30 16:12:38] [INFO ] [Nat]Absence check using state equation in 3556 ms returned sat
[2024-05-30 16:12:39] [INFO ] Computed and/alt/rep : 1561/2282/1561 causal constraints (skipped 0 transitions) in 77 ms.
Could not prove EG (NOT p0)
Support contains 4 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 1562/1562 transitions.
Applied a total of 0 rules in 61 ms. Remains 1562 /1562 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
[2024-05-30 16:12:49] [INFO ] Invariant cache hit.
[2024-05-30 16:12:50] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-30 16:12:50] [INFO ] Invariant cache hit.
[2024-05-30 16:12:51] [INFO ] Implicit Places using invariants and state equation in 1143 ms returned []
Implicit Place search using SMT with State Equation took 1487 ms to find 0 implicit places.
Running 1561 sub problems to find dead transitions.
[2024-05-30 16:12:51] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 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 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 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1561/3124 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1562 constraints, PredecessorRefiner: 1561/1561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1561/3124 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1562 constraints, PredecessorRefiner: 0/1561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60314ms problems are : Problem set: 0 solved, 1561 unsolved
Search for dead transitions found 0 dead transitions in 60327ms
Finished structural reductions in LTL mode , in 1 iterations and 61880 ms. Remains : 1562/1562 places, 1562/1562 transitions.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Detected a total of 478/1562 stabilizing places and 478/1562 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 165 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), true]
RANDOM walk for 24404 steps (4 resets) in 136 ms. (178 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (NOT (AND (NOT p2) (NOT p0)))), (F p0)]
Knowledge based reduction with 9 factoid took 318 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), true]
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), true]
[2024-05-30 16:13:52] [INFO ] Invariant cache hit.
[2024-05-30 16:13:53] [INFO ] [Real]Absence check using 161 positive place invariants in 116 ms returned sat
[2024-05-30 16:13:57] [INFO ] [Real]Absence check using state equation in 3510 ms returned sat
[2024-05-30 16:13:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 16:13:57] [INFO ] [Nat]Absence check using 161 positive place invariants in 120 ms returned sat
[2024-05-30 16:14:01] [INFO ] [Nat]Absence check using state equation in 3731 ms returned sat
[2024-05-30 16:14:01] [INFO ] Computed and/alt/rep : 1561/2282/1561 causal constraints (skipped 0 transitions) in 80 ms.
Could not prove EG (NOT p2)
[2024-05-30 16:14:12] [INFO ] Invariant cache hit.
[2024-05-30 16:14:12] [INFO ] [Real]Absence check using 161 positive place invariants in 117 ms returned sat
[2024-05-30 16:14:16] [INFO ] [Real]Absence check using state equation in 3555 ms returned sat
[2024-05-30 16:14:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 16:14:16] [INFO ] [Nat]Absence check using 161 positive place invariants in 116 ms returned sat
[2024-05-30 16:14:20] [INFO ] [Nat]Absence check using state equation in 3405 ms returned sat
[2024-05-30 16:14:20] [INFO ] Computed and/alt/rep : 1561/2282/1561 causal constraints (skipped 0 transitions) in 71 ms.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:587)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:610)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:581)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:262)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:958)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-30 16:14:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), true]
Product exploration explored 100000 steps with 20010 reset in 213 ms.
Product exploration explored 100000 steps with 19977 reset in 233 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p2), (NOT p1), true]
Support contains 4 out of 1562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1562/1562 places, 1562/1562 transitions.
Performed 436 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 436 rules applied. Total rules applied 436 place count 1562 transition count 1562
Performed 162 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 162 Pre rules applied. Total rules applied 436 place count 1562 transition count 1723
Deduced a syphon composed of 598 places in 2 ms
Iterating global reduction 1 with 162 rules applied. Total rules applied 598 place count 1562 transition count 1723
Performed 476 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1074 places in 1 ms
Iterating global reduction 1 with 476 rules applied. Total rules applied 1074 place count 1562 transition count 1723
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1075 place count 1562 transition count 1722
Renaming transitions due to excessive name length > 1024 char.
Discarding 316 places :
Symmetric choice reduction at 2 with 316 rule applications. Total rules 1391 place count 1246 transition count 1406
Deduced a syphon composed of 758 places in 1 ms
Iterating global reduction 2 with 316 rules applied. Total rules applied 1707 place count 1246 transition count 1406
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 759 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1708 place count 1246 transition count 1406
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1710 place count 1244 transition count 1404
Deduced a syphon composed of 757 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1712 place count 1244 transition count 1404
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -732
Deduced a syphon composed of 858 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1813 place count 1244 transition count 2136
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1914 place count 1143 transition count 1934
Deduced a syphon composed of 757 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2015 place count 1143 transition count 1934
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -395
Deduced a syphon composed of 814 places in 1 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2072 place count 1143 transition count 2329
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 2130 place count 1085 transition count 2213
Deduced a syphon composed of 756 places in 1 ms
Iterating global reduction 2 with 58 rules applied. Total rules applied 2188 place count 1085 transition count 2213
Deduced a syphon composed of 756 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 2191 place count 1085 transition count 2210
Deduced a syphon composed of 756 places in 0 ms
Applied a total of 2191 rules in 867 ms. Remains 1085 /1562 variables (removed 477) and now considering 2210/1562 (removed -648) transitions.
[2024-05-30 16:14:33] [INFO ] Redundant transitions in 50 ms returned []
Running 2209 sub problems to find dead transitions.
// Phase 1: matrix 2210 rows 1085 cols
[2024-05-30 16:14:33] [INFO ] Computed 161 invariants in 9 ms
[2024-05-30 16:14:33] [INFO ] State equation strengthened by 702 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1084/3295 variables, and 0 constraints, problems are : Problem set: 0 solved, 2209 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1085 constraints, ReadFeed: 0/702 constraints, PredecessorRefiner: 2209/2209 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1084/3295 variables, and 0 constraints, problems are : Problem set: 0 solved, 2209 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1085 constraints, ReadFeed: 0/702 constraints, PredecessorRefiner: 0/2209 constraints, Known Traps: 0/0 constraints]
After SMT, in 63712ms problems are : Problem set: 0 solved, 2209 unsolved
Search for dead transitions found 0 dead transitions in 63734ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1085/1562 places, 2210/1562 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64663 ms. Remains : 1085/1562 places, 2210/1562 transitions.
Support contains 4 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 1562/1562 transitions.
Applied a total of 0 rules in 59 ms. Remains 1562 /1562 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2024-05-30 16:15:37] [INFO ] Computed 161 invariants in 11 ms
[2024-05-30 16:15:37] [INFO ] Implicit Places using invariants in 511 ms returned []
[2024-05-30 16:15:37] [INFO ] Invariant cache hit.
[2024-05-30 16:15:38] [INFO ] Implicit Places using invariants and state equation in 1216 ms returned []
Implicit Place search using SMT with State Equation took 1745 ms to find 0 implicit places.
Running 1561 sub problems to find dead transitions.
[2024-05-30 16:15:38] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1561/3124 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1562 constraints, PredecessorRefiner: 1561/1561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1561/3124 variables, and 0 constraints, problems are : Problem set: 0 solved, 1561 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1562 constraints, PredecessorRefiner: 0/1561 constraints, Known Traps: 0/0 constraints]
After SMT, in 60347ms problems are : Problem set: 0 solved, 1561 unsolved
Search for dead transitions found 0 dead transitions in 60360ms
Finished structural reductions in LTL mode , in 1 iterations and 62181 ms. Remains : 1562/1562 places, 1562/1562 transitions.
Treatment of property ShieldRVt-PT-040B-LTLFireability-13 finished in 332524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(G((p1||X(G(!p1))))))))'
Support contains 2 out of 1574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1561 transition count 1561
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1561 transition count 1561
Applied a total of 26 rules in 100 ms. Remains 1561 /1574 variables (removed 13) and now considering 1561/1574 (removed 13) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2024-05-30 16:16:39] [INFO ] Computed 161 invariants in 11 ms
[2024-05-30 16:16:39] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-05-30 16:16:39] [INFO ] Invariant cache hit.
[2024-05-30 16:16:40] [INFO ] Implicit Places using invariants and state equation in 1343 ms returned []
Implicit Place search using SMT with State Equation took 1690 ms to find 0 implicit places.
Running 1560 sub problems to find dead transitions.
[2024-05-30 16:16:40] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1560/3122 variables, and 0 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1561 constraints, PredecessorRefiner: 1560/1560 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1560/3122 variables, and 0 constraints, problems are : Problem set: 0 solved, 1560 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1561 constraints, PredecessorRefiner: 0/1560 constraints, Known Traps: 0/0 constraints]
After SMT, in 60313ms problems are : Problem set: 0 solved, 1560 unsolved
Search for dead transitions found 0 dead transitions in 60327ms
Starting structural reductions in LTL mode, iteration 1 : 1561/1574 places, 1561/1574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62120 ms. Remains : 1561/1574 places, 1561/1574 transitions.
Stuttering acceptance computed with spot in 263 ms :[false, false, false, p1, true, false]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-14
Product exploration explored 100000 steps with 1 reset in 420 ms.
Product exploration explored 100000 steps with 0 reset in 537 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Detected a total of 478/1561 stabilizing places and 478/1561 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 150 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[true, p1]
RANDOM walk for 33243 steps (6 resets) in 156 ms. (211 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p1)]
Property proved to be false thanks to negative knowledge :(F p1)
Knowledge based reduction with 9 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-040B-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-040B-LTLFireability-14 finished in 63849 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (X(p1)||(!p0 U (p2||G(!p0)))))))'
Support contains 3 out of 1574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1564 transition count 1564
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1564 transition count 1564
Applied a total of 20 rules in 106 ms. Remains 1564 /1574 variables (removed 10) and now considering 1564/1574 (removed 10) transitions.
// Phase 1: matrix 1564 rows 1564 cols
[2024-05-30 16:17:43] [INFO ] Computed 161 invariants in 8 ms
[2024-05-30 16:17:43] [INFO ] Implicit Places using invariants in 340 ms returned []
[2024-05-30 16:17:43] [INFO ] Invariant cache hit.
[2024-05-30 16:17:44] [INFO ] Implicit Places using invariants and state equation in 1158 ms returned []
Implicit Place search using SMT with State Equation took 1500 ms to find 0 implicit places.
Running 1563 sub problems to find dead transitions.
[2024-05-30 16:17:44] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1563/3128 variables, and 0 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1564 constraints, PredecessorRefiner: 1563/1563 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1563 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1563/3128 variables, and 0 constraints, problems are : Problem set: 0 solved, 1563 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1564 constraints, PredecessorRefiner: 0/1563 constraints, Known Traps: 0/0 constraints]
After SMT, in 60324ms problems are : Problem set: 0 solved, 1563 unsolved
Search for dead transitions found 0 dead transitions in 60337ms
Starting structural reductions in LTL mode, iteration 1 : 1564/1574 places, 1564/1574 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61948 ms. Remains : 1564/1574 places, 1564/1574 transitions.
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) p0 (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), true, (AND (NOT p2) p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-15
Product exploration explored 100000 steps with 50000 reset in 359 ms.
Product exploration explored 100000 steps with 50000 reset in 368 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 20 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-040B-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-040B-LTLFireability-15 finished in 62982 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)||(!p0&&F(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' '!(G((G((p1||X(p1)))||p0)))'
Found a Lengthening insensitive property : ShieldRVt-PT-040B-LTLFireability-11
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 1574 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1574/1574 places, 1574/1574 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 434 transitions
Trivial Post-agglo rules discarded 434 transitions
Performed 434 trivial Post agglomeration. Transition count delta: 434
Iterating post reduction 0 with 434 rules applied. Total rules applied 434 place count 1573 transition count 1139
Reduce places removed 434 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 435 rules applied. Total rules applied 869 place count 1139 transition count 1138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 870 place count 1138 transition count 1138
Performed 313 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 313 Pre rules applied. Total rules applied 870 place count 1138 transition count 825
Deduced a syphon composed of 313 places in 2 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 3 with 626 rules applied. Total rules applied 1496 place count 825 transition count 825
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1505 place count 816 transition count 816
Iterating global reduction 3 with 9 rules applied. Total rules applied 1514 place count 816 transition count 816
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 1514 place count 816 transition count 808
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 1530 place count 808 transition count 808
Performed 362 Post agglomeration using F-continuation condition.Transition count delta: 362
Deduced a syphon composed of 362 places in 0 ms
Reduce places removed 362 places and 0 transitions.
Iterating global reduction 3 with 724 rules applied. Total rules applied 2254 place count 446 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2255 place count 446 transition count 445
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2257 place count 445 transition count 444
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2459 place count 344 transition count 542
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 2491 place count 328 transition count 558
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2493 place count 326 transition count 556
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2494 place count 325 transition count 556
Applied a total of 2494 rules in 187 ms. Remains 325 /1574 variables (removed 1249) and now considering 556/1574 (removed 1018) transitions.
// Phase 1: matrix 556 rows 325 cols
[2024-05-30 16:18:46] [INFO ] Computed 160 invariants in 2 ms
[2024-05-30 16:18:46] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-30 16:18:46] [INFO ] Invariant cache hit.
[2024-05-30 16:18:47] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Running 552 sub problems to find dead transitions.
[2024-05-30 16:18:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 2 (OVERLAPS) 555/880 variables, 325/485 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/880 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 4 (OVERLAPS) 0/880 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 552 unsolved
No progress, stopping.
After SMT solving in domain Real declared 880/881 variables, and 485 constraints, problems are : Problem set: 0 solved, 552 unsolved in 21734 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 325/325 constraints, PredecessorRefiner: 552/552 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 552 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 2 (OVERLAPS) 555/880 variables, 325/485 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/880 variables, 552/1037 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/880 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 5 (OVERLAPS) 0/880 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 552 unsolved
No progress, stopping.
After SMT solving in domain Int declared 880/881 variables, and 1037 constraints, problems are : Problem set: 0 solved, 552 unsolved in 22117 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 325/325 constraints, PredecessorRefiner: 552/552 constraints, Known Traps: 0/0 constraints]
After SMT, in 44040ms problems are : Problem set: 0 solved, 552 unsolved
Search for dead transitions found 0 dead transitions in 44044ms
Starting structural reductions in LI_LTL mode, iteration 1 : 325/1574 places, 556/1574 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 44762 ms. Remains : 325/1574 places, 556/1574 transitions.
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-11
Product exploration explored 100000 steps with 31 reset in 434 ms.
Product exploration explored 100000 steps with 18 reset in 518 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 p1), (X p0), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 98 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (15 resets) in 377 ms. (105 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 320 ms. (124 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 444 ms. (89 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 369 ms. (108 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 146012 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 4
Probabilistic random walk after 146012 steps, saw 96363 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
[2024-05-30 16:19:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 25/36 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 64/100 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 71/171 variables, 26/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 13/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 66/237 variables, 24/113 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 12/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 66/303 variables, 24/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/303 variables, 12/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/303 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 66/369 variables, 24/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/369 variables, 12/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/369 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 66/435 variables, 24/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/435 variables, 12/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/435 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 66/501 variables, 24/257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/501 variables, 12/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/501 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 66/567 variables, 24/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/567 variables, 12/305 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/567 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 66/633 variables, 24/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/633 variables, 12/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/633 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 64/697 variables, 24/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/697 variables, 12/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/697 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 36/733 variables, 16/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/733 variables, 8/401 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/733 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (OVERLAPS) 22/755 variables, 8/409 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/755 variables, 4/413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/755 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 22/777 variables, 8/421 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/777 variables, 4/425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/777 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (OVERLAPS) 22/799 variables, 8/433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/799 variables, 4/437 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/799 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (OVERLAPS) 22/821 variables, 8/445 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/821 variables, 4/449 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/821 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (OVERLAPS) 22/843 variables, 8/457 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/843 variables, 4/461 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/843 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (OVERLAPS) 22/865 variables, 8/469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/865 variables, 4/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/865 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (OVERLAPS) 15/880 variables, 8/481 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/880 variables, 4/485 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/880 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (OVERLAPS) 0/880 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 880/881 variables, and 485 constraints, problems are : Problem set: 0 solved, 4 unsolved in 917 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 325/325 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 25/36 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 64/100 variables, 24/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 71/171 variables, 26/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 13/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 66/237 variables, 24/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/237 variables, 12/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/237 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 66/303 variables, 24/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/303 variables, 12/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/303 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 66/369 variables, 24/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/369 variables, 12/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/369 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 66/435 variables, 24/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/435 variables, 12/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/435 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 66/501 variables, 24/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/501 variables, 12/273 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/501 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 66/567 variables, 24/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/567 variables, 12/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/567 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 66/633 variables, 24/333 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/633 variables, 12/345 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/633 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (OVERLAPS) 64/697 variables, 24/369 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/697 variables, 12/381 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/697 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 36/733 variables, 16/397 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/733 variables, 8/405 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/733 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (OVERLAPS) 22/755 variables, 8/413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/755 variables, 4/417 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/755 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (OVERLAPS) 22/777 variables, 8/425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/777 variables, 4/429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/777 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (OVERLAPS) 22/799 variables, 8/437 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/799 variables, 4/441 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/799 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (OVERLAPS) 22/821 variables, 8/449 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/821 variables, 4/453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/821 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (OVERLAPS) 22/843 variables, 8/461 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/843 variables, 4/465 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/843 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (OVERLAPS) 22/865 variables, 8/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/865 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/865 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (OVERLAPS) 15/880 variables, 8/485 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/880 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/880 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (OVERLAPS) 0/880 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 880/881 variables, and 489 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1344 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 325/325 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 2267ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 256 ms.
Support contains 3 out of 325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 556/556 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 325 transition count 555
Applied a total of 1 rules in 15 ms. Remains 325 /325 variables (removed 0) and now considering 555/556 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 325/325 places, 555/556 transitions.
RANDOM walk for 40000 steps (13 resets) in 2168 ms. (18 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (11 resets) in 481 ms. (82 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 341 ms. (116 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (10 resets) in 405 ms. (98 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (9 resets) in 371 ms. (107 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 148242 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 4
Probabilistic random walk after 148242 steps, saw 99388 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
// Phase 1: matrix 555 rows 325 cols
[2024-05-30 16:19:42] [INFO ] Computed 160 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 25/36 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 64/100 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 71/171 variables, 26/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 13/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 66/237 variables, 24/113 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 12/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 66/303 variables, 24/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/303 variables, 12/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/303 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 66/369 variables, 24/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/369 variables, 12/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/369 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 66/435 variables, 24/221 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/435 variables, 12/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/435 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 66/501 variables, 24/257 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/501 variables, 12/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/501 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 66/567 variables, 24/293 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/567 variables, 12/305 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/567 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (OVERLAPS) 66/633 variables, 24/329 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/633 variables, 12/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/633 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 64/697 variables, 24/365 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/697 variables, 12/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/697 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 36/733 variables, 16/393 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/733 variables, 8/401 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/733 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (OVERLAPS) 22/755 variables, 8/409 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/755 variables, 4/413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/755 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 22/777 variables, 8/421 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/777 variables, 4/425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/777 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (OVERLAPS) 22/799 variables, 8/433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/799 variables, 4/437 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/799 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (OVERLAPS) 22/821 variables, 8/445 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/821 variables, 4/449 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/821 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (OVERLAPS) 22/843 variables, 8/457 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/843 variables, 4/461 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/843 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (OVERLAPS) 22/865 variables, 8/469 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/865 variables, 4/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/865 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (OVERLAPS) 15/880 variables, 8/481 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/880 variables, 4/485 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/880 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (OVERLAPS) 0/880 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 880/880 variables, and 485 constraints, problems are : Problem set: 0 solved, 4 unsolved in 725 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 325/325 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 25/36 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 64/100 variables, 24/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 71/171 variables, 26/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 13/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 66/237 variables, 24/117 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/237 variables, 12/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/237 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 66/303 variables, 24/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/303 variables, 12/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/303 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 66/369 variables, 24/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/369 variables, 12/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/369 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 66/435 variables, 24/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/435 variables, 12/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/435 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 66/501 variables, 24/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/501 variables, 12/273 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/501 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 66/567 variables, 24/297 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/567 variables, 12/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/567 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 66/633 variables, 24/333 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/633 variables, 12/345 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/633 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (OVERLAPS) 64/697 variables, 24/369 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/697 variables, 12/381 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/697 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 36/733 variables, 16/397 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/733 variables, 8/405 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/733 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (OVERLAPS) 22/755 variables, 8/413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/755 variables, 4/417 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/755 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (OVERLAPS) 22/777 variables, 8/425 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/777 variables, 4/429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/777 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (OVERLAPS) 22/799 variables, 8/437 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/799 variables, 4/441 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/799 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (OVERLAPS) 22/821 variables, 8/449 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/821 variables, 4/453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/821 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (OVERLAPS) 22/843 variables, 8/461 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/843 variables, 4/465 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/843 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (OVERLAPS) 22/865 variables, 8/473 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/865 variables, 4/477 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/865 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (OVERLAPS) 15/880 variables, 8/485 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/880 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/880 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (OVERLAPS) 0/880 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 880/880 variables, and 489 constraints, problems are : Problem set: 0 solved, 4 unsolved in 852 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 325/325 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1594ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 894 ms.
Support contains 3 out of 325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 555/555 transitions.
Applied a total of 0 rules in 10 ms. Remains 325 /325 variables (removed 0) and now considering 555/555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 325/325 places, 555/555 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 555/555 transitions.
Applied a total of 0 rules in 6 ms. Remains 325 /325 variables (removed 0) and now considering 555/555 (removed 0) transitions.
[2024-05-30 16:19:45] [INFO ] Invariant cache hit.
[2024-05-30 16:19:45] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-30 16:19:45] [INFO ] Invariant cache hit.
[2024-05-30 16:19:45] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
[2024-05-30 16:19:45] [INFO ] Redundant transitions in 4 ms returned []
Running 552 sub problems to find dead transitions.
[2024-05-30 16:19:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 2 (OVERLAPS) 555/880 variables, 325/485 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/880 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 4 (OVERLAPS) 0/880 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 552 unsolved
No progress, stopping.
After SMT solving in domain Real declared 880/880 variables, and 485 constraints, problems are : Problem set: 0 solved, 552 unsolved in 21791 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 325/325 constraints, PredecessorRefiner: 552/552 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 552 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 2 (OVERLAPS) 555/880 variables, 325/485 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/880 variables, 552/1037 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/880 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 5 (OVERLAPS) 0/880 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 552 unsolved
No progress, stopping.
After SMT solving in domain Int declared 880/880 variables, and 1037 constraints, problems are : Problem set: 0 solved, 552 unsolved in 23232 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 325/325 constraints, PredecessorRefiner: 552/552 constraints, Known Traps: 0/0 constraints]
After SMT, in 45157ms problems are : Problem set: 0 solved, 552 unsolved
Search for dead transitions found 0 dead transitions in 45163ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45754 ms. Remains : 325/325 places, 555/555 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 156 edges and 325 vertex of which 4 / 325 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 322 transition count 548
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 322 transition count 547
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 320 transition count 547
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 318 transition count 546
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 13 place count 318 transition count 542
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 318 transition count 541
Applied a total of 14 rules in 23 ms. Remains 318 /325 variables (removed 7) and now considering 541/555 (removed 14) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 541 rows 318 cols
[2024-05-30 16:20:30] [INFO ] Computed 157 invariants in 2 ms
[2024-05-30 16:20:30] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-30 16:20:30] [INFO ] [Nat]Absence check using 157 positive place invariants in 19 ms returned sat
[2024-05-30 16:20:31] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-30 16:20:31] [INFO ] After 296ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-30 16:20:31] [INFO ] After 462ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 567 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X p0), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 120 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 325 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 325/325 places, 556/556 transitions.
Applied a total of 0 rules in 10 ms. Remains 325 /325 variables (removed 0) and now considering 556/556 (removed 0) transitions.
// Phase 1: matrix 556 rows 325 cols
[2024-05-30 16:20:31] [INFO ] Computed 160 invariants in 2 ms
[2024-05-30 16:20:31] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-30 16:20:31] [INFO ] Invariant cache hit.
[2024-05-30 16:20:32] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
Running 552 sub problems to find dead transitions.
[2024-05-30 16:20:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 2 (OVERLAPS) 555/880 variables, 325/485 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/880 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 4 (OVERLAPS) 0/880 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 552 unsolved
No progress, stopping.
After SMT solving in domain Real declared 880/881 variables, and 485 constraints, problems are : Problem set: 0 solved, 552 unsolved in 22413 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 325/325 constraints, PredecessorRefiner: 552/552 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 552 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 2 (OVERLAPS) 555/880 variables, 325/485 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/880 variables, 552/1037 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/880 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 5 (OVERLAPS) 0/880 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 552 unsolved
No progress, stopping.
After SMT solving in domain Int declared 880/881 variables, and 1037 constraints, problems are : Problem set: 0 solved, 552 unsolved in 23107 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 325/325 constraints, PredecessorRefiner: 552/552 constraints, Known Traps: 0/0 constraints]
After SMT, in 45679ms problems are : Problem set: 0 solved, 552 unsolved
Search for dead transitions found 0 dead transitions in 45684ms
Finished structural reductions in LTL mode , in 1 iterations and 46221 ms. Remains : 325/325 places, 556/556 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 p1 (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 105 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (11 resets) in 1679 ms. (23 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 241 ms. (165 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 301 ms. (132 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 308 ms. (129 steps per ms) remains 3/3 properties
[2024-05-30 16:21:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 25/36 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 64/100 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 71/171 variables, 26/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 13/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 66/237 variables, 24/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 12/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 66/303 variables, 24/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/303 variables, 12/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/303 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 66/369 variables, 24/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/369 variables, 12/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/369 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 66/435 variables, 24/221 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/435 variables, 12/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/435 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 66/501 variables, 24/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/501 variables, 12/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/501 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 66/567 variables, 24/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/567 variables, 12/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/567 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 66/633 variables, 24/329 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/633 variables, 12/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/633 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 64/697 variables, 24/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/697 variables, 12/377 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/697 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 36/733 variables, 16/393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/733 variables, 8/401 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/733 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (OVERLAPS) 22/755 variables, 8/409 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/755 variables, 4/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/755 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (OVERLAPS) 22/777 variables, 8/421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/777 variables, 4/425 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/777 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (OVERLAPS) 22/799 variables, 8/433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/799 variables, 4/437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/799 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (OVERLAPS) 22/821 variables, 8/445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/821 variables, 4/449 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/821 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (OVERLAPS) 22/843 variables, 8/457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/843 variables, 4/461 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/843 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (OVERLAPS) 22/865 variables, 8/469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/865 variables, 4/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/865 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (OVERLAPS) 15/880 variables, 8/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/880 variables, 4/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/880 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (OVERLAPS) 0/880 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 880/881 variables, and 485 constraints, problems are : Problem set: 0 solved, 3 unsolved in 585 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 325/325 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 25/36 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 64/100 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 71/171 variables, 26/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 13/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 66/237 variables, 24/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 12/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/237 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 66/303 variables, 24/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/303 variables, 12/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/303 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 66/369 variables, 24/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/369 variables, 12/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/369 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 66/435 variables, 24/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/435 variables, 12/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/435 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 66/501 variables, 24/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/501 variables, 12/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/501 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 66/567 variables, 24/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/567 variables, 12/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/567 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 66/633 variables, 24/332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/633 variables, 12/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/633 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 64/697 variables, 24/368 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/697 variables, 12/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/697 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (OVERLAPS) 36/733 variables, 16/396 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/733 variables, 8/404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/733 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (OVERLAPS) 22/755 variables, 8/412 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/755 variables, 4/416 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/755 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (OVERLAPS) 22/777 variables, 8/424 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/777 variables, 4/428 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/777 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (OVERLAPS) 22/799 variables, 8/436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/799 variables, 4/440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/799 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 22/821 variables, 8/448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/821 variables, 4/452 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/821 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (OVERLAPS) 22/843 variables, 8/460 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/843 variables, 4/464 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/843 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (OVERLAPS) 22/865 variables, 8/472 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/865 variables, 4/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/865 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (OVERLAPS) 15/880 variables, 8/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/880 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/880 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (OVERLAPS) 0/880 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 880/881 variables, and 488 constraints, problems are : Problem set: 0 solved, 3 unsolved in 745 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 325/325 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1338ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 278 ms.
Support contains 3 out of 325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 556/556 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 325 transition count 555
Applied a total of 1 rules in 7 ms. Remains 325 /325 variables (removed 0) and now considering 555/556 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 325/325 places, 555/556 transitions.
RANDOM walk for 40000 steps (10 resets) in 1217 ms. (32 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (10 resets) in 203 ms. (196 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (9 resets) in 244 ms. (163 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 237 ms. (168 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 213816 steps, run timeout after 3003 ms. (steps per millisecond=71 ) properties seen :0 out of 3
Probabilistic random walk after 213816 steps, saw 142090 distinct states, run finished after 3003 ms. (steps per millisecond=71 ) properties seen :0
// Phase 1: matrix 555 rows 325 cols
[2024-05-30 16:21:24] [INFO ] Computed 160 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 25/36 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 64/100 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 71/171 variables, 26/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 13/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 66/237 variables, 24/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 12/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 66/303 variables, 24/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/303 variables, 12/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/303 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 66/369 variables, 24/185 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/369 variables, 12/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/369 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 66/435 variables, 24/221 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/435 variables, 12/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/435 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 66/501 variables, 24/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/501 variables, 12/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/501 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 66/567 variables, 24/293 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/567 variables, 12/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/567 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 66/633 variables, 24/329 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/633 variables, 12/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/633 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 64/697 variables, 24/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/697 variables, 12/377 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/697 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 36/733 variables, 16/393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/733 variables, 8/401 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/733 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (OVERLAPS) 22/755 variables, 8/409 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/755 variables, 4/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/755 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (OVERLAPS) 22/777 variables, 8/421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/777 variables, 4/425 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/777 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (OVERLAPS) 22/799 variables, 8/433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/799 variables, 4/437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/799 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (OVERLAPS) 22/821 variables, 8/445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/821 variables, 4/449 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/821 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (OVERLAPS) 22/843 variables, 8/457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/843 variables, 4/461 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/843 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (OVERLAPS) 22/865 variables, 8/469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/865 variables, 4/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/865 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (OVERLAPS) 15/880 variables, 8/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/880 variables, 4/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/880 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (OVERLAPS) 0/880 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 880/880 variables, and 485 constraints, problems are : Problem set: 0 solved, 3 unsolved in 591 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 325/325 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 8/11 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 25/36 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 64/100 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 71/171 variables, 26/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 13/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 66/237 variables, 24/116 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/237 variables, 12/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/237 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 66/303 variables, 24/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/303 variables, 12/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/303 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 66/369 variables, 24/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/369 variables, 12/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/369 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 66/435 variables, 24/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/435 variables, 12/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/435 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 66/501 variables, 24/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/501 variables, 12/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/501 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 66/567 variables, 24/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/567 variables, 12/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/567 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 66/633 variables, 24/332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/633 variables, 12/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/633 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 64/697 variables, 24/368 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/697 variables, 12/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/697 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (OVERLAPS) 36/733 variables, 16/396 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/733 variables, 8/404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/733 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (OVERLAPS) 22/755 variables, 8/412 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/755 variables, 4/416 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/755 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (OVERLAPS) 22/777 variables, 8/424 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/777 variables, 4/428 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/777 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (OVERLAPS) 22/799 variables, 8/436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/799 variables, 4/440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/799 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 22/821 variables, 8/448 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/821 variables, 4/452 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/821 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (OVERLAPS) 22/843 variables, 8/460 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/843 variables, 4/464 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/843 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (OVERLAPS) 22/865 variables, 8/472 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/865 variables, 4/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/865 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (OVERLAPS) 15/880 variables, 8/484 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/880 variables, 4/488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/880 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (OVERLAPS) 0/880 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 880/880 variables, and 488 constraints, problems are : Problem set: 0 solved, 3 unsolved in 769 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 325/325 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1368ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 458 ms.
Support contains 3 out of 325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 555/555 transitions.
Applied a total of 0 rules in 6 ms. Remains 325 /325 variables (removed 0) and now considering 555/555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 325/325 places, 555/555 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 555/555 transitions.
Applied a total of 0 rules in 6 ms. Remains 325 /325 variables (removed 0) and now considering 555/555 (removed 0) transitions.
[2024-05-30 16:21:26] [INFO ] Invariant cache hit.
[2024-05-30 16:21:26] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-30 16:21:26] [INFO ] Invariant cache hit.
[2024-05-30 16:21:26] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
[2024-05-30 16:21:26] [INFO ] Redundant transitions in 4 ms returned []
Running 552 sub problems to find dead transitions.
[2024-05-30 16:21:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 2 (OVERLAPS) 555/880 variables, 325/485 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/880 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 4 (OVERLAPS) 0/880 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 552 unsolved
No progress, stopping.
After SMT solving in domain Real declared 880/880 variables, and 485 constraints, problems are : Problem set: 0 solved, 552 unsolved in 22066 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 325/325 constraints, PredecessorRefiner: 552/552 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 552 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/325 variables, 160/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/325 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 2 (OVERLAPS) 555/880 variables, 325/485 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/880 variables, 552/1037 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/880 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 552 unsolved
At refinement iteration 5 (OVERLAPS) 0/880 variables, 0/1037 constraints. Problems are: Problem set: 0 solved, 552 unsolved
No progress, stopping.
After SMT solving in domain Int declared 880/880 variables, and 1037 constraints, problems are : Problem set: 0 solved, 552 unsolved in 23634 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 325/325 constraints, PredecessorRefiner: 552/552 constraints, Known Traps: 0/0 constraints]
After SMT, in 45871ms problems are : Problem set: 0 solved, 552 unsolved
Search for dead transitions found 0 dead transitions in 45876ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46411 ms. Remains : 325/325 places, 555/555 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 156 edges and 325 vertex of which 4 / 325 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 322 transition count 548
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 322 transition count 547
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 320 transition count 547
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 318 transition count 546
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 13 place count 318 transition count 542
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 318 transition count 541
Applied a total of 14 rules in 36 ms. Remains 318 /325 variables (removed 7) and now considering 541/555 (removed 14) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 541 rows 318 cols
[2024-05-30 16:22:12] [INFO ] Computed 157 invariants in 1 ms
[2024-05-30 16:22:12] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-30 16:22:12] [INFO ] [Nat]Absence check using 157 positive place invariants in 18 ms returned sat
[2024-05-30 16:22:12] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-30 16:22:12] [INFO ] After 249ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-30 16:22:12] [INFO ] After 386ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 492 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 9 factoid took 153 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 26 reset in 459 ms.
Entered a terminal (fully accepting) state of product in 49413 steps with 14 reset in 269 ms.
Treatment of property ShieldRVt-PT-040B-LTLFireability-11 finished in 208145 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-11 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||((p0||X((X(p1) U (p0&&X(p1))))) U p2)))'
[2024-05-30 16:22:14] [INFO ] Flatten gal took : 66 ms
[2024-05-30 16:22:14] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-30 16:22:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1574 places, 1574 transitions and 3868 arcs took 12 ms.
Total runtime 1895346 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldRVt-PT-040B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1574
TRANSITIONS: 1574
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.015s, Sys 0.013s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.004s, 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: 2504
MODEL NAME: /home/mcc/execution/412/model
1574 places, 1574 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