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.r528-tall-171683762401035.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 ltsminxred
Input is ShieldRVt-PT-050B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762401035
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.7K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 21:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 11 21:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 21:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 11 21:20 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 614K 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-050B-LTLCardinality-00
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-01
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-02
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-03
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-04
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-05
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-06
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-07
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-08
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-09
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-10
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-11
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-12
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-13
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-14
FORMULA_NAME ShieldRVt-PT-050B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717278097165

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:41:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 21:41:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:41:38] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2024-06-01 21:41:38] [INFO ] Transformed 2503 places.
[2024-06-01 21:41:38] [INFO ] Transformed 2503 transitions.
[2024-06-01 21:41:38] [INFO ] Found NUPN structural information;
[2024-06-01 21:41:38] [INFO ] Parsed PT model containing 2503 places and 2503 transitions and 5906 arcs in 330 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldRVt-PT-050B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050B-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 2503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2503/2503 places, 2503/2503 transitions.
Discarding 538 places :
Symmetric choice reduction at 0 with 538 rule applications. Total rules 538 place count 1965 transition count 1965
Iterating global reduction 0 with 538 rules applied. Total rules applied 1076 place count 1965 transition count 1965
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1077 place count 1964 transition count 1964
Iterating global reduction 0 with 1 rules applied. Total rules applied 1078 place count 1964 transition count 1964
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1079 place count 1963 transition count 1963
Iterating global reduction 0 with 1 rules applied. Total rules applied 1080 place count 1963 transition count 1963
Applied a total of 1080 rules in 782 ms. Remains 1963 /2503 variables (removed 540) and now considering 1963/2503 (removed 540) transitions.
// Phase 1: matrix 1963 rows 1963 cols
[2024-06-01 21:41:39] [INFO ] Computed 201 invariants in 32 ms
[2024-06-01 21:41:40] [INFO ] Implicit Places using invariants in 821 ms returned []
[2024-06-01 21:41:40] [INFO ] Invariant cache hit.
[2024-06-01 21:41:41] [INFO ] Implicit Places using invariants and state equation in 1349 ms returned []
Implicit Place search using SMT with State Equation took 2198 ms to find 0 implicit places.
Running 1962 sub problems to find dead transitions.
[2024-06-01 21:41:41] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1962/3926 variables, and 0 constraints, problems are : Problem set: 0 solved, 1962 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1963 constraints, PredecessorRefiner: 1962/1962 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1962/3926 variables, and 0 constraints, problems are : Problem set: 0 solved, 1962 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1963 constraints, PredecessorRefiner: 0/1962 constraints, Known Traps: 0/0 constraints]
After SMT, in 60699ms problems are : Problem set: 0 solved, 1962 unsolved
Search for dead transitions found 0 dead transitions in 60734ms
Starting structural reductions in LTL mode, iteration 1 : 1963/2503 places, 1963/2503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63745 ms. Remains : 1963/2503 places, 1963/2503 transitions.
Support contains 30 out of 1963 places after structural reductions.
[2024-06-01 21:42:42] [INFO ] Flatten gal took : 133 ms
[2024-06-01 21:42:43] [INFO ] Flatten gal took : 72 ms
[2024-06-01 21:42:43] [INFO ] Input system was already deterministic with 1963 transitions.
RANDOM walk for 40000 steps (9 resets) in 1552 ms. (25 steps per ms) remains 7/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 7/7 properties
[2024-06-01 21:42:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 260/275 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1688/1963 variables, 181/201 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1963 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1963/3926 variables, 1963/2164 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3926 variables, 0/2164 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/3926 variables, 0/2164 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3926/3926 variables, and 2164 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1562 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 1963/1963 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 260/275 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1688/1963 variables, 181/201 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 21:42:46] [INFO ] Deduced a trap composed of 18 places in 295 ms of which 43 ms to minimize.
[2024-06-01 21:42:46] [INFO ] Deduced a trap composed of 22 places in 273 ms of which 6 ms to minimize.
[2024-06-01 21:42:46] [INFO ] Deduced a trap composed of 24 places in 241 ms of which 5 ms to minimize.
[2024-06-01 21:42:47] [INFO ] Deduced a trap composed of 32 places in 230 ms of which 5 ms to minimize.
[2024-06-01 21:42:47] [INFO ] Deduced a trap composed of 33 places in 222 ms of which 4 ms to minimize.
[2024-06-01 21:42:47] [INFO ] Deduced a trap composed of 26 places in 216 ms of which 4 ms to minimize.
[2024-06-01 21:42:47] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 4 ms to minimize.
[2024-06-01 21:42:48] [INFO ] Deduced a trap composed of 43 places in 186 ms of which 4 ms to minimize.
[2024-06-01 21:42:48] [INFO ] Deduced a trap composed of 48 places in 189 ms of which 5 ms to minimize.
[2024-06-01 21:42:48] [INFO ] Deduced a trap composed of 38 places in 181 ms of which 4 ms to minimize.
[2024-06-01 21:42:48] [INFO ] Deduced a trap composed of 57 places in 176 ms of which 3 ms to minimize.
[2024-06-01 21:42:48] [INFO ] Deduced a trap composed of 64 places in 168 ms of which 3 ms to minimize.
[2024-06-01 21:42:49] [INFO ] Deduced a trap composed of 45 places in 174 ms of which 4 ms to minimize.
[2024-06-01 21:42:49] [INFO ] Deduced a trap composed of 58 places in 164 ms of which 4 ms to minimize.
[2024-06-01 21:42:49] [INFO ] Deduced a trap composed of 50 places in 158 ms of which 3 ms to minimize.
[2024-06-01 21:42:49] [INFO ] Deduced a trap composed of 54 places in 163 ms of which 4 ms to minimize.
[2024-06-01 21:42:49] [INFO ] Deduced a trap composed of 74 places in 151 ms of which 3 ms to minimize.
[2024-06-01 21:42:49] [INFO ] Deduced a trap composed of 79 places in 146 ms of which 3 ms to minimize.
[2024-06-01 21:42:50] [INFO ] Deduced a trap composed of 78 places in 145 ms of which 3 ms to minimize.
[2024-06-01 21:42:50] [INFO ] Deduced a trap composed of 66 places in 151 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1963 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 21:42:50] [INFO ] Deduced a trap composed of 58 places in 148 ms of which 3 ms to minimize.
[2024-06-01 21:42:50] [INFO ] Deduced a trap composed of 69 places in 145 ms of which 4 ms to minimize.
SMT process timed out in 6681ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 1963 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 541 transitions
Trivial Post-agglo rules discarded 541 transitions
Performed 541 trivial Post agglomeration. Transition count delta: 541
Iterating post reduction 0 with 541 rules applied. Total rules applied 541 place count 1963 transition count 1422
Reduce places removed 541 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 544 rules applied. Total rules applied 1085 place count 1422 transition count 1419
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1088 place count 1419 transition count 1419
Performed 391 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 391 Pre rules applied. Total rules applied 1088 place count 1419 transition count 1028
Deduced a syphon composed of 391 places in 1 ms
Reduce places removed 391 places and 0 transitions.
Iterating global reduction 3 with 782 rules applied. Total rules applied 1870 place count 1028 transition count 1028
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1875 place count 1023 transition count 1023
Iterating global reduction 3 with 5 rules applied. Total rules applied 1880 place count 1023 transition count 1023
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 1880 place count 1023 transition count 1019
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 1888 place count 1019 transition count 1019
Performed 445 Post agglomeration using F-continuation condition.Transition count delta: 445
Deduced a syphon composed of 445 places in 1 ms
Reduce places removed 445 places and 0 transitions.
Iterating global reduction 3 with 890 rules applied. Total rules applied 2778 place count 574 transition count 574
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2779 place count 574 transition count 573
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 2781 place count 573 transition count 572
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -96
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 2983 place count 472 transition count 668
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 3073 place count 427 transition count 713
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 3074 place count 427 transition count 712
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 3077 place count 427 transition count 709
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 3080 place count 424 transition count 709
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 3083 place count 424 transition count 706
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3084 place count 423 transition count 705
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3085 place count 422 transition count 705
Applied a total of 3085 rules in 434 ms. Remains 422 /1963 variables (removed 1541) and now considering 705/1963 (removed 1258) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 434 ms. Remains : 422/1963 places, 705/1963 transitions.
RANDOM walk for 40000 steps (14 resets) in 488 ms. (81 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 260 ms. (153 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 196 ms. (203 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 177 ms. (224 steps per ms) remains 4/4 properties
// Phase 1: matrix 705 rows 422 cols
[2024-06-01 21:42:51] [INFO ] Computed 200 invariants in 3 ms
[2024-06-01 21:42:51] [INFO ] State equation strengthened by 228 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 26/34 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 168/202 variables, 83/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 336/538 variables, 202/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 216/512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 38/576 variables, 12/524 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/576 variables, 6/530 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/576 variables, 2/532 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/576 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 52/628 variables, 18/550 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/628 variables, 9/559 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/628 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 47/675 variables, 18/577 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/675 variables, 9/586 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/675 variables, 0/586 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 46/721 variables, 16/602 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/721 variables, 5/607 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/721 variables, 7/614 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/721 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 2/723 variables, 3/617 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/723 variables, 2/619 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/723 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 2/725 variables, 1/620 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/725 variables, 0/620 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 42/767 variables, 16/636 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/767 variables, 7/643 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/767 variables, 3/646 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/767 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 43/810 variables, 16/662 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/810 variables, 8/670 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/810 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (OVERLAPS) 45/855 variables, 16/686 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/855 variables, 7/693 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/855 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 1/856 variables, 1/694 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/856 variables, 1/695 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/856 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (OVERLAPS) 44/900 variables, 16/711 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/900 variables, 8/719 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/900 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (OVERLAPS) 42/942 variables, 16/735 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/942 variables, 8/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/942 variables, 0/743 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (OVERLAPS) 45/987 variables, 16/759 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/987 variables, 7/766 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/987 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (OVERLAPS) 2/989 variables, 1/767 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/989 variables, 0/767 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (OVERLAPS) 45/1034 variables, 18/785 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1034 variables, 7/792 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1034 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (OVERLAPS) 1/1035 variables, 1/793 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/1035 variables, 1/794 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1035 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (OVERLAPS) 43/1078 variables, 16/810 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1078 variables, 8/818 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1078 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (OVERLAPS) 42/1120 variables, 17/835 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/1120 variables, 7/842 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1120 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (OVERLAPS) 1/1121 variables, 1/843 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/1121 variables, 1/844 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1121 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (OVERLAPS) 6/1127 variables, 4/848 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/1127 variables, 2/850 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1127 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (OVERLAPS) 0/1127 variables, 0/850 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1127/1127 variables, and 850 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1825 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 422/422 constraints, ReadFeed: 228/228 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 26/34 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 168/202 variables, 83/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 336/538 variables, 202/296 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 216/512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 4/516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 38/576 variables, 12/528 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/576 variables, 6/534 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/576 variables, 2/536 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/576 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 52/628 variables, 18/554 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/628 variables, 9/563 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/628 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 47/675 variables, 18/581 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/675 variables, 9/590 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/675 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 46/721 variables, 16/606 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/721 variables, 5/611 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/721 variables, 7/618 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/721 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 2/723 variables, 3/621 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/723 variables, 2/623 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/723 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 2/725 variables, 1/624 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/725 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 42/767 variables, 16/640 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/767 variables, 7/647 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/767 variables, 3/650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/767 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 43/810 variables, 16/666 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/810 variables, 8/674 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/810 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (OVERLAPS) 45/855 variables, 16/690 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/855 variables, 7/697 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/855 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (OVERLAPS) 1/856 variables, 1/698 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/856 variables, 1/699 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/856 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 44/900 variables, 16/715 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/900 variables, 8/723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/900 variables, 0/723 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (OVERLAPS) 42/942 variables, 16/739 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/942 variables, 8/747 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/942 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (OVERLAPS) 45/987 variables, 16/763 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/987 variables, 7/770 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/987 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (OVERLAPS) 2/989 variables, 1/771 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/989 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (OVERLAPS) 45/1034 variables, 18/789 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1034 variables, 7/796 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1034 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 55 (OVERLAPS) 1/1035 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1035 variables, 1/798 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/1035 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 58 (OVERLAPS) 43/1078 variables, 16/814 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/1078 variables, 8/822 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/1078 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 61 (OVERLAPS) 42/1120 variables, 17/839 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/1120 variables, 7/846 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/1120 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 64 (OVERLAPS) 1/1121 variables, 1/847 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/1121 variables, 1/848 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/1121 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 67 (OVERLAPS) 6/1127 variables, 4/852 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/1127 variables, 2/854 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/1127 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 70 (OVERLAPS) 0/1127 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1127/1127 variables, and 854 constraints, problems are : Problem set: 0 solved, 4 unsolved in 25809 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 422/422 constraints, ReadFeed: 228/228 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 27653ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 981 ms.
Support contains 8 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 705/705 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 422 transition count 703
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 420 transition count 703
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 420 transition count 700
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 417 transition count 700
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 414 transition count 697
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 18 place count 413 transition count 699
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 412 transition count 698
Applied a total of 19 rules in 44 ms. Remains 412 /422 variables (removed 10) and now considering 698/705 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 412/422 places, 698/705 transitions.
RANDOM walk for 40000 steps (16 resets) in 480 ms. (83 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 202 ms. (197 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 98 ms. (404 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 140 ms. (283 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 168465 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 4
Probabilistic random walk after 168465 steps, saw 110366 distinct states, run finished after 3005 ms. (steps per millisecond=56 ) properties seen :0
// Phase 1: matrix 698 rows 412 cols
[2024-06-01 21:43:23] [INFO ] Computed 200 invariants in 2 ms
[2024-06-01 21:43:23] [INFO ] State equation strengthened by 218 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 26/34 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 166/200 variables, 83/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 334/534 variables, 200/294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 216/510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 38/572 variables, 12/522 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/572 variables, 6/528 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 2/530 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/572 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 52/624 variables, 18/548 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/624 variables, 9/557 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/624 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 47/671 variables, 18/575 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/671 variables, 9/584 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/671 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 44/715 variables, 16/600 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/715 variables, 8/608 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/715 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 44/759 variables, 16/624 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/759 variables, 8/632 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/759 variables, 0/632 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 43/802 variables, 16/648 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/802 variables, 8/656 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/802 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 44/846 variables, 16/672 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/846 variables, 8/680 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/846 variables, 0/680 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 44/890 variables, 16/696 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/890 variables, 8/704 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/890 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 44/934 variables, 16/720 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/934 variables, 8/728 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/934 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (OVERLAPS) 44/978 variables, 16/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/978 variables, 8/752 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/978 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (OVERLAPS) 44/1022 variables, 16/768 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1022 variables, 8/776 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1022 variables, 0/776 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (OVERLAPS) 44/1066 variables, 16/792 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1066 variables, 8/800 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1066 variables, 0/800 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (OVERLAPS) 38/1104 variables, 16/816 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1104 variables, 8/824 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1104 variables, 0/824 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (OVERLAPS) 6/1110 variables, 4/828 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1110 variables, 2/830 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1110 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (OVERLAPS) 0/1110 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1110/1110 variables, and 830 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1280 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 412/412 constraints, ReadFeed: 218/218 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 26/34 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 166/200 variables, 83/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 334/534 variables, 200/294 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 216/510 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 4/514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 38/572 variables, 12/526 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/572 variables, 6/532 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/572 variables, 2/534 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/572 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 52/624 variables, 18/552 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/624 variables, 9/561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/624 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 47/671 variables, 18/579 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/671 variables, 9/588 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/671 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 44/715 variables, 16/604 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/715 variables, 8/612 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/715 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 44/759 variables, 16/628 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/759 variables, 8/636 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/759 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 43/802 variables, 16/652 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/802 variables, 8/660 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/802 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (OVERLAPS) 44/846 variables, 16/676 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/846 variables, 8/684 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/846 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (OVERLAPS) 44/890 variables, 16/700 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/890 variables, 8/708 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/890 variables, 0/708 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 34 (OVERLAPS) 44/934 variables, 16/724 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/934 variables, 8/732 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/934 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 44/978 variables, 16/748 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/978 variables, 8/756 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/978 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (OVERLAPS) 44/1022 variables, 16/772 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1022 variables, 8/780 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1022 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 43 (OVERLAPS) 44/1066 variables, 16/796 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1066 variables, 8/804 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1066 variables, 0/804 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 46 (OVERLAPS) 38/1104 variables, 16/820 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1104 variables, 8/828 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1104 variables, 0/828 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 49 (OVERLAPS) 6/1110 variables, 4/832 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1110 variables, 2/834 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1110 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 52 (OVERLAPS) 0/1110 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1110/1110 variables, and 834 constraints, problems are : Problem set: 0 solved, 4 unsolved in 6890 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 412/412 constraints, ReadFeed: 218/218 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 8186ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 444 ms.
Support contains 8 out of 412 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 698/698 transitions.
Applied a total of 0 rules in 12 ms. Remains 412 /412 variables (removed 0) and now considering 698/698 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 412/412 places, 698/698 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 698/698 transitions.
Applied a total of 0 rules in 11 ms. Remains 412 /412 variables (removed 0) and now considering 698/698 (removed 0) transitions.
[2024-06-01 21:43:32] [INFO ] Invariant cache hit.
[2024-06-01 21:43:32] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-06-01 21:43:32] [INFO ] Invariant cache hit.
[2024-06-01 21:43:32] [INFO ] State equation strengthened by 218 read => feed constraints.
[2024-06-01 21:43:33] [INFO ] Implicit Places using invariants and state equation in 1180 ms returned []
Implicit Place search using SMT with State Equation took 1387 ms to find 0 implicit places.
[2024-06-01 21:43:33] [INFO ] Redundant transitions in 41 ms returned []
Running 693 sub problems to find dead transitions.
[2024-06-01 21:43:33] [INFO ] Invariant cache hit.
[2024-06-01 21:43:33] [INFO ] State equation strengthened by 218 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 2 (OVERLAPS) 2/412 variables, 94/200 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 4 (OVERLAPS) 698/1110 variables, 412/612 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1110 variables, 218/830 constraints. Problems are: Problem set: 0 solved, 693 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1110/1110 variables, and 830 constraints, problems are : Problem set: 0 solved, 693 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 412/412 constraints, ReadFeed: 218/218 constraints, PredecessorRefiner: 693/693 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 693 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 2 (OVERLAPS) 2/412 variables, 94/200 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 4 (OVERLAPS) 698/1110 variables, 412/612 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1110 variables, 218/830 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1110 variables, 693/1523 constraints. Problems are: Problem set: 0 solved, 693 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 1110/1110 variables, and 1523 constraints, problems are : Problem set: 0 solved, 693 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 412/412 constraints, ReadFeed: 218/218 constraints, PredecessorRefiner: 693/693 constraints, Known Traps: 0/0 constraints]
After SMT, in 60273ms problems are : Problem set: 0 solved, 693 unsolved
Search for dead transitions found 0 dead transitions in 60280ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61730 ms. Remains : 412/412 places, 698/698 transitions.
Computed a total of 602 stabilizing places and 602 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' '!((X(p0)||G(p1)))'
Support contains 3 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1952 transition count 1952
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1952 transition count 1952
Applied a total of 22 rules in 171 ms. Remains 1952 /1963 variables (removed 11) and now considering 1952/1963 (removed 11) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2024-06-01 21:44:34] [INFO ] Computed 201 invariants in 14 ms
[2024-06-01 21:44:35] [INFO ] Implicit Places using invariants in 442 ms returned []
[2024-06-01 21:44:35] [INFO ] Invariant cache hit.
[2024-06-01 21:44:36] [INFO ] Implicit Places using invariants and state equation in 1462 ms returned []
Implicit Place search using SMT with State Equation took 1906 ms to find 0 implicit places.
Running 1951 sub problems to find dead transitions.
[2024-06-01 21:44:36] [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 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 1.0)
(s1244 1.0)
(s1245 1.0)
(s1246 1.0)
(s1247 1.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 1.0)
(s1252 1.0)
(s1253 1.0)
(s1254 1.0)
(s1255 1.0)
(s1256 1.0)
(s1257 1.0)
(s1258 1.0)
(s1259 1.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 1.0)
(s1270 1.0)
(s1271 1.0)
(s1272 1.0)
(s1273 1.0)
(s1274 1.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 1.0)
(s1291 1.0)
(s1292 1.0)
(s1293 1.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 1.0)
(s1304 1.0)
(s1305 1.0)
(s1306 1.0)
(s1307 1.0)
(s1308 1.0)
(s1309 1.0)
(s1310 1.0)
(s1311 1.0)
(s1312 1.0)
(s1313 1.0)
(s1314 1.0)
(s1315 1.0)
(s1316 1.0)
(s1317 1.0)
(s1318 1.0)
(s1319 1.0)
(s1320 1.0)
(s1321 1.0)
(s1322 1.0)
(s1323 1.0)
(s1324 1.0)
(s1325 1.0)
(s1326 1.0)
(s1327 1.0)
(s1328 1.0)
(s1329 1.0)
(s1330 1.0)
(s1331 1.0)
(s1332 1.0)
(s1333 1.0)
(s1334 1.0)
(s1335 1.0)
(s1336 1.0)
(s1337 1.0)
(s1338 1.0)
(s1339 1.0)
(s1340 1.0)
(s1341 1.0)
(s1342 1.0)
(s1343 1.0)
(s1344 1.0)
(s1345 1.0)
(s1346 1.0)
(s1347 1.0)
(s1348 1.0)
(s1349 1.0)
(s1350 1.0)
(s1351 1.0)
(s1352 1.0)
(s1353 1.0)
(s1354 1.0)
(s1355 1.0)
(s1356 1.0)
(s1357 1.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 1.0)
(s1362 1.0)
(s1363 1.0)
(s1364 1.0)
(s1365 1.0)
(s1366 1.0)
(s1367 1.0)
(s1368 1.0)
(s1369 1.0)
(s1370 1.0)
(s1371 1.0)
(s1372 1.0)
(s1373 1.0)
(s1374 1.0)
(s1375 1.0)
(s1376 1.0)
(s1377 1.0)
(s1378 1.0)
(s1379 1.0)
(s1380 1.0)
(s1381 1.0)
(s1382 1.0)
(s1383 1.0)
(s1384 1.0)
(s1385 1.0)
(s1386 1.0)
(s1387 1.0)
(s1388 1.0)
(s1389 1.0)
(s1390 1.0)
(s1391 1.0)
(s1392 1.0)
(s1393 1.0)
(s1394 1.0)
(s1395 1.0)
(s1396 1.0)
(s1397 1.0)
(s1398 1.0)
(s1399 1.0)
(s1400 1.0)
(s1401 1.0)
(s1402 1.0)
(s1403 1.0)
(s1404 1.0)
(s1405 1.0)
(s1406 1.0)
(s1407 1.0)
(s1408 1.0)
(s1409 1.0)
(s1410 1.0)
(s1411 1.0)
(s1412 1.0)
(s1413 1.0)
(s1414 1.0)
(s1415 1.0)
(s1416 1.0)
(s1417 1.0)
(s1418 1.0)
(s1419 1.0)
(s1420 1.0)
(s1421 1.0)
(s1422 1.0)
(s1423 1.0)
(s1424 1.0)
(s1425 1.0)
(s1426 1.0)
(s1427 1.0)
(s1428 1.0)
(s1429 1.0)
(s1430 1.0)
(s1431 1.0)
(s1432 1.0)
(s1433 1.0)
(s1434 1.0)
(s1435 1.0)
(s1436 1.0)
(s1437 1.0)
(s1438 1.0)
(s1439 1.0)
(s1440 1.0)
(s1441 1.0)
(s1442 1.0)
(s1443 1.0)
(s1444 1.0)
(s1445 1.0)
(s1446 1.0)
(s1447 1.0)
(s1448 1.0)
(s1449 1.0)
(s1450 1.0)
(s1451 1.0)
(s1452 1.0)
(s1453 1.0)
(s1454 1.0)
(s1455 1.0)
(s1456 1.0)
(s1457 1.0)
(s1458 1.0)
(s1459 1.0)
(s1460 1.0)
(s1461 1.0)
(s1462 1.0)
(s1463 1.0)
(s1464 1.0)
(s1465 1.0)
(s1466 1.0)
(s1467 1.0)
(s1468 1.0)
(s1469 1.0)
(s1470 1.0)
(s1471 1.0)
(s1472 1.0)
(s1473 1.0)
(s1474 1.0)
(s1475 1.0)
(s1476 1.0)
(s1477 1.0)
(s1478 1.0)
(s1479 1.0)
(s1480 1.0)
(s1481 1.0)
(s1482 1.0)
(s1483 1.0)
(s1484 1.0)
(s1485 1.0)
(s1486 1.0)
(s1487 1.0)
(s1488 1.0)
(s1489 1.0)
(s1490 1.0)
(s1491 1.0)
(s1492 1.0)
(s1493 1.0)
(s1494 1.0)
(s1495 1.0)
(s1496 1.0)
(s1497 1.0)
(s1498 1.0)
(s1499 1.0)
(s1500 1.0)
(s1501 1.0)
(s1502 1.0)
(s1503 1.0)
(s1504 1.0)
(s1505 1.0)
(s1506 1.0)
(s1507 1.0)
(s1508 1.0)
(s1509 1.0)
(s1510 1.0)
(s1511 1.0)
(s1512 1.0)
(s1513 1.0)
(s1514 1.0)
(s1515 1.0)
(s1516 1.0)
(s1517 1.0)
(s1518 1.0)
(s1519 1.0)
(s1520 1.0)
(s1521 1.0)
(s1522 1.0)
(s1523 1.0)
(s1524 1.0)
(s1525 1.0)
(s1526 1.0)
(s1527 1.0)
(s1528 1.0)
(s1529 1.0)
(s1530 1.0)
(s1531 1.0)
(s1532 1.0)
(s1533 1.0)
(s1534 1.0)
(s1535 1.0)
(s1536 1.0)
(s1537 1.0)
(s1538 1.0)
(s1539 1.0)
(s1540 1.0)
(s1541 1.0)
(s1542 1.0)
(s1543 1.0)
(s1544 1.0)
(s1545 1.0)
(s1546 1.0)
(s1547 1.0)
(s1548 1.0)
(s1549 1.0)
(s1550 1.0)
(s1551 1.0)
(s1552 1.0)
(s1553 1.0)
(s1554 1.0)
(s1555 1.0)
(s1556 1.0)
(s1557 1.0)
(s1558 1.0)
(s1559 1.0)
(s1560 1.0)
(s1561 1.0)
(s1562 1.0)
(s1563 1.0)
(s1564 1.0)
(s1565 1.0)
(s1566 1.0)
(s1567 1.0)
(s1568 1.0)
(s1569 1.0)
(s1570 1.0)
(s1571 1.0)
(s1572 1.0)
(s1573 1.0)
(s1574 1.0)
(s1575 1.0)
(s1576 1.0)
(s1577 1.0)
(s1578 1.0)
(s1579 1.0)
(s1580 1.0)
(s1581 1.0)
(s1582 1.0)
(s1583 1.0)
(s1584 1.0)
(s1585 1.0)
(s1586 1.0)
(s1587 1.0)
(s1588 1.0)
(s1589 1.0)
(s1590 1.0)
(s1591 1.0)
(s1592 1.0)
(s1593 1.0)
(s1594 1.0)
(s1595 1.0)
(s1596 1.0)
(s1597 1.0)
(s1598 1.0)
(s1599 1.0)
(s1600 1.0)
(s1601 1.0)
(s1602 1.0)
(s1603 1.0)
(s1604 1.0)
(s1605 1.0)
(s1606 1.0)
(s1607 1.0)
(s1608 1.0)
(s1609 1.0)
(s1610 1.0)
(s1611 1.0)
(s1612 1.0)
(s1613 1.0)
(s1614 1.0)
(s1615 1.0)
(s1616 1.0)
(s1617 1.0)
(s1618 1.0)
(s1619 1.0)
(s1620 1.0)
(s1621 1.0)
(s1622 1.0)
(s1623 1.0)
(s1624 1.0)
(s1625 1.0)
(s1626 1.0)
(s1627 1.0)
(s1628 1.0)
(s1629 1.0)
(s1630 1.0)
(s1631 1.0)
(s1632 1.0)
(s1633 1.0)
(s1634 1.0)
(s1635 1.0)
(s1636 1.0)
(s1637 1.0)
(s1638 1.0)
(s1639 1.0)
(s1640 1.0)
(s1641 1.0)
(s1642 1.0)
(s1643 1.0)
(s1644 1.0)
(s1645 1.0)
(s1646 1.0)
(s1647 1.0)
(s1648 1.0)
(s1649 1.0)
(s1650 1.0)
(s1651 1.0)
(s1652 1.0)
(s1653 1.0)
(s1654 1.0)
(s1655 1.0)
(s1656 1.0)
(s1657 1.0)
(s1658 1.0)
(s1659 1.0)
(s1660 1.0)
(s1661 1.0)
(s1662 1.0)
(s1663 1.0)
(s1664 1.0)
(s1665 1.0)
(s1666 1.0)
(s1667 1.0)
(s1668 1.0)
(s1669 1.0)
(s1670 1.0)
(s1671 1.0)
(s1672 1.0)
(s1673 1.0)
(s1674 1.0)
(s1675 1.0)
(s1676 1.0)
(s1677 1.0)
(s1678 1.0)
(s1679 1.0)
(s1680 1.0)
(s1681 1.0)
(s1682 1.0)
(s1683 1.0)
(s1684 1.0)
(s1685 1.0)
(s1686 1.0)
(s1687 1.0)
(s1688 1.0)
(s1689 1.0)
(s1690 1.0)
(s1691 1.0)
(s1692 1.0)
(s1693 1.0)
(s1694 1.0)
(s1695 1.0)
(s1696 1.0)
(s1697 1.0)
(s1698 1.0)
(s1699 1.0)
(s1700 1.0)
(s1701 1.0)
(s1702 1.0)
(s1703 1.0)
(s1704 1.0)
(s1705 1.0)
(s1706 1.0)
(s1707 1.0)
(s1708 1.0)
(s1709 1.0)
(s1710 1.0)
(s1711 1.0)
(s1712 1.0)
(s1713 1.0)
(s1714 1.0)
(s1715 1.0)
(s1716 1.0)
(s1717 1.0)
(s1718 1.0)
(s1719 1.0)
(s1720 1.0)
(s1721 1.0)
(s1722 1.0)
(s1723 1.0)
(s1724 1.0)
(s1725 1.0)
(s1726 1.0)
(s1727 1.0)
(s1728 1.0)
(s1729 1.0)
(s1730 1.0)
(s1731 1.0)
(s1732 1.0)
(s1733 1.0)
(s1734 1.0)
(s1735 1.0)
(s1736 1.0)
(s1737 1.0)
(s1738 1.0)
(s1739 1.0)
(s1740 1.0)
(s1741 1.0)
(s1742 1.0)
(s1743 1.0)
(s1744 1.0)
(s1745 1.0)
(s1746 1.0)
(s1747 1.0)
(s1748 1.0)
(s1749 1.0)
(s1750 1.0)
(s1751 1.0)
(s1752 1.0)
(s1753 1.0)
(s1754 1.0)
(s1755 1.0)
(s1756 1.0)
(s1757 1.0)
(s1758 1.0)
(s1759 1.0)
(s1760 1.0)
(s1761 1.0)
(s1762 1.0)
(s1763 1.0)
(s1764 1.0)
(s1765 1.0)
(s1766 1.0)
(s1767 1.0)
(s1768 1.0)
(s1769 1.0)
(s1770 1.0)
(s1771 1.0)
(s1772 1.0)
(s1773 1.0)
(s1774 1.0)
(s1775 1.0)
(s1776 1.0)
(s1777 1.0)
(s1778 1.0)
(s1779 1.0)
(s1780 1.0)
(s1781 1.0)
(s1782 1.0)
(s1783 1.0)
(s1784 1.0)
(s1785 1.0)
(s1786 1.0)
(s1787 1.0)
(s1788 1.0)
(s1789 1.0)
(s1790 1.0)
(s1791 1.0)
(s1792 1.0)
(s1793 1.0)
(s1794 1.0)
(s1795 1.0)
(s1796 1.0)
(s1797 1.0)
(s1798 1.0)
(s1799 1.0)
(s1800 1.0)
(s1801 1.0)
(s1802 1.0)
(s1803 1.0)
(s1804 1.0)
(s1805 1.0)
(s1806 1.0)
(s1807 1.0)
(s1808 1.0)
(s1809 1.0)
(s1810 1.0)
(s1811 1.0)
(s1812 1.0)
(s1813 1.0)
(s1814 1.0)
(s1815 1.0)
(s1816 1.0)
(s1817 1.0)
(s1818 1.0)
(s1819 1.0)
(s1820 1.0)
(s1821 1.0)
(s1822 1.0)
(s1823 1.0)
(s1824 1.0)
(s1825 1.0)
(s1826 1.0)
(s1827 1.0)
(s1828 1.0)
(s1829 1.0)
(s1830 1.0)
(s1831 1.0)
(s1832 1.0)
(s1833 1.0)
(s1834 1.0)
(s1835 1.0)
(s1836 1.0)
(s1837 1.0)
(s1838 1.0)
(s1839 1.0)
(s1840 1.0)
(s1841 1.0)
(s1842 1.0)
(s1843 1.0)
(s1844 1.0)
(s1845 1.0)
(s1846 1.0)
(s1847 1.0)
(s1848 1.0)
(s1849 1.0)
(s1850 1.0)
(s1851 1.0)
(s1852 1.0)
(s1853 1.0)
(s1854 1.0)
(s1855 1.0)
(s1856 1.0)
(s1857 1.0)
(s1858 1.0)
(s1859 1.0)
(s1860 1.0)
(s1861 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1951/3904 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1952 constraints, PredecessorRefiner: 1951/1951 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1951 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1951/3904 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1952 constraints, PredecessorRefiner: 0/1951 constraints, Known Traps: 0/0 constraints]
After SMT, in 60478ms problems are : Problem set: 0 solved, 1951 unsolved
Search for dead transitions found 0 dead transitions in 60502ms
Starting structural reductions in LTL mode, iteration 1 : 1952/1963 places, 1952/1963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62586 ms. Remains : 1952/1963 places, 1952/1963 transitions.
Stuttering acceptance computed with spot in 360 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-00
Product exploration explored 100000 steps with 4 reset in 612 ms.
Product exploration explored 100000 steps with 1 reset in 812 ms.
Computed a total of 598 stabilizing places and 598 stable transitions
Computed a total of 598 stabilizing places and 598 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 78 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 241 ms. (165 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 198784 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 1
Probabilistic random walk after 198784 steps, saw 107433 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2024-06-01 21:45:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 67/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1883/1952 variables, 199/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1952 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1952/3904 variables, 1952/2153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3904 variables, 0/2153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3904 variables, 0/2153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3904/3904 variables, and 2153 constraints, problems are : Problem set: 0 solved, 1 unsolved in 780 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 1952/1952 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) 67/69 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1883/1952 variables, 199/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 21:45:43] [INFO ] Deduced a trap composed of 50 places in 226 ms of which 5 ms to minimize.
[2024-06-01 21:45:43] [INFO ] Deduced a trap composed of 25 places in 203 ms of which 4 ms to minimize.
[2024-06-01 21:45:43] [INFO ] Deduced a trap composed of 31 places in 232 ms of which 4 ms to minimize.
[2024-06-01 21:45:44] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 4 ms to minimize.
[2024-06-01 21:45:44] [INFO ] Deduced a trap composed of 42 places in 198 ms of which 4 ms to minimize.
[2024-06-01 21:45:44] [INFO ] Deduced a trap composed of 36 places in 167 ms of which 3 ms to minimize.
[2024-06-01 21:45:44] [INFO ] Deduced a trap composed of 65 places in 160 ms of which 4 ms to minimize.
[2024-06-01 21:45:44] [INFO ] Deduced a trap composed of 57 places in 157 ms of which 3 ms to minimize.
[2024-06-01 21:45:45] [INFO ] Deduced a trap composed of 62 places in 150 ms of which 3 ms to minimize.
[2024-06-01 21:45:45] [INFO ] Deduced a trap composed of 56 places in 138 ms of which 3 ms to minimize.
[2024-06-01 21:45:45] [INFO ] Deduced a trap composed of 61 places in 134 ms of which 3 ms to minimize.
[2024-06-01 21:45:45] [INFO ] Deduced a trap composed of 56 places in 132 ms of which 3 ms to minimize.
[2024-06-01 21:45:45] [INFO ] Deduced a trap composed of 73 places in 132 ms of which 3 ms to minimize.
[2024-06-01 21:45:45] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 3 ms to minimize.
[2024-06-01 21:45:46] [INFO ] Deduced a trap composed of 59 places in 116 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1952 variables, 15/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1952 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1952/3904 variables, 1952/2168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3904 variables, 1/2169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 21:45:47] [INFO ] Deduced a trap composed of 30 places in 252 ms of which 5 ms to minimize.
[2024-06-01 21:45:47] [INFO ] Deduced a trap composed of 31 places in 260 ms of which 5 ms to minimize.
[2024-06-01 21:45:47] [INFO ] Deduced a trap composed of 39 places in 246 ms of which 5 ms to minimize.
[2024-06-01 21:45:47] [INFO ] Deduced a trap composed of 40 places in 228 ms of which 5 ms to minimize.
SMT process timed out in 5872ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1952/1952 places, 1952/1952 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1952 transition count 1405
Reduce places removed 547 places and 0 transitions.
Iterating post reduction 1 with 547 rules applied. Total rules applied 1094 place count 1405 transition count 1405
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 1094 place count 1405 transition count 1006
Deduced a syphon composed of 399 places in 1 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 1892 place count 1006 transition count 1006
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1893 place count 1005 transition count 1005
Iterating global reduction 2 with 1 rules applied. Total rules applied 1894 place count 1005 transition count 1005
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1894 place count 1005 transition count 1004
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 1896 place count 1004 transition count 1004
Performed 449 Post agglomeration using F-continuation condition.Transition count delta: 449
Deduced a syphon composed of 449 places in 0 ms
Reduce places removed 449 places and 0 transitions.
Iterating global reduction 2 with 898 rules applied. Total rules applied 2794 place count 555 transition count 555
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2795 place count 555 transition count 554
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 2797 place count 554 transition count 553
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 2999 place count 453 transition count 653
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3095 place count 405 transition count 701
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3096 place count 405 transition count 700
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3097 place count 404 transition count 699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3098 place count 403 transition count 699
Applied a total of 3098 rules in 232 ms. Remains 403 /1952 variables (removed 1549) and now considering 699/1952 (removed 1253) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 403/1952 places, 699/1952 transitions.
RANDOM walk for 40000 steps (18 resets) in 326 ms. (122 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (9 resets) in 198 ms. (201 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 20423 steps, run visited all 1 properties in 194 ms. (steps per millisecond=105 )
Probabilistic random walk after 20423 steps, saw 12880 distinct states, run finished after 197 ms. (steps per millisecond=103 ) properties seen :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 6 factoid took 104 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-050B-LTLCardinality-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-050B-LTLCardinality-00 finished in 74343 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&&G(p1)))))'
Support contains 4 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1952 transition count 1952
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1952 transition count 1952
Applied a total of 22 rules in 185 ms. Remains 1952 /1963 variables (removed 11) and now considering 1952/1963 (removed 11) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2024-06-01 21:45:48] [INFO ] Computed 201 invariants in 16 ms
[2024-06-01 21:45:49] [INFO ] Implicit Places using invariants in 443 ms returned []
[2024-06-01 21:45:49] [INFO ] Invariant cache hit.
[2024-06-01 21:45:50] [INFO ] Implicit Places using invariants and state equation in 1428 ms returned []
Implicit Place search using SMT with State Equation took 1873 ms to find 0 implicit places.
Running 1951 sub problems to find dead transitions.
[2024-06-01 21:45:50] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1951/3904 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1952 constraints, PredecessorRefiner: 1951/1951 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1951 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1951/3904 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1952 constraints, PredecessorRefiner: 0/1951 constraints, Known Traps: 0/0 constraints]
After SMT, in 60497ms problems are : Problem set: 0 solved, 1951 unsolved
Search for dead transitions found 0 dead transitions in 60515ms
Starting structural reductions in LTL mode, iteration 1 : 1952/1963 places, 1952/1963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62579 ms. Remains : 1952/1963 places, 1952/1963 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-01
Product exploration explored 100000 steps with 3 reset in 523 ms.
Product exploration explored 100000 steps with 2 reset in 755 ms.
Computed a total of 598 stabilizing places and 598 stable transitions
Computed a total of 598 stabilizing places and 598 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 92 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (8 resets) in 326 ms. (122 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
[2024-06-01 21:46:53] [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) 43/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1907/1952 variables, 199/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1952 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1952/3904 variables, 1952/2153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3904 variables, 0/2153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3904 variables, 0/2153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3904/3904 variables, and 2153 constraints, problems are : Problem set: 0 solved, 1 unsolved in 822 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 1952/1952 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) 43/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1907/1952 variables, 199/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 21:46:54] [INFO ] Deduced a trap composed of 29 places in 247 ms of which 5 ms to minimize.
[2024-06-01 21:46:54] [INFO ] Deduced a trap composed of 32 places in 225 ms of which 4 ms to minimize.
[2024-06-01 21:46:54] [INFO ] Deduced a trap composed of 51 places in 227 ms of which 5 ms to minimize.
[2024-06-01 21:46:55] [INFO ] Deduced a trap composed of 42 places in 202 ms of which 5 ms to minimize.
[2024-06-01 21:46:55] [INFO ] Deduced a trap composed of 46 places in 202 ms of which 5 ms to minimize.
[2024-06-01 21:46:55] [INFO ] Deduced a trap composed of 45 places in 177 ms of which 4 ms to minimize.
[2024-06-01 21:46:55] [INFO ] Deduced a trap composed of 36 places in 174 ms of which 4 ms to minimize.
[2024-06-01 21:46:56] [INFO ] Deduced a trap composed of 53 places in 191 ms of which 4 ms to minimize.
[2024-06-01 21:46:56] [INFO ] Deduced a trap composed of 61 places in 184 ms of which 4 ms to minimize.
[2024-06-01 21:46:56] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 4 ms to minimize.
[2024-06-01 21:46:56] [INFO ] Deduced a trap composed of 45 places in 165 ms of which 3 ms to minimize.
[2024-06-01 21:46:56] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 4 ms to minimize.
[2024-06-01 21:46:57] [INFO ] Deduced a trap composed of 47 places in 168 ms of which 4 ms to minimize.
[2024-06-01 21:46:57] [INFO ] Deduced a trap composed of 57 places in 159 ms of which 3 ms to minimize.
[2024-06-01 21:46:57] [INFO ] Deduced a trap composed of 40 places in 150 ms of which 3 ms to minimize.
[2024-06-01 21:46:57] [INFO ] Deduced a trap composed of 68 places in 150 ms of which 4 ms to minimize.
[2024-06-01 21:46:57] [INFO ] Deduced a trap composed of 71 places in 137 ms of which 3 ms to minimize.
[2024-06-01 21:46:57] [INFO ] Deduced a trap composed of 73 places in 137 ms of which 3 ms to minimize.
[2024-06-01 21:46:58] [INFO ] Deduced a trap composed of 59 places in 150 ms of which 9 ms to minimize.
[2024-06-01 21:46:58] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1952 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1952 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3904/3904 variables, and 2173 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 1952/1952 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 20/20 constraints]
After SMT, in 5843ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1952/1952 places, 1952/1952 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1952 transition count 1405
Reduce places removed 547 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 548 rules applied. Total rules applied 1095 place count 1405 transition count 1404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1096 place count 1404 transition count 1404
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 399 Pre rules applied. Total rules applied 1096 place count 1404 transition count 1005
Deduced a syphon composed of 399 places in 1 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 3 with 798 rules applied. Total rules applied 1894 place count 1005 transition count 1005
Performed 450 Post agglomeration using F-continuation condition.Transition count delta: 450
Deduced a syphon composed of 450 places in 0 ms
Reduce places removed 450 places and 0 transitions.
Iterating global reduction 3 with 900 rules applied. Total rules applied 2794 place count 555 transition count 555
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2795 place count 555 transition count 554
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 2797 place count 554 transition count 553
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 2999 place count 453 transition count 653
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 3093 place count 406 transition count 699
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 3094 place count 406 transition count 698
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3095 place count 406 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3096 place count 405 transition count 697
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 3097 place count 405 transition count 696
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3098 place count 404 transition count 695
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3099 place count 403 transition count 695
Applied a total of 3099 rules in 261 ms. Remains 403 /1952 variables (removed 1549) and now considering 695/1952 (removed 1257) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 261 ms. Remains : 403/1952 places, 695/1952 transitions.
RANDOM walk for 40000 steps (12 resets) in 417 ms. (95 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 102147 steps, run visited all 1 properties in 766 ms. (steps per millisecond=133 )
Probabilistic random walk after 102147 steps, saw 65037 distinct states, run finished after 767 ms. (steps per millisecond=133 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 9 factoid took 203 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 1952 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1952/1952 places, 1952/1952 transitions.
Applied a total of 0 rules in 88 ms. Remains 1952 /1952 variables (removed 0) and now considering 1952/1952 (removed 0) transitions.
[2024-06-01 21:47:00] [INFO ] Invariant cache hit.
[2024-06-01 21:47:01] [INFO ] Implicit Places using invariants in 408 ms returned []
[2024-06-01 21:47:01] [INFO ] Invariant cache hit.
[2024-06-01 21:47:02] [INFO ] Implicit Places using invariants and state equation in 1569 ms returned []
Implicit Place search using SMT with State Equation took 1982 ms to find 0 implicit places.
Running 1951 sub problems to find dead transitions.
[2024-06-01 21:47:02] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1951/3904 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1952 constraints, PredecessorRefiner: 1951/1951 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1951 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1951/3904 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1952 constraints, PredecessorRefiner: 0/1951 constraints, Known Traps: 0/0 constraints]
After SMT, in 60466ms problems are : Problem set: 0 solved, 1951 unsolved
Search for dead transitions found 0 dead transitions in 60487ms
Finished structural reductions in LTL mode , in 1 iterations and 62565 ms. Remains : 1952/1952 places, 1952/1952 transitions.
Computed a total of 598 stabilizing places and 598 stable transitions
Computed a total of 598 stabilizing places and 598 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 108 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (8 resets) in 247 ms. (161 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
[2024-06-01 21:48:03] [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) 43/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1907/1952 variables, 199/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1952 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1952/3904 variables, 1952/2153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3904 variables, 0/2153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3904 variables, 0/2153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3904/3904 variables, and 2153 constraints, problems are : Problem set: 0 solved, 1 unsolved in 822 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 1952/1952 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) 43/45 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1907/1952 variables, 199/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 21:48:04] [INFO ] Deduced a trap composed of 29 places in 238 ms of which 5 ms to minimize.
[2024-06-01 21:48:05] [INFO ] Deduced a trap composed of 32 places in 229 ms of which 4 ms to minimize.
[2024-06-01 21:48:05] [INFO ] Deduced a trap composed of 51 places in 229 ms of which 5 ms to minimize.
[2024-06-01 21:48:05] [INFO ] Deduced a trap composed of 42 places in 214 ms of which 4 ms to minimize.
[2024-06-01 21:48:05] [INFO ] Deduced a trap composed of 46 places in 217 ms of which 4 ms to minimize.
[2024-06-01 21:48:06] [INFO ] Deduced a trap composed of 45 places in 196 ms of which 4 ms to minimize.
[2024-06-01 21:48:06] [INFO ] Deduced a trap composed of 36 places in 198 ms of which 4 ms to minimize.
[2024-06-01 21:48:06] [INFO ] Deduced a trap composed of 53 places in 202 ms of which 4 ms to minimize.
[2024-06-01 21:48:06] [INFO ] Deduced a trap composed of 61 places in 189 ms of which 4 ms to minimize.
[2024-06-01 21:48:07] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 4 ms to minimize.
[2024-06-01 21:48:07] [INFO ] Deduced a trap composed of 45 places in 169 ms of which 3 ms to minimize.
[2024-06-01 21:48:07] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 4 ms to minimize.
[2024-06-01 21:48:07] [INFO ] Deduced a trap composed of 47 places in 154 ms of which 4 ms to minimize.
[2024-06-01 21:48:07] [INFO ] Deduced a trap composed of 57 places in 152 ms of which 3 ms to minimize.
[2024-06-01 21:48:08] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 3 ms to minimize.
[2024-06-01 21:48:08] [INFO ] Deduced a trap composed of 68 places in 148 ms of which 3 ms to minimize.
[2024-06-01 21:48:08] [INFO ] Deduced a trap composed of 71 places in 134 ms of which 3 ms to minimize.
[2024-06-01 21:48:08] [INFO ] Deduced a trap composed of 73 places in 138 ms of which 3 ms to minimize.
[2024-06-01 21:48:08] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 3 ms to minimize.
[2024-06-01 21:48:08] [INFO ] Deduced a trap composed of 65 places in 122 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1952 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1952 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3904/3904 variables, and 2173 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 1952/1952 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 20/20 constraints]
After SMT, in 5846ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1952 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1952/1952 places, 1952/1952 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1952 transition count 1405
Reduce places removed 547 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 548 rules applied. Total rules applied 1095 place count 1405 transition count 1404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1096 place count 1404 transition count 1404
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 399 Pre rules applied. Total rules applied 1096 place count 1404 transition count 1005
Deduced a syphon composed of 399 places in 1 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 3 with 798 rules applied. Total rules applied 1894 place count 1005 transition count 1005
Performed 450 Post agglomeration using F-continuation condition.Transition count delta: 450
Deduced a syphon composed of 450 places in 0 ms
Reduce places removed 450 places and 0 transitions.
Iterating global reduction 3 with 900 rules applied. Total rules applied 2794 place count 555 transition count 555
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2795 place count 555 transition count 554
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 2797 place count 554 transition count 553
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 2999 place count 453 transition count 653
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 3093 place count 406 transition count 699
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 3094 place count 406 transition count 698
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3095 place count 406 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3096 place count 405 transition count 697
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 3097 place count 405 transition count 696
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 3098 place count 404 transition count 695
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3099 place count 403 transition count 695
Applied a total of 3099 rules in 208 ms. Remains 403 /1952 variables (removed 1549) and now considering 695/1952 (removed 1257) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 403/1952 places, 695/1952 transitions.
RANDOM walk for 32807 steps (11 resets) in 240 ms. (136 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p0), (X p1), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 9 factoid took 196 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 2 reset in 536 ms.
Product exploration explored 100000 steps with 0 reset in 679 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 1952 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1952/1952 places, 1952/1952 transitions.
Performed 546 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 546 rules applied. Total rules applied 546 place count 1952 transition count 1952
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 201 Pre rules applied. Total rules applied 546 place count 1952 transition count 2152
Deduced a syphon composed of 747 places in 3 ms
Iterating global reduction 1 with 201 rules applied. Total rules applied 747 place count 1952 transition count 2152
Performed 598 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1345 places in 2 ms
Iterating global reduction 1 with 598 rules applied. Total rules applied 1345 place count 1952 transition count 2152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1346 place count 1952 transition count 2151
Renaming transitions due to excessive name length > 1024 char.
Discarding 398 places :
Symmetric choice reduction at 2 with 398 rule applications. Total rules 1744 place count 1554 transition count 1753
Deduced a syphon composed of 947 places in 2 ms
Iterating global reduction 2 with 398 rules applied. Total rules applied 2142 place count 1554 transition count 1753
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 948 places in 4 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2143 place count 1554 transition count 1753
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2145 place count 1552 transition count 1751
Deduced a syphon composed of 946 places in 3 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2147 place count 1552 transition count 1751
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -732
Deduced a syphon composed of 1047 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2248 place count 1552 transition count 2483
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2349 place count 1451 transition count 2281
Deduced a syphon composed of 946 places in 3 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2450 place count 1451 transition count 2281
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -692
Deduced a syphon composed of 1041 places in 2 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 2545 place count 1451 transition count 2973
Discarding 95 places :
Symmetric choice reduction at 2 with 95 rule applications. Total rules 2640 place count 1356 transition count 2783
Deduced a syphon composed of 946 places in 1 ms
Iterating global reduction 2 with 95 rules applied. Total rules applied 2735 place count 1356 transition count 2783
Deduced a syphon composed of 946 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 2738 place count 1356 transition count 2780
Deduced a syphon composed of 946 places in 1 ms
Applied a total of 2738 rules in 1324 ms. Remains 1356 /1952 variables (removed 596) and now considering 2780/1952 (removed -828) transitions.
[2024-06-01 21:48:13] [INFO ] Redundant transitions in 84 ms returned []
Running 2779 sub problems to find dead transitions.
// Phase 1: matrix 2780 rows 1356 cols
[2024-06-01 21:48:13] [INFO ] Computed 201 invariants in 23 ms
[2024-06-01 21:48:13] [INFO ] State equation strengthened by 885 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1355/4136 variables, and 0 constraints, problems are : Problem set: 0 solved, 2779 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1356 constraints, ReadFeed: 0/885 constraints, PredecessorRefiner: 2779/2779 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2779 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1355/4136 variables, and 0 constraints, problems are : Problem set: 0 solved, 2779 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1356 constraints, ReadFeed: 0/885 constraints, PredecessorRefiner: 0/2779 constraints, Known Traps: 0/0 constraints]
After SMT, in 65226ms problems are : Problem set: 0 solved, 2779 unsolved
Search for dead transitions found 0 dead transitions in 65252ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1356/1952 places, 2780/1952 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66677 ms. Remains : 1356/1952 places, 2780/1952 transitions.
Support contains 4 out of 1952 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1952/1952 places, 1952/1952 transitions.
Applied a total of 0 rules in 87 ms. Remains 1952 /1952 variables (removed 0) and now considering 1952/1952 (removed 0) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2024-06-01 21:49:18] [INFO ] Computed 201 invariants in 12 ms
[2024-06-01 21:49:19] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-06-01 21:49:19] [INFO ] Invariant cache hit.
[2024-06-01 21:49:20] [INFO ] Implicit Places using invariants and state equation in 1494 ms returned []
Implicit Place search using SMT with State Equation took 1931 ms to find 0 implicit places.
Running 1951 sub problems to find dead transitions.
[2024-06-01 21:49:20] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1951/3904 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1952 constraints, PredecessorRefiner: 1951/1951 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1951 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1951/3904 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1952 constraints, PredecessorRefiner: 0/1951 constraints, Known Traps: 0/0 constraints]
After SMT, in 60463ms problems are : Problem set: 0 solved, 1951 unsolved
Search for dead transitions found 0 dead transitions in 60480ms
Finished structural reductions in LTL mode , in 1 iterations and 62502 ms. Remains : 1952/1952 places, 1952/1952 transitions.
Treatment of property ShieldRVt-PT-050B-LTLCardinality-01 finished in 272661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1963 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 555 transitions
Trivial Post-agglo rules discarded 555 transitions
Performed 555 trivial Post agglomeration. Transition count delta: 555
Iterating post reduction 0 with 555 rules applied. Total rules applied 555 place count 1962 transition count 1407
Reduce places removed 555 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 556 rules applied. Total rules applied 1111 place count 1407 transition count 1406
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1112 place count 1406 transition count 1406
Performed 389 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 389 Pre rules applied. Total rules applied 1112 place count 1406 transition count 1017
Deduced a syphon composed of 389 places in 1 ms
Reduce places removed 389 places and 0 transitions.
Iterating global reduction 3 with 778 rules applied. Total rules applied 1890 place count 1017 transition count 1017
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1897 place count 1010 transition count 1010
Iterating global reduction 3 with 7 rules applied. Total rules applied 1904 place count 1010 transition count 1010
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1904 place count 1010 transition count 1003
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1918 place count 1003 transition count 1003
Performed 447 Post agglomeration using F-continuation condition.Transition count delta: 447
Deduced a syphon composed of 447 places in 1 ms
Reduce places removed 447 places and 0 transitions.
Iterating global reduction 3 with 894 rules applied. Total rules applied 2812 place count 556 transition count 556
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2813 place count 556 transition count 555
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 2815 place count 555 transition count 554
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 3017 place count 454 transition count 654
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 3113 place count 406 transition count 702
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3115 place count 404 transition count 700
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3116 place count 403 transition count 700
Applied a total of 3116 rules in 247 ms. Remains 403 /1963 variables (removed 1560) and now considering 700/1963 (removed 1263) transitions.
// Phase 1: matrix 700 rows 403 cols
[2024-06-01 21:50:21] [INFO ] Computed 200 invariants in 7 ms
[2024-06-01 21:50:21] [INFO ] Implicit Places using invariants in 234 ms returned []
[2024-06-01 21:50:21] [INFO ] Invariant cache hit.
[2024-06-01 21:50:22] [INFO ] State equation strengthened by 170 read => feed constraints.
[2024-06-01 21:50:22] [INFO ] Implicit Places using invariants and state equation in 953 ms returned []
Implicit Place search using SMT with State Equation took 1189 ms to find 0 implicit places.
[2024-06-01 21:50:22] [INFO ] Redundant transitions in 28 ms returned []
Running 695 sub problems to find dead transitions.
[2024-06-01 21:50:22] [INFO ] Invariant cache hit.
[2024-06-01 21:50:22] [INFO ] State equation strengthened by 170 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (OVERLAPS) 1/403 variables, 69/200 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 4 (OVERLAPS) 699/1102 variables, 403/603 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1102 variables, 170/773 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1102 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 695 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1102/1103 variables, and 773 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 403/403 constraints, ReadFeed: 170/170 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 695 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (OVERLAPS) 1/403 variables, 69/200 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 4 (OVERLAPS) 699/1102 variables, 403/603 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1102 variables, 170/773 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1102 variables, 695/1468 constraints. Problems are: Problem set: 0 solved, 695 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1102/1103 variables, and 1468 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 403/403 constraints, ReadFeed: 170/170 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 0/0 constraints]
After SMT, in 60278ms problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 60286ms
Starting structural reductions in SI_LTL mode, iteration 1 : 403/1963 places, 700/1963 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61763 ms. Remains : 403/1963 places, 700/1963 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-02
Stuttering criterion allowed to conclude after 750 steps with 1 reset in 8 ms.
FORMULA ShieldRVt-PT-050B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLCardinality-02 finished in 61828 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 (p1&&X(!p1))))'
Support contains 3 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1952 transition count 1952
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1952 transition count 1952
Applied a total of 22 rules in 152 ms. Remains 1952 /1963 variables (removed 11) and now considering 1952/1963 (removed 11) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2024-06-01 21:51:23] [INFO ] Computed 201 invariants in 8 ms
[2024-06-01 21:51:23] [INFO ] Implicit Places using invariants in 530 ms returned []
[2024-06-01 21:51:23] [INFO ] Invariant cache hit.
[2024-06-01 21:51:25] [INFO ] Implicit Places using invariants and state equation in 1398 ms returned []
Implicit Place search using SMT with State Equation took 1938 ms to find 0 implicit places.
Running 1951 sub problems to find dead transitions.
[2024-06-01 21:51:25] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1951/3904 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1952 constraints, PredecessorRefiner: 1951/1951 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1951 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1951/3904 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1952 constraints, PredecessorRefiner: 0/1951 constraints, Known Traps: 0/0 constraints]
After SMT, in 60459ms problems are : Problem set: 0 solved, 1951 unsolved
Search for dead transitions found 0 dead transitions in 60473ms
Starting structural reductions in LTL mode, iteration 1 : 1952/1963 places, 1952/1963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62568 ms. Remains : 1952/1963 places, 1952/1963 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, p0, p1, true]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-050B-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLCardinality-06 finished in 62716 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1952 transition count 1952
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1952 transition count 1952
Applied a total of 22 rules in 166 ms. Remains 1952 /1963 variables (removed 11) and now considering 1952/1963 (removed 11) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2024-06-01 21:52:26] [INFO ] Computed 201 invariants in 5 ms
[2024-06-01 21:52:26] [INFO ] Implicit Places using invariants in 586 ms returned []
[2024-06-01 21:52:26] [INFO ] Invariant cache hit.
[2024-06-01 21:52:27] [INFO ] Implicit Places using invariants and state equation in 1299 ms returned []
Implicit Place search using SMT with State Equation took 1907 ms to find 0 implicit places.
Running 1951 sub problems to find dead transitions.
[2024-06-01 21:52:27] [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 1951/3904 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1952 constraints, PredecessorRefiner: 1951/1951 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1951 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1951/3904 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1952 constraints, PredecessorRefiner: 0/1951 constraints, Known Traps: 0/0 constraints]
After SMT, in 60457ms problems are : Problem set: 0 solved, 1951 unsolved
Search for dead transitions found 0 dead transitions in 60472ms
Starting structural reductions in LTL mode, iteration 1 : 1952/1963 places, 1952/1963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62550 ms. Remains : 1952/1963 places, 1952/1963 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-050B-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLCardinality-07 finished in 62659 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1963 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 555 transitions
Trivial Post-agglo rules discarded 555 transitions
Performed 555 trivial Post agglomeration. Transition count delta: 555
Iterating post reduction 0 with 555 rules applied. Total rules applied 555 place count 1962 transition count 1407
Reduce places removed 555 places and 0 transitions.
Iterating post reduction 1 with 555 rules applied. Total rules applied 1110 place count 1407 transition count 1407
Performed 390 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 390 Pre rules applied. Total rules applied 1110 place count 1407 transition count 1017
Deduced a syphon composed of 390 places in 1 ms
Reduce places removed 390 places and 0 transitions.
Iterating global reduction 2 with 780 rules applied. Total rules applied 1890 place count 1017 transition count 1017
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1897 place count 1010 transition count 1010
Iterating global reduction 2 with 7 rules applied. Total rules applied 1904 place count 1010 transition count 1010
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1904 place count 1010 transition count 1004
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1916 place count 1004 transition count 1004
Performed 448 Post agglomeration using F-continuation condition.Transition count delta: 448
Deduced a syphon composed of 448 places in 1 ms
Reduce places removed 448 places and 0 transitions.
Iterating global reduction 2 with 896 rules applied. Total rules applied 2812 place count 556 transition count 556
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2813 place count 556 transition count 555
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 3 with 2 rules applied. Total rules applied 2815 place count 555 transition count 554
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -99
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 3017 place count 454 transition count 653
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3113 place count 406 transition count 701
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 3114 place count 406 transition count 701
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3116 place count 404 transition count 699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3117 place count 403 transition count 699
Applied a total of 3117 rules in 256 ms. Remains 403 /1963 variables (removed 1560) and now considering 699/1963 (removed 1264) transitions.
// Phase 1: matrix 699 rows 403 cols
[2024-06-01 21:53:28] [INFO ] Computed 200 invariants in 4 ms
[2024-06-01 21:53:29] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-06-01 21:53:29] [INFO ] Invariant cache hit.
[2024-06-01 21:53:29] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 822 ms to find 0 implicit places.
[2024-06-01 21:53:29] [INFO ] Redundant transitions in 6 ms returned []
Running 695 sub problems to find dead transitions.
[2024-06-01 21:53:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (OVERLAPS) 698/1101 variables, 403/603 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1101 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 4 (OVERLAPS) 0/1101 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 695 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1101/1102 variables, and 603 constraints, problems are : Problem set: 0 solved, 695 unsolved in 26101 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 695 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (OVERLAPS) 698/1101 variables, 403/603 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1101 variables, 695/1298 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1101 variables, 0/1298 constraints. Problems are: Problem set: 0 solved, 695 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1101/1102 variables, and 1298 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 0/0 constraints]
After SMT, in 56300ms problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 56306ms
Starting structural reductions in SI_LTL mode, iteration 1 : 403/1963 places, 699/1963 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57400 ms. Remains : 403/1963 places, 699/1963 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-08
Product exploration explored 100000 steps with 21 reset in 536 ms.
Product exploration explored 100000 steps with 15 reset in 610 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 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (16 resets) in 512 ms. (77 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 233 ms. (170 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 27612 steps, run visited all 1 properties in 256 ms. (steps per millisecond=107 )
Probabilistic random walk after 27612 steps, saw 16816 distinct states, run finished after 256 ms. (steps per millisecond=107 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 699/699 transitions.
Applied a total of 0 rules in 8 ms. Remains 403 /403 variables (removed 0) and now considering 699/699 (removed 0) transitions.
[2024-06-01 21:54:28] [INFO ] Invariant cache hit.
[2024-06-01 21:54:28] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-06-01 21:54:28] [INFO ] Invariant cache hit.
[2024-06-01 21:54:28] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 676 ms to find 0 implicit places.
[2024-06-01 21:54:28] [INFO ] Redundant transitions in 5 ms returned []
Running 695 sub problems to find dead transitions.
[2024-06-01 21:54:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (OVERLAPS) 698/1101 variables, 403/603 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1101 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 4 (OVERLAPS) 0/1101 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 695 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1101/1102 variables, and 603 constraints, problems are : Problem set: 0 solved, 695 unsolved in 26314 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 695 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (OVERLAPS) 698/1101 variables, 403/603 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1101 variables, 695/1298 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1101 variables, 0/1298 constraints. Problems are: Problem set: 0 solved, 695 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1101/1102 variables, and 1298 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 0/0 constraints]
After SMT, in 56503ms problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 56508ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57208 ms. Remains : 403/403 places, 699/699 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 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (13 resets) in 364 ms. (109 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 27612 steps, run visited all 1 properties in 238 ms. (steps per millisecond=116 )
Probabilistic random walk after 27612 steps, saw 16816 distinct states, run finished after 238 ms. (steps per millisecond=116 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20 reset in 504 ms.
Product exploration explored 100000 steps with 30 reset in 593 ms.
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 699/699 transitions.
Applied a total of 0 rules in 8 ms. Remains 403 /403 variables (removed 0) and now considering 699/699 (removed 0) transitions.
[2024-06-01 21:55:27] [INFO ] Invariant cache hit.
[2024-06-01 21:55:27] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-06-01 21:55:27] [INFO ] Invariant cache hit.
[2024-06-01 21:55:28] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
[2024-06-01 21:55:28] [INFO ] Redundant transitions in 5 ms returned []
Running 695 sub problems to find dead transitions.
[2024-06-01 21:55:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (OVERLAPS) 698/1101 variables, 403/603 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1101 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 4 (OVERLAPS) 0/1101 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 695 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1101/1102 variables, and 603 constraints, problems are : Problem set: 0 solved, 695 unsolved in 26156 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 695 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (OVERLAPS) 698/1101 variables, 403/603 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1101 variables, 695/1298 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1101 variables, 0/1298 constraints. Problems are: Problem set: 0 solved, 695 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1101/1102 variables, and 1298 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 403/403 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 0/0 constraints]
After SMT, in 56360ms problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 56366ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57082 ms. Remains : 403/403 places, 699/699 transitions.
Treatment of property ShieldRVt-PT-050B-LTLCardinality-08 finished in 176106 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&&G((p0 U p1))))))'
Support contains 4 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1954 transition count 1954
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1954 transition count 1954
Applied a total of 18 rules in 152 ms. Remains 1954 /1963 variables (removed 9) and now considering 1954/1963 (removed 9) transitions.
// Phase 1: matrix 1954 rows 1954 cols
[2024-06-01 21:56:24] [INFO ] Computed 201 invariants in 13 ms
[2024-06-01 21:56:25] [INFO ] Implicit Places using invariants in 456 ms returned []
[2024-06-01 21:56:25] [INFO ] Invariant cache hit.
[2024-06-01 21:56:26] [INFO ] Implicit Places using invariants and state equation in 1495 ms returned []
Implicit Place search using SMT with State Equation took 1957 ms to find 0 implicit places.
Running 1953 sub problems to find dead transitions.
[2024-06-01 21:56:26] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1953/3908 variables, and 0 constraints, problems are : Problem set: 0 solved, 1953 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1954 constraints, PredecessorRefiner: 1953/1953 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1953 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1953/3908 variables, and 0 constraints, problems are : Problem set: 0 solved, 1953 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1954 constraints, PredecessorRefiner: 0/1953 constraints, Known Traps: 0/0 constraints]
After SMT, in 60430ms problems are : Problem set: 0 solved, 1953 unsolved
Search for dead transitions found 0 dead transitions in 60444ms
Starting structural reductions in LTL mode, iteration 1 : 1954/1963 places, 1954/1963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62558 ms. Remains : 1954/1963 places, 1954/1963 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-10
Product exploration explored 100000 steps with 3 reset in 510 ms.
Product exploration explored 100000 steps with 5 reset in 621 ms.
Computed a total of 600 stabilizing places and 600 stable transitions
Computed a total of 600 stabilizing places and 600 stable transitions
Detected a total of 600/1954 stabilizing places and 600/1954 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 119 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (8 resets) in 334 ms. (119 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
[2024-06-01 21:57:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1852/1954 variables, 197/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1954 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1954/3908 variables, 1954/2155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3908 variables, 0/2155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3908 variables, 0/2155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3908/3908 variables, and 2155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 753 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 1954/1954 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1852/1954 variables, 197/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 21:57:30] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 4 ms to minimize.
[2024-06-01 21:57:30] [INFO ] Deduced a trap composed of 56 places in 174 ms of which 4 ms to minimize.
[2024-06-01 21:57:30] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 4 ms to minimize.
[2024-06-01 21:57:30] [INFO ] Deduced a trap composed of 32 places in 170 ms of which 4 ms to minimize.
[2024-06-01 21:57:31] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 3 ms to minimize.
[2024-06-01 21:57:31] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 3 ms to minimize.
[2024-06-01 21:57:31] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 4 ms to minimize.
[2024-06-01 21:57:31] [INFO ] Deduced a trap composed of 60 places in 142 ms of which 3 ms to minimize.
[2024-06-01 21:57:31] [INFO ] Deduced a trap composed of 51 places in 136 ms of which 4 ms to minimize.
[2024-06-01 21:57:31] [INFO ] Deduced a trap composed of 50 places in 131 ms of which 3 ms to minimize.
[2024-06-01 21:57:32] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 3 ms to minimize.
[2024-06-01 21:57:32] [INFO ] Deduced a trap composed of 65 places in 119 ms of which 2 ms to minimize.
[2024-06-01 21:57:32] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 3 ms to minimize.
[2024-06-01 21:57:32] [INFO ] Deduced a trap composed of 53 places in 120 ms of which 3 ms to minimize.
[2024-06-01 21:57:32] [INFO ] Deduced a trap composed of 63 places in 111 ms of which 3 ms to minimize.
[2024-06-01 21:57:32] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 3 ms to minimize.
[2024-06-01 21:57:32] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 3 ms to minimize.
[2024-06-01 21:57:33] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 2 ms to minimize.
[2024-06-01 21:57:33] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 2 ms to minimize.
[2024-06-01 21:57:33] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1954 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1954 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1954/3908 variables, 1954/2175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3908 variables, 1/2176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 21:57:34] [INFO ] Deduced a trap composed of 38 places in 292 ms of which 6 ms to minimize.
[2024-06-01 21:57:34] [INFO ] Deduced a trap composed of 31 places in 276 ms of which 6 ms to minimize.
[2024-06-01 21:57:34] [INFO ] Deduced a trap composed of 32 places in 259 ms of which 5 ms to minimize.
SMT process timed out in 5831ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1954/1954 places, 1954/1954 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 546 transitions
Trivial Post-agglo rules discarded 546 transitions
Performed 546 trivial Post agglomeration. Transition count delta: 546
Iterating post reduction 0 with 546 rules applied. Total rules applied 546 place count 1954 transition count 1408
Reduce places removed 546 places and 0 transitions.
Iterating post reduction 1 with 546 rules applied. Total rules applied 1092 place count 1408 transition count 1408
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 1092 place count 1408 transition count 1009
Deduced a syphon composed of 399 places in 1 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 1890 place count 1009 transition count 1009
Performed 451 Post agglomeration using F-continuation condition.Transition count delta: 451
Deduced a syphon composed of 451 places in 0 ms
Reduce places removed 451 places and 0 transitions.
Iterating global reduction 2 with 902 rules applied. Total rules applied 2792 place count 558 transition count 558
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2793 place count 558 transition count 557
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 2795 place count 557 transition count 556
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 2997 place count 456 transition count 656
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 3089 place count 410 transition count 700
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3090 place count 410 transition count 699
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3091 place count 410 transition count 698
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3092 place count 409 transition count 698
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 3093 place count 409 transition count 697
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3094 place count 408 transition count 696
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3095 place count 407 transition count 696
Applied a total of 3095 rules in 189 ms. Remains 407 /1954 variables (removed 1547) and now considering 696/1954 (removed 1258) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 189 ms. Remains : 407/1954 places, 696/1954 transitions.
RANDOM walk for 40000 steps (13 resets) in 263 ms. (151 steps per ms) remains 1/1 properties
BEST_FIRST walk for 39660 steps (8 resets) in 141 ms. (279 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 300 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 out of 1954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1954/1954 places, 1954/1954 transitions.
Applied a total of 0 rules in 75 ms. Remains 1954 /1954 variables (removed 0) and now considering 1954/1954 (removed 0) transitions.
[2024-06-01 21:57:35] [INFO ] Invariant cache hit.
[2024-06-01 21:57:36] [INFO ] Implicit Places using invariants in 459 ms returned []
[2024-06-01 21:57:36] [INFO ] Invariant cache hit.
[2024-06-01 21:57:37] [INFO ] Implicit Places using invariants and state equation in 1521 ms returned []
Implicit Place search using SMT with State Equation took 1984 ms to find 0 implicit places.
Running 1953 sub problems to find dead transitions.
[2024-06-01 21:57:37] [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 1953/3908 variables, and 0 constraints, problems are : Problem set: 0 solved, 1953 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1954 constraints, PredecessorRefiner: 1953/1953 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1953 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1953/3908 variables, and 0 constraints, problems are : Problem set: 0 solved, 1953 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1954 constraints, PredecessorRefiner: 0/1953 constraints, Known Traps: 0/0 constraints]
After SMT, in 60419ms problems are : Problem set: 0 solved, 1953 unsolved
Search for dead transitions found 0 dead transitions in 60434ms
Finished structural reductions in LTL mode , in 1 iterations and 62497 ms. Remains : 1954/1954 places, 1954/1954 transitions.
Computed a total of 600 stabilizing places and 600 stable transitions
Computed a total of 600 stabilizing places and 600 stable transitions
Detected a total of 600/1954 stabilizing places and 600/1954 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 129 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (8 resets) in 970 ms. (41 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
[2024-06-01 21:58:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1852/1954 variables, 197/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1954 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1954/3908 variables, 1954/2155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3908 variables, 0/2155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3908 variables, 0/2155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3908/3908 variables, and 2155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 776 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 1954/1954 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/102 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1852/1954 variables, 197/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 21:58:40] [INFO ] Deduced a trap composed of 47 places in 165 ms of which 3 ms to minimize.
[2024-06-01 21:58:40] [INFO ] Deduced a trap composed of 56 places in 159 ms of which 4 ms to minimize.
[2024-06-01 21:58:40] [INFO ] Deduced a trap composed of 49 places in 170 ms of which 3 ms to minimize.
[2024-06-01 21:58:40] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 4 ms to minimize.
[2024-06-01 21:58:41] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 3 ms to minimize.
[2024-06-01 21:58:41] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 4 ms to minimize.
[2024-06-01 21:58:41] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 3 ms to minimize.
[2024-06-01 21:58:41] [INFO ] Deduced a trap composed of 60 places in 141 ms of which 3 ms to minimize.
[2024-06-01 21:58:41] [INFO ] Deduced a trap composed of 51 places in 146 ms of which 3 ms to minimize.
[2024-06-01 21:58:42] [INFO ] Deduced a trap composed of 50 places in 141 ms of which 3 ms to minimize.
[2024-06-01 21:58:42] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 3 ms to minimize.
[2024-06-01 21:58:42] [INFO ] Deduced a trap composed of 65 places in 126 ms of which 3 ms to minimize.
[2024-06-01 21:58:42] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 3 ms to minimize.
[2024-06-01 21:58:42] [INFO ] Deduced a trap composed of 53 places in 116 ms of which 2 ms to minimize.
[2024-06-01 21:58:42] [INFO ] Deduced a trap composed of 63 places in 120 ms of which 3 ms to minimize.
[2024-06-01 21:58:42] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 3 ms to minimize.
[2024-06-01 21:58:43] [INFO ] Deduced a trap composed of 59 places in 112 ms of which 3 ms to minimize.
[2024-06-01 21:58:43] [INFO ] Deduced a trap composed of 66 places in 112 ms of which 2 ms to minimize.
[2024-06-01 21:58:43] [INFO ] Deduced a trap composed of 61 places in 100 ms of which 3 ms to minimize.
[2024-06-01 21:58:43] [INFO ] Deduced a trap composed of 68 places in 107 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1954 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1954 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1954/3908 variables, 1954/2175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3908 variables, 1/2176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 21:58:44] [INFO ] Deduced a trap composed of 38 places in 294 ms of which 6 ms to minimize.
[2024-06-01 21:58:44] [INFO ] Deduced a trap composed of 31 places in 289 ms of which 6 ms to minimize.
[2024-06-01 21:58:44] [INFO ] Deduced a trap composed of 32 places in 275 ms of which 5 ms to minimize.
SMT process timed out in 5882ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 1954 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1954/1954 places, 1954/1954 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 546 transitions
Trivial Post-agglo rules discarded 546 transitions
Performed 546 trivial Post agglomeration. Transition count delta: 546
Iterating post reduction 0 with 546 rules applied. Total rules applied 546 place count 1954 transition count 1408
Reduce places removed 546 places and 0 transitions.
Iterating post reduction 1 with 546 rules applied. Total rules applied 1092 place count 1408 transition count 1408
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 399 Pre rules applied. Total rules applied 1092 place count 1408 transition count 1009
Deduced a syphon composed of 399 places in 1 ms
Reduce places removed 399 places and 0 transitions.
Iterating global reduction 2 with 798 rules applied. Total rules applied 1890 place count 1009 transition count 1009
Performed 451 Post agglomeration using F-continuation condition.Transition count delta: 451
Deduced a syphon composed of 451 places in 1 ms
Reduce places removed 451 places and 0 transitions.
Iterating global reduction 2 with 902 rules applied. Total rules applied 2792 place count 558 transition count 558
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2793 place count 558 transition count 557
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 2795 place count 557 transition count 556
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 2997 place count 456 transition count 656
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 3089 place count 410 transition count 700
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3090 place count 410 transition count 699
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 3091 place count 410 transition count 698
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3092 place count 409 transition count 698
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 3093 place count 409 transition count 697
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3094 place count 408 transition count 696
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3095 place count 407 transition count 696
Applied a total of 3095 rules in 208 ms. Remains 407 /1954 variables (removed 1547) and now considering 696/1954 (removed 1258) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 407/1954 places, 696/1954 transitions.
RANDOM walk for 40000 steps (14 resets) in 285 ms. (139 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 410951 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :0 out of 1
Probabilistic random walk after 410951 steps, saw 266308 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
// Phase 1: matrix 696 rows 407 cols
[2024-06-01 21:58:48] [INFO ] Computed 200 invariants in 3 ms
[2024-06-01 21:58:48] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/55 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 148/203 variables, 48/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 24/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 8/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 196/399 variables, 72/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 36/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 169/568 variables, 64/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/568 variables, 32/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/568 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 124/692 variables, 50/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/692 variables, 25/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/692 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 76/768 variables, 30/408 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/768 variables, 15/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/768 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 66/834 variables, 24/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/834 variables, 12/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/834 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 66/900 variables, 24/483 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/900 variables, 12/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/900 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 66/966 variables, 24/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/966 variables, 12/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/966 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 64/1030 variables, 24/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1030 variables, 12/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1030 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 56/1086 variables, 22/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1086 variables, 11/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1086 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 17/1103 variables, 10/610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1103 variables, 5/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1103 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 0/1103 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1103/1103 variables, and 615 constraints, problems are : Problem set: 0 solved, 1 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 407/407 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/15 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/55 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 148/203 variables, 48/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 24/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 8/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 196/399 variables, 72/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 36/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 169/568 variables, 64/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/568 variables, 32/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/568 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 124/692 variables, 50/354 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/692 variables, 25/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/692 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 76/768 variables, 30/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/768 variables, 15/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/768 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 66/834 variables, 24/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/834 variables, 12/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/834 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 66/900 variables, 24/484 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/900 variables, 12/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/900 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 66/966 variables, 24/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/966 variables, 12/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/966 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 64/1030 variables, 24/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1030 variables, 12/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1030 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 56/1086 variables, 22/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1086 variables, 11/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1086 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 17/1103 variables, 10/611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1103 variables, 5/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1103 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 0/1103 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1103/1103 variables, and 616 constraints, problems are : Problem set: 0 solved, 1 unsolved in 366 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 407/407 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 693ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 4 out of 407 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 407/407 places, 696/696 transitions.
Applied a total of 0 rules in 8 ms. Remains 407 /407 variables (removed 0) and now considering 696/696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 407/407 places, 696/696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 407/407 places, 696/696 transitions.
Applied a total of 0 rules in 8 ms. Remains 407 /407 variables (removed 0) and now considering 696/696 (removed 0) transitions.
[2024-06-01 21:58:49] [INFO ] Invariant cache hit.
[2024-06-01 21:58:49] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-06-01 21:58:49] [INFO ] Invariant cache hit.
[2024-06-01 21:58:49] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 21:58:49] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
[2024-06-01 21:58:49] [INFO ] Redundant transitions in 5 ms returned []
Running 691 sub problems to find dead transitions.
[2024-06-01 21:58:49] [INFO ] Invariant cache hit.
[2024-06-01 21:58:49] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 198/198 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 2 (OVERLAPS) 2/407 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 4 (OVERLAPS) 696/1103 variables, 407/607 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1103 variables, 8/615 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1103 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 691 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1103/1103 variables, and 615 constraints, problems are : Problem set: 0 solved, 691 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 407/407 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 691/691 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 691 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/405 variables, 198/198 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/405 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 2 (OVERLAPS) 2/407 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 4 (OVERLAPS) 696/1103 variables, 407/607 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1103 variables, 8/615 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1103 variables, 691/1306 constraints. Problems are: Problem set: 0 solved, 691 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1103 variables, 0/1306 constraints. Problems are: Problem set: 0 solved, 691 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1103/1103 variables, and 1306 constraints, problems are : Problem set: 0 solved, 691 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 407/407 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 691/691 constraints, Known Traps: 0/0 constraints]
After SMT, in 60223ms problems are : Problem set: 0 solved, 691 unsolved
Search for dead transitions found 0 dead transitions in 60229ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60901 ms. Remains : 407/407 places, 696/696 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 197 edges and 407 vertex of which 4 / 407 are part of one of the 2 SCC in 9 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 1388 edges and 405 vertex of which 403 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 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 194 edges and 401 vertex of which 4 / 401 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 399 transition count 687
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 193 edges and 397 vertex of which 6 / 397 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 394 transition count 678
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 191 edges and 391 vertex of which 8 / 391 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 387 transition count 667
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 187 edges and 383 vertex of which 8 / 383 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 379 transition count 653
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 183 edges and 375 vertex of which 8 / 375 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 371 transition count 639
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 179 edges and 367 vertex of which 8 / 367 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 363 transition count 625
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 175 edges and 359 vertex of which 8 / 359 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 355 transition count 611
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 171 edges and 351 vertex of which 8 / 351 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 347 transition count 597
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 167 edges and 343 vertex of which 8 / 343 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 339 transition count 583
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 164 edges and 335 vertex of which 8 / 335 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 18 rules applied. Total rules applied 167 place count 331 transition count 570
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 160 edges and 327 vertex of which 6 / 327 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 10 with 17 rules applied. Total rules applied 184 place count 324 transition count 558
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 157 edges and 321 vertex of which 6 / 321 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 11 with 16 rules applied. Total rules applied 200 place count 318 transition count 546
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 155 edges and 315 vertex of which 6 / 315 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 12 with 15 rules applied. Total rules applied 215 place count 312 transition count 535
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 309 vertex of which 8 / 309 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 15 rules applied. Total rules applied 230 place count 305 transition count 524
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 149 edges and 301 vertex of which 8 / 301 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 20 rules applied. Total rules applied 250 place count 297 transition count 509
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 293 vertex of which 8 / 293 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 269 place count 289 transition count 495
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 285 vertex of which 6 / 285 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 16 with 19 rules applied. Total rules applied 288 place count 282 transition count 481
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 137 edges and 279 vertex of which 4 / 279 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 17 with 14 rules applied. Total rules applied 302 place count 277 transition count 471
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 134 edges and 275 vertex of which 2 / 275 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 18 with 9 rules applied. Total rules applied 311 place count 274 transition count 465
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 19 with 5 rules applied. Total rules applied 316 place count 273 transition count 461
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 20 with 3 Pre rules applied. Total rules applied 316 place count 273 transition count 458
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 20 with 9 rules applied. Total rules applied 325 place count 267 transition count 458
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 131 edges and 267 vertex of which 4 / 267 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 20 with 2 rules applied. Total rules applied 327 place count 265 transition count 457
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 21 with 4 rules applied. Total rules applied 331 place count 265 transition count 453
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 22 with 3 rules applied. Total rules applied 334 place count 263 transition count 452
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 22 with 3 rules applied. Total rules applied 337 place count 263 transition count 449
Applied a total of 337 rules in 200 ms. Remains 263 /407 variables (removed 144) and now considering 449/696 (removed 247) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 449 rows 263 cols
[2024-06-01 21:59:50] [INFO ] Computed 129 invariants in 1 ms
[2024-06-01 21:59:50] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 21:59:50] [INFO ] [Nat]Absence check using 129 positive place invariants in 23 ms returned sat
[2024-06-01 21:59:50] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 21:59:50] [INFO ] After 195ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 21:59:50] [INFO ] After 308ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 609 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 311 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 342 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 4 reset in 472 ms.
Product exploration explored 100000 steps with 6 reset in 585 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 out of 1954 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1954/1954 places, 1954/1954 transitions.
Performed 546 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 546 rules applied. Total rules applied 546 place count 1954 transition count 1954
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 202 Pre rules applied. Total rules applied 546 place count 1954 transition count 2154
Deduced a syphon composed of 748 places in 6 ms
Iterating global reduction 1 with 202 rules applied. Total rules applied 748 place count 1954 transition count 2154
Performed 598 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1346 places in 2 ms
Iterating global reduction 1 with 598 rules applied. Total rules applied 1346 place count 1954 transition count 2154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1347 place count 1954 transition count 2153
Renaming transitions due to excessive name length > 1024 char.
Discarding 396 places :
Symmetric choice reduction at 2 with 396 rule applications. Total rules 1743 place count 1558 transition count 1757
Deduced a syphon composed of 950 places in 2 ms
Iterating global reduction 2 with 396 rules applied. Total rules applied 2139 place count 1558 transition count 1757
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 951 places in 2 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 2140 place count 1558 transition count 1757
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2142 place count 1556 transition count 1755
Deduced a syphon composed of 949 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2144 place count 1556 transition count 1755
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -732
Deduced a syphon composed of 1050 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2245 place count 1556 transition count 2487
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 2346 place count 1455 transition count 2285
Deduced a syphon composed of 949 places in 2 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2447 place count 1455 transition count 2285
Performed 96 Post agglomeration using F-continuation condition.Transition count delta: -683
Deduced a syphon composed of 1045 places in 1 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 2543 place count 1455 transition count 2968
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 2639 place count 1359 transition count 2776
Deduced a syphon composed of 949 places in 1 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 2735 place count 1359 transition count 2776
Deduced a syphon composed of 949 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 2738 place count 1359 transition count 2773
Deduced a syphon composed of 949 places in 1 ms
Applied a total of 2738 rules in 974 ms. Remains 1359 /1954 variables (removed 595) and now considering 2773/1954 (removed -819) transitions.
[2024-06-01 21:59:53] [INFO ] Redundant transitions in 74 ms returned []
Running 2772 sub problems to find dead transitions.
// Phase 1: matrix 2773 rows 1359 cols
[2024-06-01 21:59:53] [INFO ] Computed 201 invariants in 18 ms
[2024-06-01 21:59:54] [INFO ] State equation strengthened by 879 read => feed constraints.
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 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 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 1358/4132 variables, and 0 constraints, problems are : Problem set: 0 solved, 2772 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1359 constraints, ReadFeed: 0/879 constraints, PredecessorRefiner: 2772/2772 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2772 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 1358/4132 variables, and 0 constraints, problems are : Problem set: 0 solved, 2772 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1359 constraints, ReadFeed: 0/879 constraints, PredecessorRefiner: 0/2772 constraints, Known Traps: 0/0 constraints]
After SMT, in 63800ms problems are : Problem set: 0 solved, 2772 unsolved
Search for dead transitions found 0 dead transitions in 63820ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1359/1954 places, 2773/1954 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64901 ms. Remains : 1359/1954 places, 2773/1954 transitions.
Support contains 4 out of 1954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1954/1954 places, 1954/1954 transitions.
Applied a total of 0 rules in 74 ms. Remains 1954 /1954 variables (removed 0) and now considering 1954/1954 (removed 0) transitions.
// Phase 1: matrix 1954 rows 1954 cols
[2024-06-01 22:00:57] [INFO ] Computed 201 invariants in 11 ms
[2024-06-01 22:00:58] [INFO ] Implicit Places using invariants in 427 ms returned []
[2024-06-01 22:00:58] [INFO ] Invariant cache hit.
[2024-06-01 22:00:59] [INFO ] Implicit Places using invariants and state equation in 1400 ms returned []
Implicit Place search using SMT with State Equation took 1869 ms to find 0 implicit places.
Running 1953 sub problems to find dead transitions.
[2024-06-01 22:00:59] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1953/3908 variables, and 0 constraints, problems are : Problem set: 0 solved, 1953 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1954 constraints, PredecessorRefiner: 1953/1953 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1953 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 1953/3908 variables, and 0 constraints, problems are : Problem set: 0 solved, 1953 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1954 constraints, PredecessorRefiner: 0/1953 constraints, Known Traps: 0/0 constraints]
After SMT, in 60425ms problems are : Problem set: 0 solved, 1953 unsolved
Search for dead transitions found 0 dead transitions in 60439ms
Finished structural reductions in LTL mode , in 1 iterations and 62386 ms. Remains : 1954/1954 places, 1954/1954 transitions.
Treatment of property ShieldRVt-PT-050B-LTLCardinality-10 finished in 335550 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1963 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 556 transitions
Trivial Post-agglo rules discarded 556 transitions
Performed 556 trivial Post agglomeration. Transition count delta: 556
Iterating post reduction 0 with 556 rules applied. Total rules applied 556 place count 1962 transition count 1406
Reduce places removed 556 places and 0 transitions.
Iterating post reduction 1 with 556 rules applied. Total rules applied 1112 place count 1406 transition count 1406
Performed 389 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 389 Pre rules applied. Total rules applied 1112 place count 1406 transition count 1017
Deduced a syphon composed of 389 places in 1 ms
Reduce places removed 389 places and 0 transitions.
Iterating global reduction 2 with 778 rules applied. Total rules applied 1890 place count 1017 transition count 1017
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1897 place count 1010 transition count 1010
Iterating global reduction 2 with 7 rules applied. Total rules applied 1904 place count 1010 transition count 1010
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1904 place count 1010 transition count 1004
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1916 place count 1004 transition count 1004
Performed 449 Post agglomeration using F-continuation condition.Transition count delta: 449
Deduced a syphon composed of 449 places in 0 ms
Reduce places removed 449 places and 0 transitions.
Iterating global reduction 2 with 898 rules applied. Total rules applied 2814 place count 555 transition count 555
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2815 place count 555 transition count 554
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 2817 place count 554 transition count 553
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 3019 place count 453 transition count 653
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 3115 place count 405 transition count 701
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3117 place count 403 transition count 699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3118 place count 402 transition count 699
Applied a total of 3118 rules in 432 ms. Remains 402 /1963 variables (removed 1561) and now considering 699/1963 (removed 1264) transitions.
// Phase 1: matrix 699 rows 402 cols
[2024-06-01 22:02:00] [INFO ] Computed 200 invariants in 1 ms
[2024-06-01 22:02:01] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-06-01 22:02:01] [INFO ] Invariant cache hit.
[2024-06-01 22:02:01] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 861 ms to find 0 implicit places.
[2024-06-01 22:02:01] [INFO ] Redundant transitions in 5 ms returned []
Running 694 sub problems to find dead transitions.
[2024-06-01 22:02:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 2 (OVERLAPS) 1/402 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 4 (OVERLAPS) 698/1100 variables, 402/602 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1100 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 694 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1100/1101 variables, and 602 constraints, problems are : Problem set: 0 solved, 694 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 402/402 constraints, PredecessorRefiner: 694/694 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 694 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 199/199 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 2 (OVERLAPS) 1/402 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 4 (OVERLAPS) 698/1100 variables, 402/602 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1100 variables, 694/1296 constraints. Problems are: Problem set: 0 solved, 694 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1100 variables, 0/1296 constraints. Problems are: Problem set: 0 solved, 694 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 1100/1101 variables, and 1296 constraints, problems are : Problem set: 0 solved, 694 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 402/402 constraints, PredecessorRefiner: 694/694 constraints, Known Traps: 0/0 constraints]
After SMT, in 60211ms problems are : Problem set: 0 solved, 694 unsolved
Search for dead transitions found 0 dead transitions in 60216ms
Starting structural reductions in SI_LTL mode, iteration 1 : 402/1963 places, 699/1963 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61522 ms. Remains : 402/1963 places, 699/1963 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-050B-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050B-LTLCardinality-13 finished in 61602 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(G(p0)) U G(p1))))'
Support contains 4 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1951 transition count 1951
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1951 transition count 1951
Applied a total of 24 rules in 152 ms. Remains 1951 /1963 variables (removed 12) and now considering 1951/1963 (removed 12) transitions.
// Phase 1: matrix 1951 rows 1951 cols
[2024-06-01 22:03:01] [INFO ] Computed 201 invariants in 11 ms
[2024-06-01 22:03:02] [INFO ] Implicit Places using invariants in 444 ms returned []
[2024-06-01 22:03:02] [INFO ] Invariant cache hit.
[2024-06-01 22:03:03] [INFO ] Implicit Places using invariants and state equation in 1281 ms returned []
Implicit Place search using SMT with State Equation took 1749 ms to find 0 implicit places.
Running 1950 sub problems to find dead transitions.
[2024-06-01 22:03:03] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1950/3902 variables, and 0 constraints, problems are : Problem set: 0 solved, 1950 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1951 constraints, PredecessorRefiner: 1950/1950 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1950 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 timeout
1 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1950/3902 variables, and 0 constraints, problems are : Problem set: 0 solved, 1950 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1951 constraints, PredecessorRefiner: 0/1950 constraints, Known Traps: 0/0 constraints]
After SMT, in 60414ms problems are : Problem set: 0 solved, 1950 unsolved
Search for dead transitions found 0 dead transitions in 60429ms
Starting structural reductions in LTL mode, iteration 1 : 1951/1963 places, 1951/1963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62335 ms. Remains : 1951/1963 places, 1951/1963 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-14
Product exploration explored 100000 steps with 3 reset in 472 ms.
Product exploration explored 100000 steps with 1 reset in 597 ms.
Computed a total of 598 stabilizing places and 598 stable transitions
Computed a total of 598 stabilizing places and 598 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 309 ms. (129 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
[2024-06-01 22:04:05] [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) 78/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1871/1951 variables, 196/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1951 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1951/3902 variables, 1951/2152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3902 variables, 0/2152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3902 variables, 0/2152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3902/3902 variables, and 2152 constraints, problems are : Problem set: 0 solved, 1 unsolved in 768 ms.
Refiners :[Positive P Invariants (semi-flows): 201/201 constraints, State Equation: 1951/1951 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) 78/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 22:04:06] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1871/1951 variables, 196/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 22:04:06] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 3 ms to minimize.
[2024-06-01 22:04:07] [INFO ] Deduced a trap composed of 29 places in 183 ms of which 3 ms to minimize.
[2024-06-01 22:04:07] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 4 ms to minimize.
[2024-06-01 22:04:07] [INFO ] Deduced a trap composed of 26 places in 185 ms of which 4 ms to minimize.
[2024-06-01 22:04:07] [INFO ] Deduced a trap composed of 45 places in 191 ms of which 2 ms to minimize.
[2024-06-01 22:04:07] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 3 ms to minimize.
[2024-06-01 22:04:08] [INFO ] Deduced a trap composed of 56 places in 159 ms of which 2 ms to minimize.
[2024-06-01 22:04:08] [INFO ] Deduced a trap composed of 71 places in 138 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1951 variables, 8/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1951 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1951/3902 variables, 1951/2161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3902 variables, 1/2162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 22:04:09] [INFO ] Deduced a trap composed of 33 places in 393 ms of which 7 ms to minimize.
[2024-06-01 22:04:09] [INFO ] Deduced a trap composed of 43 places in 411 ms of which 7 ms to minimize.
[2024-06-01 22:04:10] [INFO ] Deduced a trap composed of 43 places in 387 ms of which 7 ms to minimize.
[2024-06-01 22:04:10] [INFO ] Deduced a trap composed of 52 places in 418 ms of which 7 ms to minimize.
[2024-06-01 22:04:10] [INFO ] Deduced a trap composed of 42 places in 377 ms of which 7 ms to minimize.
[2024-06-01 22:04:11] [INFO ] Deduced a trap composed of 34 places in 388 ms of which 7 ms to minimize.
[2024-06-01 22:04:11] [INFO ] Deduced a trap composed of 46 places in 391 ms of which 7 ms to minimize.
SMT process timed out in 6181ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1951 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1951/1951 places, 1951/1951 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 547 transitions
Trivial Post-agglo rules discarded 547 transitions
Performed 547 trivial Post agglomeration. Transition count delta: 547
Iterating post reduction 0 with 547 rules applied. Total rules applied 547 place count 1951 transition count 1404
Reduce places removed 547 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 548 rules applied. Total rules applied 1095 place count 1404 transition count 1403
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1096 place count 1403 transition count 1403
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 1096 place count 1403 transition count 1003
Deduced a syphon composed of 400 places in 1 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 1896 place count 1003 transition count 1003
Performed 448 Post agglomeration using F-continuation condition.Transition count delta: 448
Deduced a syphon composed of 448 places in 0 ms
Reduce places removed 448 places and 0 transitions.
Iterating global reduction 3 with 896 rules applied. Total rules applied 2792 place count 555 transition count 555
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2793 place count 555 transition count 554
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 2795 place count 554 transition count 553
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 2997 place count 453 transition count 653
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 3093 place count 405 transition count 701
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 3094 place count 405 transition count 700
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 3095 place count 404 transition count 699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3096 place count 403 transition count 699
Applied a total of 3096 rules in 173 ms. Remains 403 /1951 variables (removed 1548) and now considering 699/1951 (removed 1252) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 173 ms. Remains : 403/1951 places, 699/1951 transitions.
RANDOM walk for 40000 steps (18 resets) in 420 ms. (95 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 421153 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :0 out of 1
Probabilistic random walk after 421153 steps, saw 275429 distinct states, run finished after 3001 ms. (steps per millisecond=140 ) properties seen :0
// Phase 1: matrix 699 rows 403 cols
[2024-06-01 22:04:15] [INFO ] Computed 200 invariants in 2 ms
[2024-06-01 22:04:15] [INFO ] State equation strengthened by 230 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 176/189 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 329/518 variables, 189/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 229/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 19/537 variables, 6/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/537 variables, 3/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/537 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/537 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 22/559 variables, 8/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/559 variables, 4/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/559 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/581 variables, 8/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/581 variables, 4/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/581 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/603 variables, 8/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/603 variables, 4/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/603 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 22/625 variables, 8/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/625 variables, 4/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/625 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 22/647 variables, 8/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/647 variables, 4/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/647 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 22/669 variables, 8/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/669 variables, 4/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/669 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 22/691 variables, 8/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/691 variables, 4/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/691 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 22/713 variables, 8/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/713 variables, 4/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/713 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 22/735 variables, 8/625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/735 variables, 4/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/735 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 22/757 variables, 8/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/757 variables, 4/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/757 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 22/779 variables, 8/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/779 variables, 4/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/779 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 22/801 variables, 8/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/801 variables, 4/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/801 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 22/823 variables, 8/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/823 variables, 4/677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/823 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 22/845 variables, 8/685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/845 variables, 4/689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/845 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 22/867 variables, 8/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/867 variables, 4/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/867 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 22/889 variables, 8/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/889 variables, 4/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/889 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 22/911 variables, 8/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/911 variables, 4/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/911 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 22/933 variables, 8/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/933 variables, 4/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/933 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 22/955 variables, 8/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/955 variables, 4/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/955 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 22/977 variables, 8/757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/977 variables, 4/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/977 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 22/999 variables, 8/769 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/999 variables, 4/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/999 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 22/1021 variables, 8/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1021 variables, 4/785 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1021 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 22/1043 variables, 8/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1043 variables, 4/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1043 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 22/1065 variables, 8/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1065 variables, 4/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1065 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 20/1085 variables, 8/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1085 variables, 4/821 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1085 variables, 0/821 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (OVERLAPS) 14/1099 variables, 6/827 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1099 variables, 3/830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1099 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 3/1102 variables, 2/832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1102 variables, 1/833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1102 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (OVERLAPS) 0/1102 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1102/1102 variables, and 833 constraints, problems are : Problem set: 0 solved, 1 unsolved in 879 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 403/403 constraints, ReadFeed: 230/230 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 176/189 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 329/518 variables, 189/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 229/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/518 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 19/537 variables, 6/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/537 variables, 3/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/537 variables, 1/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/537 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 22/559 variables, 8/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/559 variables, 4/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/559 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 22/581 variables, 8/542 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/581 variables, 4/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/581 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 22/603 variables, 8/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/603 variables, 4/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/603 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 22/625 variables, 8/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/625 variables, 4/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/625 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 22/647 variables, 8/578 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/647 variables, 4/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/647 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 22/669 variables, 8/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/669 variables, 4/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/669 variables, 0/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 22/691 variables, 8/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/691 variables, 4/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/691 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 22/713 variables, 8/614 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/713 variables, 4/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/713 variables, 0/618 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 22/735 variables, 8/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/735 variables, 4/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/735 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 22/757 variables, 8/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/757 variables, 4/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/757 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 22/779 variables, 8/650 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/779 variables, 4/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/779 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (OVERLAPS) 22/801 variables, 8/662 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/801 variables, 4/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/801 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 22/823 variables, 8/674 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/823 variables, 4/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/823 variables, 0/678 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 22/845 variables, 8/686 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/845 variables, 4/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/845 variables, 0/690 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 22/867 variables, 8/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/867 variables, 4/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/867 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (OVERLAPS) 22/889 variables, 8/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/889 variables, 4/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/889 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 22/911 variables, 8/722 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/911 variables, 4/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/911 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (OVERLAPS) 22/933 variables, 8/734 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/933 variables, 4/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/933 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 22/955 variables, 8/746 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/955 variables, 4/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/955 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (OVERLAPS) 22/977 variables, 8/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/977 variables, 4/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/977 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (OVERLAPS) 22/999 variables, 8/770 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/999 variables, 4/774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/999 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (OVERLAPS) 22/1021 variables, 8/782 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1021 variables, 4/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1021 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (OVERLAPS) 22/1043 variables, 8/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1043 variables, 4/798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1043 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (OVERLAPS) 22/1065 variables, 8/806 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1065 variables, 4/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1065 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (OVERLAPS) 20/1085 variables, 8/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1085 variables, 4/822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1085 variables, 0/822 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (OVERLAPS) 14/1099 variables, 6/828 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1099 variables, 3/831 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1099 variables, 0/831 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (OVERLAPS) 3/1102 variables, 2/833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1102 variables, 1/834 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1102 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (OVERLAPS) 0/1102 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1102/1102 variables, and 834 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8078 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 403/403 constraints, ReadFeed: 230/230 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 9000ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 292 ms.
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 699/699 transitions.
Applied a total of 0 rules in 8 ms. Remains 403 /403 variables (removed 0) and now considering 699/699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 403/403 places, 699/699 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 699/699 transitions.
Applied a total of 0 rules in 8 ms. Remains 403 /403 variables (removed 0) and now considering 699/699 (removed 0) transitions.
[2024-06-01 22:04:24] [INFO ] Invariant cache hit.
[2024-06-01 22:04:24] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-06-01 22:04:24] [INFO ] Invariant cache hit.
[2024-06-01 22:04:25] [INFO ] State equation strengthened by 230 read => feed constraints.
[2024-06-01 22:04:26] [INFO ] Implicit Places using invariants and state equation in 1447 ms returned []
Implicit Place search using SMT with State Equation took 1752 ms to find 0 implicit places.
[2024-06-01 22:04:26] [INFO ] Redundant transitions in 5 ms returned []
Running 695 sub problems to find dead transitions.
[2024-06-01 22:04:26] [INFO ] Invariant cache hit.
[2024-06-01 22:04:26] [INFO ] State equation strengthened by 230 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (OVERLAPS) 1/403 variables, 93/200 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 4 (OVERLAPS) 699/1102 variables, 403/603 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1102 variables, 230/833 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1102 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 695 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1102/1102 variables, and 833 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 403/403 constraints, ReadFeed: 230/230 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 695 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (OVERLAPS) 1/403 variables, 93/200 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 4 (OVERLAPS) 699/1102 variables, 403/603 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1102 variables, 230/833 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1102 variables, 695/1528 constraints. Problems are: Problem set: 0 solved, 695 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1102/1102 variables, and 1528 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 403/403 constraints, ReadFeed: 230/230 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 0/0 constraints]
After SMT, in 60254ms problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 60260ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62034 ms. Remains : 403/403 places, 699/699 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 200 edges and 403 vertex of which 4 / 403 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 1474 edges and 401 vertex of which 399 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 197 edges and 397 vertex of which 4 / 397 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 395 transition count 690
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 196 edges and 393 vertex of which 6 / 393 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 390 transition count 681
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 194 edges and 387 vertex of which 8 / 387 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 383 transition count 670
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 190 edges and 379 vertex of which 8 / 379 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 375 transition count 656
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 186 edges and 371 vertex of which 8 / 371 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 367 transition count 642
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 182 edges and 363 vertex of which 8 / 363 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 359 transition count 628
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 178 edges and 355 vertex of which 8 / 355 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 351 transition count 614
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 174 edges and 347 vertex of which 8 / 347 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 343 transition count 600
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 170 edges and 339 vertex of which 8 / 339 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 335 transition count 586
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 166 edges and 331 vertex of which 8 / 331 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 327 transition count 572
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 162 edges and 323 vertex of which 8 / 323 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 319 transition count 558
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 158 edges and 315 vertex of which 8 / 315 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 311 transition count 544
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 154 edges and 307 vertex of which 8 / 307 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 303 transition count 530
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 150 edges and 299 vertex of which 8 / 299 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 295 transition count 516
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 146 edges and 291 vertex of which 8 / 291 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 287 transition count 502
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 142 edges and 283 vertex of which 8 / 283 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 279 transition count 488
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 138 edges and 275 vertex of which 8 / 275 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 271 transition count 474
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 134 edges and 267 vertex of which 8 / 267 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 263 transition count 460
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 130 edges and 259 vertex of which 8 / 259 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 255 transition count 446
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 126 edges and 251 vertex of which 8 / 251 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 247 transition count 432
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 122 edges and 243 vertex of which 8 / 243 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 239 transition count 418
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 118 edges and 235 vertex of which 8 / 235 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 231 transition count 404
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 114 edges and 227 vertex of which 8 / 227 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 223 transition count 390
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 110 edges and 219 vertex of which 8 / 219 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 215 transition count 376
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 106 edges and 211 vertex of which 8 / 211 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 207 transition count 362
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 102 edges and 203 vertex of which 8 / 203 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 199 transition count 348
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 98 edges and 195 vertex of which 8 / 195 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 191 transition count 334
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 91 edges and 189 vertex of which 2 / 189 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 27 with 13 rules applied. Total rules applied 504 place count 188 transition count 324
Reduce places removed 1 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.
Iterating post reduction 28 with 4 rules applied. Total rules applied 508 place count 187 transition count 321
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 29 with 2 rules applied. Total rules applied 510 place count 186 transition count 320
Graph (complete) has 720 edges and 186 vertex of which 184 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
Iterating post reduction 29 with 1 rules applied. Total rules applied 511 place count 184 transition count 319
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 515 place count 184 transition count 315
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 31 with 3 rules applied. Total rules applied 518 place count 184 transition count 312
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 520 place count 182 transition count 312
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 32 with 2 rules applied. Total rules applied 522 place count 181 transition count 311
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 32 with 4 rules applied. Total rules applied 526 place count 181 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 32 with 1 rules applied. Total rules applied 527 place count 180 transition count 307
Partial Free-agglomeration rule applied 23 times.
Drop transitions (Partial Free agglomeration) removed 23 transitions
Iterating global reduction 33 with 23 rules applied. Total rules applied 550 place count 180 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 33 with 22 rules applied. Total rules applied 572 place count 180 transition count 285
Applied a total of 572 rules in 84 ms. Remains 180 /403 variables (removed 223) and now considering 285/699 (removed 414) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 285 rows 180 cols
[2024-06-01 22:05:26] [INFO ] Computed 89 invariants in 2 ms
[2024-06-01 22:05:26] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 22:05:26] [INFO ] [Nat]Absence check using 89 positive place invariants in 11 ms returned sat
[2024-06-01 22:05:26] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 22:05:26] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 22:05:26] [INFO ] After 28ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 22:05:26] [INFO ] After 61ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 22:05:26] [INFO ] After 231ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 365 ms.
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 101 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p0)]
Support contains 4 out of 1951 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1951/1951 places, 1951/1951 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 544 transitions
Trivial Post-agglo rules discarded 544 transitions
Performed 544 trivial Post agglomeration. Transition count delta: 544
Iterating post reduction 0 with 544 rules applied. Total rules applied 544 place count 1950 transition count 1406
Reduce places removed 544 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 546 rules applied. Total rules applied 1090 place count 1406 transition count 1404
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1092 place count 1404 transition count 1404
Performed 400 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 400 Pre rules applied. Total rules applied 1092 place count 1404 transition count 1004
Deduced a syphon composed of 400 places in 1 ms
Reduce places removed 400 places and 0 transitions.
Iterating global reduction 3 with 800 rules applied. Total rules applied 1892 place count 1004 transition count 1004
Performed 445 Post agglomeration using F-continuation condition.Transition count delta: 445
Deduced a syphon composed of 445 places in 0 ms
Reduce places removed 445 places and 0 transitions.
Iterating global reduction 3 with 890 rules applied. Total rules applied 2782 place count 559 transition count 559
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2783 place count 559 transition count 558
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 2785 place count 558 transition count 557
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 2987 place count 457 transition count 657
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 3081 place count 410 transition count 703
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3083 place count 408 transition count 701
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3084 place count 407 transition count 701
Applied a total of 3084 rules in 220 ms. Remains 407 /1951 variables (removed 1544) and now considering 701/1951 (removed 1250) transitions.
// Phase 1: matrix 701 rows 407 cols
[2024-06-01 22:05:27] [INFO ] Computed 200 invariants in 1 ms
[2024-06-01 22:05:27] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-06-01 22:05:27] [INFO ] Invariant cache hit.
[2024-06-01 22:05:27] [INFO ] State equation strengthened by 230 read => feed constraints.
[2024-06-01 22:05:28] [INFO ] Implicit Places using invariants and state equation in 1206 ms returned []
Implicit Place search using SMT with State Equation took 1440 ms to find 0 implicit places.
[2024-06-01 22:05:28] [INFO ] Redundant transitions in 12 ms returned []
Running 696 sub problems to find dead transitions.
[2024-06-01 22:05:28] [INFO ] Invariant cache hit.
[2024-06-01 22:05:28] [INFO ] State equation strengthened by 230 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 2 (OVERLAPS) 1/407 variables, 93/200 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 4 (OVERLAPS) 700/1107 variables, 407/607 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1107 variables, 230/837 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1107/1108 variables, and 837 constraints, problems are : Problem set: 0 solved, 696 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 407/407 constraints, ReadFeed: 230/230 constraints, PredecessorRefiner: 696/696 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 696 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 2 (OVERLAPS) 1/407 variables, 93/200 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 4 (OVERLAPS) 700/1107 variables, 407/607 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1107 variables, 230/837 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1107 variables, 696/1533 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1107/1108 variables, and 1533 constraints, problems are : Problem set: 0 solved, 696 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 407/407 constraints, ReadFeed: 230/230 constraints, PredecessorRefiner: 696/696 constraints, Known Traps: 0/0 constraints]
After SMT, in 60237ms problems are : Problem set: 0 solved, 696 unsolved
Search for dead transitions found 0 dead transitions in 60243ms
Starting structural reductions in SI_LTL mode, iteration 1 : 407/1951 places, 701/1951 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61926 ms. Remains : 407/1951 places, 701/1951 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (18 resets) in 325 ms. (122 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
[2024-06-01 22:06:29] [INFO ] Invariant cache hit.
[2024-06-01 22:06:29] [INFO ] State equation strengthened by 230 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 178/191 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 331/522 variables, 191/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 229/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 19/541 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 3/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 1/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 22/563 variables, 8/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/563 variables, 4/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/563 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 20/583 variables, 8/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/583 variables, 4/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/583 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 23/606 variables, 8/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/606 variables, 3/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/606 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/608 variables, 1/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/608 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 22/630 variables, 10/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/630 variables, 4/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/630 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 22/652 variables, 8/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/652 variables, 4/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/652 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 22/674 variables, 8/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/674 variables, 4/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/674 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 22/696 variables, 8/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/696 variables, 4/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/696 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 22/718 variables, 8/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/718 variables, 4/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/718 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 22/740 variables, 8/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/740 variables, 4/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/740 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 22/762 variables, 8/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/762 variables, 4/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/762 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 22/784 variables, 8/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/784 variables, 4/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/784 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 22/806 variables, 8/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/806 variables, 4/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/806 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 22/828 variables, 8/677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/828 variables, 4/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/828 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 22/850 variables, 8/689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/850 variables, 4/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/850 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 22/872 variables, 8/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/872 variables, 4/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/872 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 22/894 variables, 8/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/894 variables, 4/717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/894 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 22/916 variables, 8/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/916 variables, 4/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/916 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 22/938 variables, 8/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/938 variables, 4/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/938 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 22/960 variables, 8/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/960 variables, 4/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/960 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 22/982 variables, 8/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/982 variables, 4/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/982 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 22/1004 variables, 8/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1004 variables, 4/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1004 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 22/1026 variables, 8/785 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1026 variables, 4/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1026 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 22/1048 variables, 8/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1048 variables, 4/801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1048 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 22/1070 variables, 8/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1070 variables, 4/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1070 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 20/1090 variables, 8/821 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1090 variables, 4/825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1090 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 14/1104 variables, 6/831 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1104 variables, 3/834 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1104 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 3/1107 variables, 2/836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1107 variables, 1/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1107 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 0/1107 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1107/1108 variables, and 837 constraints, problems are : Problem set: 0 solved, 1 unsolved in 866 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 407/407 constraints, ReadFeed: 230/230 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 178/191 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 331/522 variables, 191/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 229/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 522/1108 variables, and 514 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1660 ms.
Refiners :[Positive P Invariants (semi-flows): 93/200 constraints, State Equation: 191/407 constraints, ReadFeed: 229/230 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2568ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 407 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 407/407 places, 701/701 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 407 transition count 699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 406 transition count 699
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 406 transition count 698
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 5 place count 405 transition count 698
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 7 place count 404 transition count 697
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 9 place count 403 transition count 699
Applied a total of 9 rules in 26 ms. Remains 403 /407 variables (removed 4) and now considering 699/701 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 403/407 places, 699/701 transitions.
RANDOM walk for 40000 steps (14 resets) in 413 ms. (96 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (9 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 404598 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :0 out of 1
Probabilistic random walk after 404598 steps, saw 299715 distinct states, run finished after 3001 ms. (steps per millisecond=134 ) properties seen :0
// Phase 1: matrix 699 rows 403 cols
[2024-06-01 22:06:35] [INFO ] Computed 200 invariants in 3 ms
[2024-06-01 22:06:35] [INFO ] State equation strengthened by 230 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 176/189 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 329/518 variables, 189/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 229/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 19/537 variables, 6/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/537 variables, 3/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/537 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/537 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 22/559 variables, 8/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/559 variables, 4/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/559 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/581 variables, 8/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/581 variables, 4/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/581 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 22/603 variables, 8/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/603 variables, 4/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/603 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 22/625 variables, 8/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/625 variables, 4/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/625 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 22/647 variables, 8/577 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/647 variables, 4/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/647 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 22/669 variables, 8/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/669 variables, 4/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/669 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 22/691 variables, 8/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/691 variables, 4/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/691 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 22/713 variables, 8/613 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/713 variables, 4/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/713 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 22/735 variables, 8/625 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/735 variables, 4/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/735 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 22/757 variables, 8/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/757 variables, 4/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/757 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 22/779 variables, 8/649 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/779 variables, 4/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/779 variables, 0/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 22/801 variables, 8/661 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/801 variables, 4/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/801 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 22/823 variables, 8/673 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/823 variables, 4/677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/823 variables, 0/677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 22/845 variables, 8/685 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/845 variables, 4/689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/845 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 22/867 variables, 8/697 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/867 variables, 4/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/867 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 22/889 variables, 8/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/889 variables, 4/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/889 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (OVERLAPS) 22/911 variables, 8/721 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/911 variables, 4/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/911 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (OVERLAPS) 22/933 variables, 8/733 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/933 variables, 4/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/933 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (OVERLAPS) 22/955 variables, 8/745 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/955 variables, 4/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/955 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (OVERLAPS) 22/977 variables, 8/757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/977 variables, 4/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (INCLUDED_ONLY) 0/977 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (OVERLAPS) 22/999 variables, 8/769 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/999 variables, 4/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (INCLUDED_ONLY) 0/999 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (OVERLAPS) 22/1021 variables, 8/781 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1021 variables, 4/785 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (INCLUDED_ONLY) 0/1021 variables, 0/785 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (OVERLAPS) 22/1043 variables, 8/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1043 variables, 4/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (INCLUDED_ONLY) 0/1043 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (OVERLAPS) 22/1065 variables, 8/805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1065 variables, 4/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (INCLUDED_ONLY) 0/1065 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (OVERLAPS) 20/1085 variables, 8/817 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1085 variables, 4/821 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (INCLUDED_ONLY) 0/1085 variables, 0/821 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (OVERLAPS) 14/1099 variables, 6/827 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1099 variables, 3/830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (INCLUDED_ONLY) 0/1099 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (OVERLAPS) 3/1102 variables, 2/832 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1102 variables, 1/833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (INCLUDED_ONLY) 0/1102 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (OVERLAPS) 0/1102 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1102/1102 variables, and 833 constraints, problems are : Problem set: 0 solved, 1 unsolved in 781 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 403/403 constraints, ReadFeed: 230/230 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 176/189 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 329/518 variables, 189/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 229/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/1102 variables, and 512 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7879 ms.
Refiners :[Positive P Invariants (semi-flows): 93/200 constraints, State Equation: 189/403 constraints, ReadFeed: 229/230 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 8684ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 245 ms.
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 699/699 transitions.
Applied a total of 0 rules in 9 ms. Remains 403 /403 variables (removed 0) and now considering 699/699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 403/403 places, 699/699 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 699/699 transitions.
Applied a total of 0 rules in 9 ms. Remains 403 /403 variables (removed 0) and now considering 699/699 (removed 0) transitions.
[2024-06-01 22:06:44] [INFO ] Invariant cache hit.
[2024-06-01 22:06:44] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-06-01 22:06:44] [INFO ] Invariant cache hit.
[2024-06-01 22:06:44] [INFO ] State equation strengthened by 230 read => feed constraints.
[2024-06-01 22:06:45] [INFO ] Implicit Places using invariants and state equation in 1135 ms returned []
Implicit Place search using SMT with State Equation took 1510 ms to find 0 implicit places.
[2024-06-01 22:06:45] [INFO ] Redundant transitions in 5 ms returned []
Running 695 sub problems to find dead transitions.
[2024-06-01 22:06:45] [INFO ] Invariant cache hit.
[2024-06-01 22:06:45] [INFO ] State equation strengthened by 230 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (OVERLAPS) 1/403 variables, 93/200 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 4 (OVERLAPS) 699/1102 variables, 403/603 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1102 variables, 230/833 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1102 variables, 0/833 constraints. Problems are: Problem set: 0 solved, 695 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1102/1102 variables, and 833 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 403/403 constraints, ReadFeed: 230/230 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 695 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/402 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/402 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 2 (OVERLAPS) 1/403 variables, 93/200 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 4 (OVERLAPS) 699/1102 variables, 403/603 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1102 variables, 230/833 constraints. Problems are: Problem set: 0 solved, 695 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1102 variables, 695/1528 constraints. Problems are: Problem set: 0 solved, 695 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1102/1102 variables, and 1528 constraints, problems are : Problem set: 0 solved, 695 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 403/403 constraints, ReadFeed: 230/230 constraints, PredecessorRefiner: 695/695 constraints, Known Traps: 0/0 constraints]
After SMT, in 60237ms problems are : Problem set: 0 solved, 695 unsolved
Search for dead transitions found 0 dead transitions in 60243ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61777 ms. Remains : 403/403 places, 699/699 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 200 edges and 403 vertex of which 4 / 403 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 1474 edges and 401 vertex of which 399 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 197 edges and 397 vertex of which 4 / 397 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 395 transition count 690
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 196 edges and 393 vertex of which 6 / 393 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 390 transition count 681
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 194 edges and 387 vertex of which 8 / 387 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 383 transition count 670
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 190 edges and 379 vertex of which 8 / 379 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 375 transition count 656
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 186 edges and 371 vertex of which 8 / 371 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 367 transition count 642
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 182 edges and 363 vertex of which 8 / 363 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 359 transition count 628
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 178 edges and 355 vertex of which 8 / 355 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 351 transition count 614
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 174 edges and 347 vertex of which 8 / 347 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 343 transition count 600
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 170 edges and 339 vertex of which 8 / 339 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 335 transition count 586
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 166 edges and 331 vertex of which 8 / 331 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 327 transition count 572
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 162 edges and 323 vertex of which 8 / 323 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 319 transition count 558
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 158 edges and 315 vertex of which 8 / 315 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 311 transition count 544
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 154 edges and 307 vertex of which 8 / 307 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 303 transition count 530
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 150 edges and 299 vertex of which 8 / 299 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 295 transition count 516
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 146 edges and 291 vertex of which 8 / 291 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 287 transition count 502
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 142 edges and 283 vertex of which 8 / 283 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 279 transition count 488
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 138 edges and 275 vertex of which 8 / 275 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 271 transition count 474
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 134 edges and 267 vertex of which 8 / 267 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 263 transition count 460
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 130 edges and 259 vertex of which 8 / 259 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 19 rules applied. Total rules applied 339 place count 255 transition count 446
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 126 edges and 251 vertex of which 8 / 251 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 247 transition count 432
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 122 edges and 243 vertex of which 8 / 243 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 239 transition count 418
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 118 edges and 235 vertex of which 8 / 235 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 231 transition count 404
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 114 edges and 227 vertex of which 8 / 227 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 223 transition count 390
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 110 edges and 219 vertex of which 8 / 219 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 215 transition count 376
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 106 edges and 211 vertex of which 8 / 211 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 207 transition count 362
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 102 edges and 203 vertex of which 8 / 203 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 199 transition count 348
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 98 edges and 195 vertex of which 8 / 195 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 191 transition count 334
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 91 edges and 189 vertex of which 2 / 189 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 27 with 13 rules applied. Total rules applied 504 place count 188 transition count 324
Reduce places removed 1 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.
Iterating post reduction 28 with 4 rules applied. Total rules applied 508 place count 187 transition count 321
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 29 with 2 rules applied. Total rules applied 510 place count 186 transition count 320
Graph (complete) has 720 edges and 186 vertex of which 184 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
Iterating post reduction 29 with 1 rules applied. Total rules applied 511 place count 184 transition count 319
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 515 place count 184 transition count 315
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 31 with 3 rules applied. Total rules applied 518 place count 184 transition count 312
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 520 place count 182 transition count 312
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 32 with 2 rules applied. Total rules applied 522 place count 181 transition count 311
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 32 with 4 rules applied. Total rules applied 526 place count 181 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 32 with 1 rules applied. Total rules applied 527 place count 180 transition count 307
Partial Free-agglomeration rule applied 23 times.
Drop transitions (Partial Free agglomeration) removed 23 transitions
Iterating global reduction 33 with 23 rules applied. Total rules applied 550 place count 180 transition count 307
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 33 with 22 rules applied. Total rules applied 572 place count 180 transition count 285
Applied a total of 572 rules in 64 ms. Remains 180 /403 variables (removed 223) and now considering 285/699 (removed 414) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 285 rows 180 cols
[2024-06-01 22:07:46] [INFO ] Computed 89 invariants in 1 ms
[2024-06-01 22:07:46] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 22:07:46] [INFO ] [Nat]Absence check using 89 positive place invariants in 9 ms returned sat
[2024-06-01 22:07:46] [INFO ] After 81ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 22:07:46] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-01 22:07:46] [INFO ] After 17ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 22:07:46] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 22:07:46] [INFO ] After 237ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 384 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 29 reset in 509 ms.
Product exploration explored 100000 steps with 31 reset in 614 ms.
Support contains 4 out of 407 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 407/407 places, 701/701 transitions.
Applied a total of 0 rules in 9 ms. Remains 407 /407 variables (removed 0) and now considering 701/701 (removed 0) transitions.
// Phase 1: matrix 701 rows 407 cols
[2024-06-01 22:07:47] [INFO ] Computed 200 invariants in 4 ms
[2024-06-01 22:07:48] [INFO ] Implicit Places using invariants in 222 ms returned []
[2024-06-01 22:07:48] [INFO ] Invariant cache hit.
[2024-06-01 22:07:48] [INFO ] State equation strengthened by 230 read => feed constraints.
[2024-06-01 22:07:49] [INFO ] Implicit Places using invariants and state equation in 1186 ms returned []
Implicit Place search using SMT with State Equation took 1434 ms to find 0 implicit places.
[2024-06-01 22:07:49] [INFO ] Redundant transitions in 5 ms returned []
Running 696 sub problems to find dead transitions.
[2024-06-01 22:07:49] [INFO ] Invariant cache hit.
[2024-06-01 22:07:49] [INFO ] State equation strengthened by 230 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 2 (OVERLAPS) 1/407 variables, 93/200 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 4 (OVERLAPS) 700/1107 variables, 407/607 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1107 variables, 230/837 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1107/1108 variables, and 837 constraints, problems are : Problem set: 0 solved, 696 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 407/407 constraints, ReadFeed: 230/230 constraints, PredecessorRefiner: 696/696 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 696 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 2 (OVERLAPS) 1/407 variables, 93/200 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 4 (OVERLAPS) 700/1107 variables, 407/607 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1107 variables, 230/837 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1107 variables, 696/1533 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1107/1108 variables, and 1533 constraints, problems are : Problem set: 0 solved, 696 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 407/407 constraints, ReadFeed: 230/230 constraints, PredecessorRefiner: 696/696 constraints, Known Traps: 0/0 constraints]
After SMT, in 60264ms problems are : Problem set: 0 solved, 696 unsolved
Search for dead transitions found 0 dead transitions in 60269ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61730 ms. Remains : 407/407 places, 701/701 transitions.
Treatment of property ShieldRVt-PT-050B-LTLCardinality-14 finished in 347825 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))'
Support contains 2 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1952 transition count 1952
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1952 transition count 1952
Applied a total of 22 rules in 171 ms. Remains 1952 /1963 variables (removed 11) and now considering 1952/1963 (removed 11) transitions.
// Phase 1: matrix 1952 rows 1952 cols
[2024-06-01 22:08:49] [INFO ] Computed 201 invariants in 4 ms
[2024-06-01 22:08:50] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-06-01 22:08:50] [INFO ] Invariant cache hit.
[2024-06-01 22:08:52] [INFO ] Implicit Places using invariants and state equation in 2078 ms returned []
Implicit Place search using SMT with State Equation took 2585 ms to find 0 implicit places.
Running 1951 sub problems to find dead transitions.
[2024-06-01 22:08:52] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1951/3904 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1952 constraints, PredecessorRefiner: 1951/1951 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1951 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1951/3904 variables, and 0 constraints, problems are : Problem set: 0 solved, 1951 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/1952 constraints, PredecessorRefiner: 0/1951 constraints, Known Traps: 0/0 constraints]
After SMT, in 60414ms problems are : Problem set: 0 solved, 1951 unsolved
Search for dead transitions found 0 dead transitions in 60428ms
Starting structural reductions in LTL mode, iteration 1 : 1952/1963 places, 1952/1963 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63188 ms. Remains : 1952/1963 places, 1952/1963 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 444 ms.
Product exploration explored 100000 steps with 50000 reset in 432 ms.
Computed a total of 599 stabilizing places and 599 stable transitions
Computed a total of 599 stabilizing places and 599 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 27 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-050B-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-050B-LTLCardinality-15 finished in 64196 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&&G(p1)))))'
Found a Shortening insensitive property : ShieldRVt-PT-050B-LTLCardinality-01
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Support contains 4 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 551 transitions
Trivial Post-agglo rules discarded 551 transitions
Performed 551 trivial Post agglomeration. Transition count delta: 551
Iterating post reduction 0 with 551 rules applied. Total rules applied 551 place count 1962 transition count 1411
Reduce places removed 551 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 552 rules applied. Total rules applied 1103 place count 1411 transition count 1410
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1104 place count 1410 transition count 1410
Performed 391 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 391 Pre rules applied. Total rules applied 1104 place count 1410 transition count 1019
Deduced a syphon composed of 391 places in 2 ms
Reduce places removed 391 places and 0 transitions.
Iterating global reduction 3 with 782 rules applied. Total rules applied 1886 place count 1019 transition count 1019
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1894 place count 1011 transition count 1011
Iterating global reduction 3 with 8 rules applied. Total rules applied 1902 place count 1011 transition count 1011
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1902 place count 1011 transition count 1004
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1916 place count 1004 transition count 1004
Performed 444 Post agglomeration using F-continuation condition.Transition count delta: 444
Deduced a syphon composed of 444 places in 0 ms
Reduce places removed 444 places and 0 transitions.
Iterating global reduction 3 with 888 rules applied. Total rules applied 2804 place count 560 transition count 560
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2805 place count 560 transition count 559
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 2807 place count 559 transition count 558
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 3009 place count 458 transition count 658
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 3103 place count 411 transition count 704
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 3105 place count 411 transition count 704
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3107 place count 409 transition count 702
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3108 place count 408 transition count 702
Applied a total of 3108 rules in 192 ms. Remains 408 /1963 variables (removed 1555) and now considering 702/1963 (removed 1261) transitions.
// Phase 1: matrix 702 rows 408 cols
[2024-06-01 22:09:54] [INFO ] Computed 200 invariants in 1 ms
[2024-06-01 22:09:54] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-06-01 22:09:54] [INFO ] Invariant cache hit.
[2024-06-01 22:09:54] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 22:09:54] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
Running 697 sub problems to find dead transitions.
[2024-06-01 22:09:54] [INFO ] Invariant cache hit.
[2024-06-01 22:09:54] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 2 (OVERLAPS) 1/408 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 697 unsolved
[2024-06-01 22:10:04] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/408 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 5 (OVERLAPS) 701/1109 variables, 408/609 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1109 variables, 10/619 constraints. Problems are: Problem set: 0 solved, 697 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1109/1110 variables, and 619 constraints, problems are : Problem set: 0 solved, 697 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 408/408 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 697/697 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 697 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 2 (OVERLAPS) 1/408 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/408 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 5 (OVERLAPS) 701/1109 variables, 408/609 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1109 variables, 10/619 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1109 variables, 697/1316 constraints. Problems are: Problem set: 0 solved, 697 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1109 variables, 0/1316 constraints. Problems are: Problem set: 0 solved, 697 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1109/1110 variables, and 1316 constraints, problems are : Problem set: 0 solved, 697 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 408/408 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 697/697 constraints, Known Traps: 1/1 constraints]
After SMT, in 60213ms problems are : Problem set: 0 solved, 697 unsolved
Search for dead transitions found 0 dead transitions in 60218ms
Starting structural reductions in LI_LTL mode, iteration 1 : 408/1963 places, 702/1963 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61090 ms. Remains : 408/1963 places, 702/1963 transitions.
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-01
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
Treatment of property ShieldRVt-PT-050B-LTLCardinality-01 finished in 61292 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
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&&G((p0 U p1))))))'
Found a Shortening insensitive property : ShieldRVt-PT-050B-LTLCardinality-10
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 4 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 550 transitions
Trivial Post-agglo rules discarded 550 transitions
Performed 550 trivial Post agglomeration. Transition count delta: 550
Iterating post reduction 0 with 550 rules applied. Total rules applied 550 place count 1962 transition count 1412
Reduce places removed 550 places and 0 transitions.
Iterating post reduction 1 with 550 rules applied. Total rules applied 1100 place count 1412 transition count 1412
Performed 392 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 392 Pre rules applied. Total rules applied 1100 place count 1412 transition count 1020
Deduced a syphon composed of 392 places in 1 ms
Reduce places removed 392 places and 0 transitions.
Iterating global reduction 2 with 784 rules applied. Total rules applied 1884 place count 1020 transition count 1020
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 1890 place count 1014 transition count 1014
Iterating global reduction 2 with 6 rules applied. Total rules applied 1896 place count 1014 transition count 1014
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 1896 place count 1014 transition count 1009
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 1906 place count 1009 transition count 1009
Performed 450 Post agglomeration using F-continuation condition.Transition count delta: 450
Deduced a syphon composed of 450 places in 0 ms
Reduce places removed 450 places and 0 transitions.
Iterating global reduction 2 with 900 rules applied. Total rules applied 2806 place count 559 transition count 559
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2807 place count 559 transition count 558
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 3 with 2 rules applied. Total rules applied 2809 place count 558 transition count 557
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 3011 place count 457 transition count 657
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 3103 place count 411 transition count 701
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3105 place count 409 transition count 699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 3106 place count 408 transition count 699
Applied a total of 3106 rules in 193 ms. Remains 408 /1963 variables (removed 1555) and now considering 699/1963 (removed 1264) transitions.
// Phase 1: matrix 699 rows 408 cols
[2024-06-01 22:10:55] [INFO ] Computed 200 invariants in 3 ms
[2024-06-01 22:10:56] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-06-01 22:10:56] [INFO ] Invariant cache hit.
[2024-06-01 22:10:56] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 22:10:56] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 732 ms to find 0 implicit places.
Running 693 sub problems to find dead transitions.
[2024-06-01 22:10:56] [INFO ] Invariant cache hit.
[2024-06-01 22:10:56] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 198/198 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 2 (OVERLAPS) 2/408 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 4 (OVERLAPS) 698/1106 variables, 408/608 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1106 variables, 8/616 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1106 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 693 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1106/1107 variables, and 616 constraints, problems are : Problem set: 0 solved, 693 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 408/408 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 693/693 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 693 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 198/198 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 2 (OVERLAPS) 2/408 variables, 2/200 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/408 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 4 (OVERLAPS) 698/1106 variables, 408/608 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1106 variables, 8/616 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1106 variables, 693/1309 constraints. Problems are: Problem set: 0 solved, 693 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1106 variables, 0/1309 constraints. Problems are: Problem set: 0 solved, 693 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 1106/1107 variables, and 1309 constraints, problems are : Problem set: 0 solved, 693 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 408/408 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 693/693 constraints, Known Traps: 0/0 constraints]
After SMT, in 60253ms problems are : Problem set: 0 solved, 693 unsolved
Search for dead transitions found 0 dead transitions in 60261ms
Starting structural reductions in LI_LTL mode, iteration 1 : 408/1963 places, 699/1963 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 61188 ms. Remains : 408/1963 places, 699/1963 transitions.
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-10
Stuttering criterion allowed to conclude after 8393 steps with 4 reset in 48 ms.
Treatment of property ShieldRVt-PT-050B-LTLCardinality-10 finished in 61612 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0)) U G(p1))))'
Found a Lengthening insensitive property : ShieldRVt-PT-050B-LTLCardinality-14
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), (NOT p0)]
Support contains 4 out of 1963 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1963/1963 places, 1963/1963 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 551 transitions
Trivial Post-agglo rules discarded 551 transitions
Performed 551 trivial Post agglomeration. Transition count delta: 551
Iterating post reduction 0 with 551 rules applied. Total rules applied 551 place count 1962 transition count 1411
Reduce places removed 551 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 553 rules applied. Total rules applied 1104 place count 1411 transition count 1409
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1106 place count 1409 transition count 1409
Performed 390 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 390 Pre rules applied. Total rules applied 1106 place count 1409 transition count 1019
Deduced a syphon composed of 390 places in 1 ms
Reduce places removed 390 places and 0 transitions.
Iterating global reduction 3 with 780 rules applied. Total rules applied 1886 place count 1019 transition count 1019
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1894 place count 1011 transition count 1011
Iterating global reduction 3 with 8 rules applied. Total rules applied 1902 place count 1011 transition count 1011
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1902 place count 1011 transition count 1004
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1916 place count 1004 transition count 1004
Performed 445 Post agglomeration using F-continuation condition.Transition count delta: 445
Deduced a syphon composed of 445 places in 0 ms
Reduce places removed 445 places and 0 transitions.
Iterating global reduction 3 with 890 rules applied. Total rules applied 2806 place count 559 transition count 559
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2807 place count 559 transition count 558
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 2809 place count 558 transition count 557
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 3011 place count 457 transition count 657
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 3105 place count 410 transition count 703
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 3107 place count 408 transition count 701
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 3108 place count 407 transition count 701
Applied a total of 3108 rules in 247 ms. Remains 407 /1963 variables (removed 1556) and now considering 701/1963 (removed 1262) transitions.
// Phase 1: matrix 701 rows 407 cols
[2024-06-01 22:11:57] [INFO ] Computed 200 invariants in 1 ms
[2024-06-01 22:11:57] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-06-01 22:11:57] [INFO ] Invariant cache hit.
[2024-06-01 22:11:57] [INFO ] State equation strengthened by 230 read => feed constraints.
[2024-06-01 22:11:58] [INFO ] Implicit Places using invariants and state equation in 1205 ms returned []
Implicit Place search using SMT with State Equation took 1599 ms to find 0 implicit places.
Running 696 sub problems to find dead transitions.
[2024-06-01 22:11:58] [INFO ] Invariant cache hit.
[2024-06-01 22:11:58] [INFO ] State equation strengthened by 230 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 2 (OVERLAPS) 1/407 variables, 93/200 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 4 (OVERLAPS) 700/1107 variables, 407/607 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1107 variables, 230/837 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1107 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1107/1108 variables, and 837 constraints, problems are : Problem set: 0 solved, 696 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 407/407 constraints, ReadFeed: 230/230 constraints, PredecessorRefiner: 696/696 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 696 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 2 (OVERLAPS) 1/407 variables, 93/200 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 4 (OVERLAPS) 700/1107 variables, 407/607 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1107 variables, 230/837 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1107 variables, 696/1533 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1107/1108 variables, and 1533 constraints, problems are : Problem set: 0 solved, 696 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 407/407 constraints, ReadFeed: 230/230 constraints, PredecessorRefiner: 696/696 constraints, Known Traps: 0/0 constraints]
After SMT, in 60290ms problems are : Problem set: 0 solved, 696 unsolved
Search for dead transitions found 0 dead transitions in 60296ms
Starting structural reductions in LI_LTL mode, iteration 1 : 407/1963 places, 701/1963 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 62143 ms. Remains : 407/1963 places, 701/1963 transitions.
Running random walk in product with property : ShieldRVt-PT-050B-LTLCardinality-14
Product exploration explored 100000 steps with 26 reset in 519 ms.
Product exploration explored 100000 steps with 30 reset in 634 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (18 resets) in 387 ms. (103 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
[2024-06-01 22:13:00] [INFO ] Invariant cache hit.
[2024-06-01 22:13:00] [INFO ] State equation strengthened by 230 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 178/191 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 331/522 variables, 191/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 229/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 19/541 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 3/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 1/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 22/563 variables, 8/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/563 variables, 4/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/563 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 20/583 variables, 8/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/583 variables, 4/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/583 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 23/606 variables, 8/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/606 variables, 3/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/606 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/608 variables, 1/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/608 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 22/630 variables, 10/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/630 variables, 4/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/630 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 22/652 variables, 8/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/652 variables, 4/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/652 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 22/674 variables, 8/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/674 variables, 4/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/674 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 22/696 variables, 8/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/696 variables, 4/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/696 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 22/718 variables, 8/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/718 variables, 4/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/718 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 22/740 variables, 8/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/740 variables, 4/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/740 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 22/762 variables, 8/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/762 variables, 4/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/762 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 22/784 variables, 8/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/784 variables, 4/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/784 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 22/806 variables, 8/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/806 variables, 4/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/806 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 22/828 variables, 8/677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/828 variables, 4/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/828 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 22/850 variables, 8/689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/850 variables, 4/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/850 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 22/872 variables, 8/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/872 variables, 4/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/872 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 22/894 variables, 8/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/894 variables, 4/717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/894 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 22/916 variables, 8/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/916 variables, 4/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/916 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 22/938 variables, 8/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/938 variables, 4/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/938 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 22/960 variables, 8/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/960 variables, 4/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/960 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 22/982 variables, 8/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/982 variables, 4/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/982 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 22/1004 variables, 8/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1004 variables, 4/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1004 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 22/1026 variables, 8/785 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1026 variables, 4/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1026 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 22/1048 variables, 8/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1048 variables, 4/801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1048 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 22/1070 variables, 8/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1070 variables, 4/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1070 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 20/1090 variables, 8/821 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1090 variables, 4/825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1090 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 14/1104 variables, 6/831 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1104 variables, 3/834 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1104 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 3/1107 variables, 2/836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1107 variables, 1/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1107 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 0/1107 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1107/1108 variables, and 837 constraints, problems are : Problem set: 0 solved, 1 unsolved in 868 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 407/407 constraints, ReadFeed: 230/230 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 178/191 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 331/522 variables, 191/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 229/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 522/1108 variables, and 514 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1233 ms.
Refiners :[Positive P Invariants (semi-flows): 93/200 constraints, State Equation: 191/407 constraints, ReadFeed: 229/230 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2151ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 407 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 407/407 places, 701/701 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 407 transition count 699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 406 transition count 699
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 406 transition count 698
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 5 place count 405 transition count 698
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 7 place count 404 transition count 697
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 9 place count 403 transition count 699
Applied a total of 9 rules in 28 ms. Remains 403 /407 variables (removed 4) and now considering 699/701 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 403/407 places, 699/701 transitions.
RANDOM walk for 40000 steps (13 resets) in 450 ms. (88 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (9 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 33944 steps, run visited all 1 properties in 284 ms. (steps per millisecond=119 )
Probabilistic random walk after 33944 steps, saw 21856 distinct states, run finished after 284 ms. (steps per millisecond=119 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p0)]
Support contains 4 out of 407 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 407/407 places, 701/701 transitions.
Applied a total of 0 rules in 9 ms. Remains 407 /407 variables (removed 0) and now considering 701/701 (removed 0) transitions.
[2024-06-01 22:13:03] [INFO ] Invariant cache hit.
[2024-06-01 22:13:03] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-06-01 22:13:04] [INFO ] Invariant cache hit.
[2024-06-01 22:13:04] [INFO ] State equation strengthened by 230 read => feed constraints.
[2024-06-01 22:13:05] [INFO ] Implicit Places using invariants and state equation in 1271 ms returned []
Implicit Place search using SMT with State Equation took 1526 ms to find 0 implicit places.
[2024-06-01 22:13:05] [INFO ] Redundant transitions in 5 ms returned []
Running 696 sub problems to find dead transitions.
[2024-06-01 22:13:05] [INFO ] Invariant cache hit.
[2024-06-01 22:13:05] [INFO ] State equation strengthened by 230 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 2 (OVERLAPS) 1/407 variables, 93/200 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 4 (OVERLAPS) 700/1107 variables, 407/607 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1107 variables, 230/837 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1107/1108 variables, and 837 constraints, problems are : Problem set: 0 solved, 696 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 407/407 constraints, ReadFeed: 230/230 constraints, PredecessorRefiner: 696/696 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 696 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 2 (OVERLAPS) 1/407 variables, 93/200 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 4 (OVERLAPS) 700/1107 variables, 407/607 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1107 variables, 230/837 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1107 variables, 696/1533 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1107/1108 variables, and 1533 constraints, problems are : Problem set: 0 solved, 696 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 407/407 constraints, ReadFeed: 230/230 constraints, PredecessorRefiner: 696/696 constraints, Known Traps: 0/0 constraints]
After SMT, in 60228ms problems are : Problem set: 0 solved, 696 unsolved
Search for dead transitions found 0 dead transitions in 60234ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61792 ms. Remains : 407/407 places, 701/701 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p0)]
RANDOM walk for 40000 steps (10 resets) in 393 ms. (101 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
[2024-06-01 22:14:05] [INFO ] Invariant cache hit.
[2024-06-01 22:14:05] [INFO ] State equation strengthened by 230 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 178/191 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 331/522 variables, 191/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 229/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 19/541 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/541 variables, 3/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/541 variables, 1/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/541 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 22/563 variables, 8/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/563 variables, 4/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/563 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 20/583 variables, 8/543 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/583 variables, 4/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/583 variables, 0/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 23/606 variables, 8/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/606 variables, 3/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/606 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/608 variables, 1/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/608 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 22/630 variables, 10/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/630 variables, 4/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/630 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 22/652 variables, 8/581 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/652 variables, 4/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/652 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 22/674 variables, 8/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/674 variables, 4/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/674 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 22/696 variables, 8/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/696 variables, 4/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/696 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 22/718 variables, 8/617 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/718 variables, 4/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/718 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 22/740 variables, 8/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/740 variables, 4/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/740 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 22/762 variables, 8/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/762 variables, 4/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/762 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 22/784 variables, 8/653 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/784 variables, 4/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/784 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 22/806 variables, 8/665 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/806 variables, 4/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/806 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 22/828 variables, 8/677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/828 variables, 4/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/828 variables, 0/681 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 22/850 variables, 8/689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/850 variables, 4/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/850 variables, 0/693 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 56 (OVERLAPS) 22/872 variables, 8/701 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/872 variables, 4/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/872 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 22/894 variables, 8/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/894 variables, 4/717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/894 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 62 (OVERLAPS) 22/916 variables, 8/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/916 variables, 4/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/916 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 22/938 variables, 8/737 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/938 variables, 4/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/938 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 68 (OVERLAPS) 22/960 variables, 8/749 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/960 variables, 4/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/960 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 71 (OVERLAPS) 22/982 variables, 8/761 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 72 (INCLUDED_ONLY) 0/982 variables, 4/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 73 (INCLUDED_ONLY) 0/982 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 74 (OVERLAPS) 22/1004 variables, 8/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 75 (INCLUDED_ONLY) 0/1004 variables, 4/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 76 (INCLUDED_ONLY) 0/1004 variables, 0/777 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 77 (OVERLAPS) 22/1026 variables, 8/785 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 78 (INCLUDED_ONLY) 0/1026 variables, 4/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 79 (INCLUDED_ONLY) 0/1026 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 80 (OVERLAPS) 22/1048 variables, 8/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 81 (INCLUDED_ONLY) 0/1048 variables, 4/801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 82 (INCLUDED_ONLY) 0/1048 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 83 (OVERLAPS) 22/1070 variables, 8/809 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 84 (INCLUDED_ONLY) 0/1070 variables, 4/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 85 (INCLUDED_ONLY) 0/1070 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 86 (OVERLAPS) 20/1090 variables, 8/821 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 87 (INCLUDED_ONLY) 0/1090 variables, 4/825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 88 (INCLUDED_ONLY) 0/1090 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 89 (OVERLAPS) 14/1104 variables, 6/831 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 90 (INCLUDED_ONLY) 0/1104 variables, 3/834 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 91 (INCLUDED_ONLY) 0/1104 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 92 (OVERLAPS) 3/1107 variables, 2/836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 93 (INCLUDED_ONLY) 0/1107 variables, 1/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 94 (INCLUDED_ONLY) 0/1107 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 95 (OVERLAPS) 0/1107 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1107/1108 variables, and 837 constraints, problems are : Problem set: 0 solved, 1 unsolved in 830 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 407/407 constraints, ReadFeed: 230/230 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/13 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 178/191 variables, 88/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 331/522 variables, 191/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 229/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 522/1108 variables, and 514 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1220 ms.
Refiners :[Positive P Invariants (semi-flows): 93/200 constraints, State Equation: 191/407 constraints, ReadFeed: 229/230 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2077ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 407 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 407/407 places, 701/701 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 407 transition count 699
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 406 transition count 699
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 406 transition count 698
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 5 place count 405 transition count 698
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 7 place count 404 transition count 697
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 9 place count 403 transition count 699
Applied a total of 9 rules in 32 ms. Remains 403 /407 variables (removed 4) and now considering 699/701 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 403/407 places, 699/701 transitions.
RANDOM walk for 40000 steps (12 resets) in 362 ms. (110 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 33944 steps, run visited all 1 properties in 295 ms. (steps per millisecond=115 )
Probabilistic random walk after 33944 steps, saw 21856 distinct states, run finished after 295 ms. (steps per millisecond=115 ) properties seen :1
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 24 reset in 509 ms.
Product exploration explored 100000 steps with 28 reset in 624 ms.
Support contains 4 out of 407 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 407/407 places, 701/701 transitions.
Applied a total of 0 rules in 9 ms. Remains 407 /407 variables (removed 0) and now considering 701/701 (removed 0) transitions.
[2024-06-01 22:14:09] [INFO ] Invariant cache hit.
[2024-06-01 22:14:10] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-06-01 22:14:10] [INFO ] Invariant cache hit.
[2024-06-01 22:14:10] [INFO ] State equation strengthened by 230 read => feed constraints.
[2024-06-01 22:14:11] [INFO ] Implicit Places using invariants and state equation in 1175 ms returned []
Implicit Place search using SMT with State Equation took 1454 ms to find 0 implicit places.
[2024-06-01 22:14:11] [INFO ] Redundant transitions in 6 ms returned []
Running 696 sub problems to find dead transitions.
[2024-06-01 22:14:11] [INFO ] Invariant cache hit.
[2024-06-01 22:14:11] [INFO ] State equation strengthened by 230 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 2 (OVERLAPS) 1/407 variables, 93/200 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 4 (OVERLAPS) 700/1107 variables, 407/607 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1107 variables, 230/837 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1107 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1107/1108 variables, and 837 constraints, problems are : Problem set: 0 solved, 696 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 407/407 constraints, ReadFeed: 230/230 constraints, PredecessorRefiner: 696/696 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 696 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/406 variables, 107/107 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/406 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 2 (OVERLAPS) 1/407 variables, 93/200 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 4 (OVERLAPS) 700/1107 variables, 407/607 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1107 variables, 230/837 constraints. Problems are: Problem set: 0 solved, 696 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1107 variables, 696/1533 constraints. Problems are: Problem set: 0 solved, 696 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1107/1108 variables, and 1533 constraints, problems are : Problem set: 0 solved, 696 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 200/200 constraints, State Equation: 407/407 constraints, ReadFeed: 230/230 constraints, PredecessorRefiner: 696/696 constraints, Known Traps: 0/0 constraints]
After SMT, in 60231ms problems are : Problem set: 0 solved, 696 unsolved
Search for dead transitions found 0 dead transitions in 60238ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61717 ms. Remains : 407/407 places, 701/701 transitions.
Treatment of property ShieldRVt-PT-050B-LTLCardinality-14 finished in 194854 ms.
[2024-06-01 22:15:11] [INFO ] Flatten gal took : 94 ms
[2024-06-01 22:15:11] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 22:15:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1963 places, 1963 transitions and 4826 arcs took 13 ms.
Total runtime 2013514 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ShieldRVt-PT-050B-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ShieldRVt-PT-050B-LTLCardinality-08
FORMULA ShieldRVt-PT-050B-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ShieldRVt-PT-050B-LTLCardinality-14

BK_STOP 1717280450691

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name ShieldRVt-PT-050B-LTLCardinality-01
ltl formula formula --ltl=/tmp/2424/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1963 places, 1963 transitions and 4826 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.200 real 0.050 user 0.080 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2424/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2424/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2424/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2424/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 1964 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1964, there are 1982 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~2417 levels ~10000 states ~84728 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~2448!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 9816
pnml2lts-mc( 0/ 4): unique transitions count: 139532
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 4681
pnml2lts-mc( 0/ 4): - claim success count: 9824
pnml2lts-mc( 0/ 4): - cum. max stack depth: 9735
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 9824 states 139550 transitions, fanout: 14.205
pnml2lts-mc( 0/ 4): Total exploration time 1.460 sec (1.460 sec minimum, 1.460 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6729, Transitions per second: 95582
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 2.5MB, 19.3 B/state, compr.: 0.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/2.0%
pnml2lts-mc( 0/ 4): Stored 1994 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.5MB (~256.0MB paged-in)
ltl formula name ShieldRVt-PT-050B-LTLCardinality-08
ltl formula formula --ltl=/tmp/2424/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1963 places, 1963 transitions and 4826 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.210 real 0.070 user 0.070 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2424/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2424/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2424/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2424/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1965 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1964, there are 1972 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2339 levels ~10000 states ~83504 transitions
pnml2lts-mc( 3/ 4): ~4714 levels ~20000 states ~137704 transitions
pnml2lts-mc( 3/ 4): ~9335 levels ~40000 states ~238096 transitions
pnml2lts-mc( 3/ 4): ~18413 levels ~80000 states ~450116 transitions
pnml2lts-mc( 2/ 4): ~35520 levels ~160000 states ~918808 transitions
pnml2lts-mc( 3/ 4): ~74432 levels ~320000 states ~1876160 transitions
pnml2lts-mc( 3/ 4): ~149058 levels ~640000 states ~3782640 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 296
pnml2lts-mc( 0/ 4): unique states count: 1081166
pnml2lts-mc( 0/ 4): unique transitions count: 6973093
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 1072
pnml2lts-mc( 0/ 4): - claim found count: 2151642
pnml2lts-mc( 0/ 4): - claim success count: 1081178
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1008209
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1081180 states 6973123 transitions, fanout: 6.450
pnml2lts-mc( 0/ 4): Total exploration time 148.830 sec (148.820 sec minimum, 148.828 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7265, Transitions per second: 46853
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 97.6MB, 23.2 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 13.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1994 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 97.6MB (~256.0MB paged-in)
ltl formula name ShieldRVt-PT-050B-LTLCardinality-10
ltl formula formula --ltl=/tmp/2424/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1963 places, 1963 transitions and 4826 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.190 real 0.050 user 0.070 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2424/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2424/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2424/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2424/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 1964 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1964, there are 2030 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2413 levels ~10000 states ~150064 transitions
pnml2lts-mc( 0/ 4): ~4875 levels ~20000 states ~258824 transitions
pnml2lts-mc( 0/ 4): ~9872 levels ~40000 states ~498576 transitions
pnml2lts-mc( 0/ 4): ~19476 levels ~80000 states ~920800 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~28264!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1110
pnml2lts-mc( 0/ 4): unique states count: 125906
pnml2lts-mc( 0/ 4): unique transitions count: 1588940
pnml2lts-mc( 0/ 4): - self-loop count: 6
pnml2lts-mc( 0/ 4): - claim dead count: 8603
pnml2lts-mc( 0/ 4): - claim found count: 341042
pnml2lts-mc( 0/ 4): - claim success count: 125919
pnml2lts-mc( 0/ 4): - cum. max stack depth: 119337
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 125923 states 1588993 transitions, fanout: 12.619
pnml2lts-mc( 0/ 4): Total exploration time 15.000 sec (15.000 sec minimum, 15.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: 8395, Transitions per second: 105933
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 13.8MB, 24.6 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 1.0%/14.0%
pnml2lts-mc( 0/ 4): Stored 1994 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 13.8MB (~256.0MB paged-in)
ltl formula name ShieldRVt-PT-050B-LTLCardinality-14
ltl formula formula --ltl=/tmp/2424/ltl_3_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1963 places, 1963 transitions and 4826 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.190 real 0.080 user 0.060 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2424/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2424/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2424/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2424/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 1964 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1964, there are 1996 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~2279 levels ~10000 states ~89920 transitions
pnml2lts-mc( 2/ 4): ~4380 levels ~20000 states ~130716 transitions
pnml2lts-mc( 2/ 4): ~8429 levels ~40000 states ~218544 transitions
pnml2lts-mc( 2/ 4): ~16384 levels ~80000 states ~410912 transitions
pnml2lts-mc( 0/ 4): ~39592 levels ~160000 states ~959704 transitions
pnml2lts-mc( 0/ 4): ~79274 levels ~320000 states ~1848132 transitions
pnml2lts-mc( 0/ 4): ~158523 levels ~640000 states ~3660896 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 434
pnml2lts-mc( 0/ 4): unique states count: 1227833
pnml2lts-mc( 0/ 4): unique transitions count: 7107299
pnml2lts-mc( 0/ 4): - self-loop count: 2
pnml2lts-mc( 0/ 4): - claim dead count: 1428
pnml2lts-mc( 0/ 4): - claim found count: 2862977
pnml2lts-mc( 0/ 4): - claim success count: 1227847
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1064659
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1227851 states 7107344 transitions, fanout: 5.788
pnml2lts-mc( 0/ 4): Total exploration time 169.300 sec (169.260 sec minimum, 169.283 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7253, Transitions per second: 41981
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 91.6MB, 26.5 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 10.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 1994 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 91.6MB (~256.0MB paged-in)