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.r488-tall-171631132900540.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 DoubleExponent-PT-003, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132900540
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 03:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 200K Apr 12 03:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 12 03:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 50K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-003-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717193702172

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-003
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:15:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 22:15:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:15:03] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2024-05-31 22:15:03] [INFO ] Transformed 163 places.
[2024-05-31 22:15:03] [INFO ] Transformed 148 transitions.
[2024-05-31 22:15:03] [INFO ] Parsed PT model containing 163 places and 148 transitions and 417 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA DoubleExponent-PT-003-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 148/148 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 159 transition count 148
Applied a total of 4 rules in 26 ms. Remains 159 /163 variables (removed 4) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 159 cols
[2024-05-31 22:15:03] [INFO ] Computed 16 invariants in 9 ms
[2024-05-31 22:15:03] [INFO ] Implicit Places using invariants in 323 ms returned [26, 28]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 374 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 157/163 places, 148/148 transitions.
Applied a total of 0 rules in 8 ms. Remains 157 /157 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 429 ms. Remains : 157/163 places, 148/148 transitions.
Support contains 31 out of 157 places after structural reductions.
[2024-05-31 22:15:04] [INFO ] Flatten gal took : 37 ms
[2024-05-31 22:15:04] [INFO ] Flatten gal took : 14 ms
[2024-05-31 22:15:04] [INFO ] Input system was already deterministic with 148 transitions.
RANDOM walk for 40000 steps (1339 resets) in 1680 ms. (23 steps per ms) remains 17/20 properties
BEST_FIRST walk for 4000 steps (111 resets) in 97 ms. (40 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (107 resets) in 47 ms. (83 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (105 resets) in 82 ms. (48 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (107 resets) in 105 ms. (37 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (102 resets) in 22 ms. (173 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (116 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (114 resets) in 42 ms. (93 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (111 resets) in 39 ms. (100 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (148 resets) in 51 ms. (76 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (115 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (116 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (114 resets) in 22 ms. (173 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4000 steps (106 resets) in 22 ms. (173 steps per ms) remains 13/17 properties
BEST_FIRST walk for 4000 steps (119 resets) in 25 ms. (153 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000 steps (109 resets) in 24 ms. (160 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4000 steps (110 resets) in 21 ms. (181 steps per ms) remains 13/13 properties
// Phase 1: matrix 148 rows 157 cols
[2024-05-31 22:15:05] [INFO ] Computed 14 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 10/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 6/39 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 82/121 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 6/127 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 135/262 variables, 127/141 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/262 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 11 (OVERLAPS) 37/299 variables, 26/167 constraints. Problems are: Problem set: 1 solved, 12 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/299 variables, 0/167 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp11 is UNSAT
At refinement iteration 13 (OVERLAPS) 6/305 variables, 4/171 constraints. Problems are: Problem set: 3 solved, 10 unsolved
[2024-05-31 22:15:05] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 11 ms to minimize.
[2024-05-31 22:15:06] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/305 variables, 2/173 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/305 variables, 0/173 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 0/305 variables, 0/173 constraints. Problems are: Problem set: 3 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 173 constraints, problems are : Problem set: 3 solved, 10 unsolved in 1134 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 3 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 86/103 variables, 8/8 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 11/114 variables, 2/10 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 10/124 variables, 4/14 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 132/256 variables, 124/138 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 5/143 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 0/143 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 39/295 variables, 27/170 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/295 variables, 5/175 constraints. Problems are: Problem set: 3 solved, 10 unsolved
[2024-05-31 22:15:06] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/295 variables, 1/176 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/295 variables, 0/176 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 7/302 variables, 4/180 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/302 variables, 1/181 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/302 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 3/305 variables, 2/183 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/305 variables, 1/184 constraints. Problems are: Problem set: 3 solved, 10 unsolved
[2024-05-31 22:15:07] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/305 variables, 1/185 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/305 variables, 0/185 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 0/305 variables, 0/185 constraints. Problems are: Problem set: 3 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 305/305 variables, and 185 constraints, problems are : Problem set: 3 solved, 10 unsolved in 1528 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 10/13 constraints, Known Traps: 4/4 constraints]
After SMT, in 2698ms problems are : Problem set: 3 solved, 10 unsolved
Parikh walk visited 2 properties in 13835 ms.
Support contains 14 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 148/148 transitions.
Graph (complete) has 259 edges and 157 vertex of which 156 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 156 transition count 123
Reduce places removed 24 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 30 rules applied. Total rules applied 55 place count 132 transition count 117
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 61 place count 126 transition count 117
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 61 place count 126 transition count 112
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 71 place count 121 transition count 112
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 125 place count 94 transition count 85
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 133 place count 90 transition count 85
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 134 place count 90 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 135 place count 89 transition count 84
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 144 place count 89 transition count 75
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 153 place count 80 transition count 75
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 163 place count 80 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 164 place count 79 transition count 74
Applied a total of 164 rules in 51 ms. Remains 79 /157 variables (removed 78) and now considering 74/148 (removed 74) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 79/157 places, 74/148 transitions.
RANDOM walk for 40000 steps (3819 resets) in 786 ms. (50 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (2767 resets) in 216 ms. (184 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (2805 resets) in 173 ms. (229 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (2757 resets) in 184 ms. (216 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (2729 resets) in 177 ms. (224 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (2748 resets) in 159 ms. (250 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (2785 resets) in 157 ms. (253 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (2774 resets) in 97 ms. (408 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (2777 resets) in 72 ms. (547 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 1361630 steps, run timeout after 3001 ms. (steps per millisecond=453 ) properties seen :7 out of 8
Probabilistic random walk after 1361630 steps, saw 680838 distinct states, run finished after 3005 ms. (steps per millisecond=453 ) properties seen :7
// Phase 1: matrix 74 rows 79 cols
[2024-05-31 22:15:25] [INFO ] Computed 14 invariants in 3 ms
[2024-05-31 22:15:25] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/52 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:15:25] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/54 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 60/114 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/114 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 27/141 variables, 16/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/141 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/141 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/141 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/143 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/143 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 9/152 variables, 6/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/152 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/152 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/153 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/153 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/153 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 100 constraints, problems are : Problem set: 0 solved, 1 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 79/79 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/31 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/52 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/54 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 60/114 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 3/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/114 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 27/141 variables, 16/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/141 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/141 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/141 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:15:25] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/141 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/141 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/143 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/143 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 9/152 variables, 6/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/152 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/152 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 1/153 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:15:25] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/153 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/153 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/153 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 79/79 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 291ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 74/74 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 79 transition count 70
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 75 transition count 70
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 71 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 70 transition count 66
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 70 transition count 64
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 68 transition count 64
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 25 place count 68 transition count 64
Applied a total of 25 rules in 15 ms. Remains 68 /79 variables (removed 11) and now considering 64/74 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 68/79 places, 64/74 transitions.
RANDOM walk for 40000 steps (5450 resets) in 48 ms. (816 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3554 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1577885 steps, run timeout after 3001 ms. (steps per millisecond=525 ) properties seen :0 out of 1
Probabilistic random walk after 1577885 steps, saw 788998 distinct states, run finished after 3001 ms. (steps per millisecond=525 ) properties seen :0
// Phase 1: matrix 64 rows 68 cols
[2024-05-31 22:15:28] [INFO ] Computed 14 invariants in 6 ms
[2024-05-31 22:15:28] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/46 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:15:28] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/48 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 54/102 variables, 48/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 25/127 variables, 15/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/127 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/127 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/127 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/127 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/128 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/128 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/128 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/132 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/132 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/132 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 68/68 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/46 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/48 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 54/102 variables, 48/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 8/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 25/127 variables, 15/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/127 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/127 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/127 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/127 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/127 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/128 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/128 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/128 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 4/132 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/132 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/132 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 96 constraints, problems are : Problem set: 0 solved, 1 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 68/68 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 229ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 68/68 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 22:15:29] [INFO ] Invariant cache hit.
[2024-05-31 22:15:29] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-31 22:15:29] [INFO ] Invariant cache hit.
[2024-05-31 22:15:29] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-31 22:15:29] [INFO ] Implicit Places using invariants and state equation in 146 ms returned [36, 41, 59, 65]
[2024-05-31 22:15:29] [INFO ] Actually due to overlaps returned [41, 36]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 204 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 66/68 places, 64/64 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 66 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 65 transition count 63
Applied a total of 2 rules in 8 ms. Remains 65 /66 variables (removed 1) and now considering 63/64 (removed 1) transitions.
// Phase 1: matrix 63 rows 65 cols
[2024-05-31 22:15:29] [INFO ] Computed 12 invariants in 2 ms
[2024-05-31 22:15:29] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-31 22:15:29] [INFO ] Invariant cache hit.
[2024-05-31 22:15:29] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-31 22:15:29] [INFO ] Implicit Places using invariants and state equation in 130 ms returned [56, 62]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 194 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 63/68 places, 63/64 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 62
Applied a total of 2 rules in 6 ms. Remains 62 /63 variables (removed 1) and now considering 62/63 (removed 1) transitions.
// Phase 1: matrix 62 rows 62 cols
[2024-05-31 22:15:29] [INFO ] Computed 10 invariants in 1 ms
[2024-05-31 22:15:29] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-31 22:15:29] [INFO ] Invariant cache hit.
[2024-05-31 22:15:29] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-31 22:15:29] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 62/68 places, 62/64 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 563 ms. Remains : 62/68 places, 62/64 transitions.
RANDOM walk for 40000 steps (6225 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3812 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1452424 steps, run visited all 1 properties in 2651 ms. (steps per millisecond=547 )
Probabilistic random walk after 1452424 steps, saw 726256 distinct states, run finished after 2655 ms. (steps per millisecond=547 ) properties seen :1
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA DoubleExponent-PT-003-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 259 edges and 157 vertex of which 155 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 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)&&F(G(p1)))))'
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Graph (complete) has 259 edges and 157 vertex of which 156 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 155 transition count 110
Reduce places removed 36 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 119 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 118 transition count 109
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 75 place count 118 transition count 104
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 85 place count 113 transition count 104
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 145 place count 83 transition count 74
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 153 place count 79 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 78 transition count 73
Applied a total of 154 rules in 17 ms. Remains 78 /157 variables (removed 79) and now considering 73/148 (removed 75) transitions.
// Phase 1: matrix 73 rows 78 cols
[2024-05-31 22:15:32] [INFO ] Computed 14 invariants in 1 ms
[2024-05-31 22:15:32] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-31 22:15:32] [INFO ] Invariant cache hit.
[2024-05-31 22:15:32] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 22:15:32] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2024-05-31 22:15:32] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-31 22:15:32] [INFO ] Invariant cache hit.
[2024-05-31 22:15:32] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 73/150 variables, 77/91 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 1/151 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/151 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 96 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1380 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 78/78 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 73/150 variables, 77/91 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 69/164 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 1/151 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 3/168 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-31 22:15:37] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/151 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 12 (OVERLAPS) 0/151 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 169 constraints, problems are : Problem set: 0 solved, 72 unsolved in 4388 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 78/78 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 1/1 constraints]
After SMT, in 5801ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 5802ms
Starting structural reductions in SI_LTL mode, iteration 1 : 78/157 places, 73/148 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5980 ms. Remains : 78/157 places, 73/148 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-00
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-00 finished in 6266 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 147
Applied a total of 2 rules in 9 ms. Remains 156 /157 variables (removed 1) and now considering 147/148 (removed 1) transitions.
// Phase 1: matrix 147 rows 156 cols
[2024-05-31 22:15:38] [INFO ] Computed 14 invariants in 2 ms
[2024-05-31 22:15:39] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-31 22:15:39] [INFO ] Invariant cache hit.
[2024-05-31 22:15:39] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-05-31 22:15:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-31 22:15:40] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-05-31 22:15:40] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 147/303 variables, 156/172 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-31 22:15:42] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 2 ms to minimize.
[2024-05-31 22:15:42] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:15:42] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:15:42] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:15:43] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 3 ms to minimize.
[2024-05-31 22:15:43] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 2 ms to minimize.
[2024-05-31 22:15:43] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 7/179 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-31 22:15:43] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:15:43] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-31 22:15:45] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (OVERLAPS) 0/303 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 182 constraints, problems are : Problem set: 0 solved, 146 unsolved in 9330 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 147/303 variables, 156/182 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 146/328 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-31 22:15:50] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 0/303 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 329 constraints, problems are : Problem set: 0 solved, 146 unsolved in 11254 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 13/13 constraints]
After SMT, in 20609ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 20613ms
Starting structural reductions in LTL mode, iteration 1 : 156/157 places, 147/148 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20888 ms. Remains : 156/157 places, 147/148 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-01
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-01 finished in 21002 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Support contains 1 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Graph (complete) has 259 edges and 157 vertex of which 156 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 155 transition count 108
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 117 transition count 108
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 77 place count 117 transition count 103
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 87 place count 112 transition count 103
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 147 place count 82 transition count 73
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 155 place count 78 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 156 place count 77 transition count 72
Applied a total of 156 rules in 24 ms. Remains 77 /157 variables (removed 80) and now considering 72/148 (removed 76) transitions.
// Phase 1: matrix 72 rows 77 cols
[2024-05-31 22:15:59] [INFO ] Computed 14 invariants in 3 ms
[2024-05-31 22:15:59] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-31 22:15:59] [INFO ] Invariant cache hit.
[2024-05-31 22:16:00] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 22:16:00] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-05-31 22:16:00] [INFO ] Redundant transitions in 1 ms returned []
Running 71 sub problems to find dead transitions.
[2024-05-31 22:16:00] [INFO ] Invariant cache hit.
[2024-05-31 22:16:00] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (OVERLAPS) 72/148 variables, 76/90 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 1/149 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-05-31 22:16:00] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:16:00] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-05-31 22:16:01] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-31 22:16:01] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 0/149 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 99 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1968 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 77/77 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (OVERLAPS) 72/148 variables, 76/90 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 68/162 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 1/149 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 4/170 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 11 (OVERLAPS) 0/149 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 170 constraints, problems are : Problem set: 0 solved, 71 unsolved in 2993 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 77/77 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 4/4 constraints]
After SMT, in 4976ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 4977ms
Starting structural reductions in SI_LTL mode, iteration 1 : 77/157 places, 72/148 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5155 ms. Remains : 77/157 places, 72/148 transitions.
Stuttering acceptance computed with spot in 134 ms :[p0, p0]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-02
Product exploration explored 100000 steps with 13854 reset in 196 ms.
Product exploration explored 100000 steps with 13835 reset in 136 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 227 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 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 72 ms :[p0, p0]
RANDOM walk for 33903 steps (4697 resets) in 213 ms. (158 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 82 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 82 ms :[p0, p0]
Stuttering acceptance computed with spot in 75 ms :[p0, p0]
Support contains 1 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 72/72 transitions.
Applied a total of 0 rules in 5 ms. Remains 77 /77 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2024-05-31 22:16:06] [INFO ] Invariant cache hit.
[2024-05-31 22:16:06] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-31 22:16:06] [INFO ] Invariant cache hit.
[2024-05-31 22:16:06] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 22:16:06] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-05-31 22:16:06] [INFO ] Redundant transitions in 1 ms returned []
Running 71 sub problems to find dead transitions.
[2024-05-31 22:16:06] [INFO ] Invariant cache hit.
[2024-05-31 22:16:06] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (OVERLAPS) 72/148 variables, 76/90 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 1/149 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-05-31 22:16:07] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:16:07] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-05-31 22:16:07] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:16:07] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 0/149 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 99 constraints, problems are : Problem set: 0 solved, 71 unsolved in 2053 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 77/77 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (OVERLAPS) 72/148 variables, 76/90 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 68/162 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 1/149 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 4/170 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 11 (OVERLAPS) 0/149 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 170 constraints, problems are : Problem set: 0 solved, 71 unsolved in 2986 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 77/77 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 4/4 constraints]
After SMT, in 5060ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 5064ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5245 ms. Remains : 77/77 places, 72/72 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 227 edges and 77 vertex of which 76 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[p0, p0]
RANDOM walk for 31644 steps (4426 resets) in 44 ms. (703 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[p0, p0]
Stuttering acceptance computed with spot in 67 ms :[p0, p0]
Stuttering acceptance computed with spot in 75 ms :[p0, p0]
Product exploration explored 100000 steps with 13925 reset in 147 ms.
Product exploration explored 100000 steps with 13843 reset in 124 ms.
Support contains 1 out of 77 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 77/77 places, 72/72 transitions.
Applied a total of 0 rules in 10 ms. Remains 77 /77 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2024-05-31 22:16:12] [INFO ] Invariant cache hit.
[2024-05-31 22:16:12] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-31 22:16:12] [INFO ] Invariant cache hit.
[2024-05-31 22:16:12] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 22:16:12] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2024-05-31 22:16:12] [INFO ] Redundant transitions in 1 ms returned []
Running 71 sub problems to find dead transitions.
[2024-05-31 22:16:12] [INFO ] Invariant cache hit.
[2024-05-31 22:16:12] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (OVERLAPS) 72/148 variables, 76/90 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 1/149 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-05-31 22:16:13] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:16:13] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-05-31 22:16:13] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-31 22:16:13] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 0/149 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 149/149 variables, and 99 constraints, problems are : Problem set: 0 solved, 71 unsolved in 2019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 77/77 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (OVERLAPS) 72/148 variables, 76/90 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 68/162 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 1/149 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 3/166 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 4/170 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 11 (OVERLAPS) 0/149 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 149/149 variables, and 170 constraints, problems are : Problem set: 0 solved, 71 unsolved in 2991 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 77/77 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 4/4 constraints]
After SMT, in 5028ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 5030ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5201 ms. Remains : 77/77 places, 72/72 transitions.
Treatment of property DoubleExponent-PT-003-LTLFireability-02 finished in 17452 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)))'
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 147
Applied a total of 2 rules in 3 ms. Remains 156 /157 variables (removed 1) and now considering 147/148 (removed 1) transitions.
// Phase 1: matrix 147 rows 156 cols
[2024-05-31 22:16:17] [INFO ] Computed 14 invariants in 3 ms
[2024-05-31 22:16:17] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-31 22:16:17] [INFO ] Invariant cache hit.
[2024-05-31 22:16:17] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-05-31 22:16:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-31 22:16:19] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-31 22:16:19] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 147/303 variables, 156/172 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-31 22:16:20] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:16:21] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:16:21] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 2 ms to minimize.
[2024-05-31 22:16:21] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
[2024-05-31 22:16:21] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2024-05-31 22:16:21] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:16:21] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 7/179 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-31 22:16:22] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:16:22] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-31 22:16:23] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (OVERLAPS) 0/303 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 182 constraints, problems are : Problem set: 0 solved, 146 unsolved in 9163 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 147/303 variables, 156/182 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 146/328 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-31 22:16:29] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 0/303 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 329 constraints, problems are : Problem set: 0 solved, 146 unsolved in 11669 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 13/13 constraints]
After SMT, in 20867ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 20870ms
Starting structural reductions in LTL mode, iteration 1 : 156/157 places, 147/148 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21095 ms. Remains : 156/157 places, 147/148 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-04 finished in 21221 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((F((G(p0)||G(!p0))) U p1))))'
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Graph (complete) has 259 edges and 157 vertex of which 156 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 155 transition count 108
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 117 transition count 108
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 77 place count 117 transition count 103
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 87 place count 112 transition count 103
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 145 place count 83 transition count 74
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 153 place count 79 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 78 transition count 73
Applied a total of 154 rules in 18 ms. Remains 78 /157 variables (removed 79) and now considering 73/148 (removed 75) transitions.
// Phase 1: matrix 73 rows 78 cols
[2024-05-31 22:16:38] [INFO ] Computed 14 invariants in 2 ms
[2024-05-31 22:16:38] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-31 22:16:38] [INFO ] Invariant cache hit.
[2024-05-31 22:16:38] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 22:16:38] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2024-05-31 22:16:38] [INFO ] Redundant transitions in 3 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-31 22:16:38] [INFO ] Invariant cache hit.
[2024-05-31 22:16:38] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 1/78 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 73/151 variables, 78/92 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/151 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 96 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1101 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 78/78 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 1/78 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 73/151 variables, 78/92 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 72/168 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-31 22:16:40] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/151 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 169 constraints, problems are : Problem set: 0 solved, 72 unsolved in 2264 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 78/78 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 1/1 constraints]
After SMT, in 3379ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3380ms
Starting structural reductions in SI_LTL mode, iteration 1 : 78/157 places, 73/148 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3575 ms. Remains : 78/157 places, 73/148 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), false, (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-07
Stuttering criterion allowed to conclude after 3121 steps with 301 reset in 17 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-07 finished in 3722 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U p1))'
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Graph (complete) has 259 edges and 157 vertex of which 156 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 155 transition count 108
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 117 transition count 108
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 77 place count 117 transition count 104
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 85 place count 113 transition count 104
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 145 place count 83 transition count 74
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 151 place count 80 transition count 74
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 152 place count 80 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 79 transition count 73
Applied a total of 153 rules in 12 ms. Remains 79 /157 variables (removed 78) and now considering 73/148 (removed 75) transitions.
// Phase 1: matrix 73 rows 79 cols
[2024-05-31 22:16:42] [INFO ] Computed 14 invariants in 1 ms
[2024-05-31 22:16:42] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-31 22:16:42] [INFO ] Invariant cache hit.
[2024-05-31 22:16:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 22:16:42] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-05-31 22:16:42] [INFO ] Redundant transitions in 1 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-31 22:16:42] [INFO ] Invariant cache hit.
[2024-05-31 22:16:42] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 73/151 variables, 78/92 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 1/152 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-31 22:16:43] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/152 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/152 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 98 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1742 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 79/79 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (OVERLAPS) 73/151 variables, 78/92 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 69/165 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 1/152 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-31 22:16:46] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 12 (OVERLAPS) 0/152 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 171 constraints, problems are : Problem set: 0 solved, 72 unsolved in 3941 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 79/79 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 2/2 constraints]
After SMT, in 5696ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 5697ms
Starting structural reductions in SI_LTL mode, iteration 1 : 79/157 places, 73/148 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5849 ms. Remains : 79/157 places, 73/148 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-09
Entered a terminal (fully accepting) state of product in 113 steps with 15 reset in 1 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-09 finished in 5967 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(p1)&&p0)))'
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 147
Applied a total of 2 rules in 7 ms. Remains 156 /157 variables (removed 1) and now considering 147/148 (removed 1) transitions.
// Phase 1: matrix 147 rows 156 cols
[2024-05-31 22:16:48] [INFO ] Computed 14 invariants in 2 ms
[2024-05-31 22:16:48] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-31 22:16:48] [INFO ] Invariant cache hit.
[2024-05-31 22:16:48] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-05-31 22:16:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-31 22:16:50] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 2 ms to minimize.
[2024-05-31 22:16:50] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 147/303 variables, 156/172 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-31 22:16:51] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:16:52] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:16:52] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:16:52] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:16:52] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:16:52] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:16:52] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 7/179 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-31 22:16:53] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 0 ms to minimize.
[2024-05-31 22:16:53] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-31 22:16:54] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (OVERLAPS) 0/303 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 182 constraints, problems are : Problem set: 0 solved, 146 unsolved in 9221 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 147/303 variables, 156/182 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 146/328 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-31 22:17:00] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 0/303 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 329 constraints, problems are : Problem set: 0 solved, 146 unsolved in 11157 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 13/13 constraints]
After SMT, in 20396ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 20398ms
Starting structural reductions in LTL mode, iteration 1 : 156/157 places, 147/148 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20634 ms. Remains : 156/157 places, 147/148 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-11 finished in 20822 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' '!((((p0&&G(p1)) U p2)&&X(X(G(!p2)))))'
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 157 cols
[2024-05-31 22:17:09] [INFO ] Computed 14 invariants in 2 ms
[2024-05-31 22:17:09] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-31 22:17:09] [INFO ] Invariant cache hit.
[2024-05-31 22:17:09] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2024-05-31 22:17:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-31 22:17:10] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-31 22:17:10] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 148/305 variables, 157/173 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-31 22:17:12] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 3 ms to minimize.
[2024-05-31 22:17:12] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:17:12] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:17:12] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:17:13] [INFO ] Deduced a trap composed of 35 places in 71 ms of which 0 ms to minimize.
[2024-05-31 22:17:13] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 0 ms to minimize.
[2024-05-31 22:17:13] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 7/180 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-31 22:17:13] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 10 (OVERLAPS) 0/305 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 305/305 variables, and 181 constraints, problems are : Problem set: 0 solved, 147 unsolved in 8052 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 1/157 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 148/305 variables, 157/181 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 147/328 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-31 22:17:19] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:17:20] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 2/330 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 10 (OVERLAPS) 0/305 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 305/305 variables, and 330 constraints, problems are : Problem set: 0 solved, 147 unsolved in 10763 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 12/12 constraints]
After SMT, in 18838ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 18842ms
Finished structural reductions in LTL mode , in 1 iterations and 19063 ms. Remains : 157/157 places, 148/148 transitions.
Stuttering acceptance computed with spot in 318 ms :[p2, true, true, (OR (NOT p1) p2), p2, true]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLFireability-13 finished in 19400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 147
Applied a total of 2 rules in 5 ms. Remains 156 /157 variables (removed 1) and now considering 147/148 (removed 1) transitions.
// Phase 1: matrix 147 rows 156 cols
[2024-05-31 22:17:28] [INFO ] Computed 14 invariants in 3 ms
[2024-05-31 22:17:28] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-31 22:17:28] [INFO ] Invariant cache hit.
[2024-05-31 22:17:28] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-05-31 22:17:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-31 22:17:30] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-31 22:17:30] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 147/303 variables, 156/172 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-31 22:17:31] [INFO ] Deduced a trap composed of 43 places in 41 ms of which 0 ms to minimize.
[2024-05-31 22:17:32] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:17:32] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 2 ms to minimize.
[2024-05-31 22:17:32] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:17:32] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 0 ms to minimize.
[2024-05-31 22:17:32] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:17:33] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 7/179 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-31 22:17:33] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:17:33] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-31 22:17:34] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (OVERLAPS) 0/303 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 182 constraints, problems are : Problem set: 0 solved, 146 unsolved in 9218 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 147/303 variables, 156/182 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 146/328 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-31 22:17:40] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 0/303 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 329 constraints, problems are : Problem set: 0 solved, 146 unsolved in 11133 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 13/13 constraints]
After SMT, in 20367ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 20373ms
Starting structural reductions in LTL mode, iteration 1 : 156/157 places, 147/148 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20602 ms. Remains : 156/157 places, 147/148 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-14
Product exploration explored 100000 steps with 25000 reset in 149 ms.
Product exploration explored 100000 steps with 25000 reset in 108 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 111 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1342 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (1122 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
Probably explored full state space saw : 413268 states, properties seen :0
Probabilistic random walk after 826575 steps, saw 413268 distinct states, run finished after 2076 ms. (steps per millisecond=398 ) properties seen :0
Interrupted probabilistic random walk after 918043 steps, run timeout after 3001 ms. (steps per millisecond=305 ) properties seen :0 out of 1
Exhaustive walk after 918043 steps, saw 459103 distinct states, run finished after 3005 ms. (steps per millisecond=305 ) properties seen :0
[2024-05-31 22:17:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/45 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 61/106 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/117 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/121 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 128/249 variables, 121/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 40/289 variables, 27/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/297 variables, 4/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/297 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/302 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/302 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/303 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/303 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/303 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 170 constraints, problems are : Problem set: 0 solved, 1 unsolved in 257 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 156/156 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, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 61/106 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/117 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:17:55] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/121 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:17:55] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 128/249 variables, 121/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 40/289 variables, 27/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/289 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/289 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/297 variables, 4/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/297 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/302 variables, 3/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:17:55] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/302 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/302 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/303 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:17:55] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/303 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/303 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/303 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 175 constraints, problems are : Problem set: 0 solved, 1 unsolved in 399 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 673ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 121 ms.
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 155 transition count 109
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 118 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 117 transition count 108
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 77 place count 117 transition count 102
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 89 place count 111 transition count 102
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 149 place count 81 transition count 72
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 157 place count 77 transition count 72
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 164 place count 77 transition count 65
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 171 place count 70 transition count 65
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 183 place count 70 transition count 65
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 184 place count 69 transition count 64
Applied a total of 184 rules in 46 ms. Remains 69 /156 variables (removed 87) and now considering 64/147 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 69/156 places, 64/147 transitions.
RANDOM walk for 40000 steps (5153 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3380 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
Probably explored full state space saw : 584830 states, properties seen :0
Probabilistic random walk after 1169680 steps, saw 584830 distinct states, run finished after 2461 ms. (steps per millisecond=475 ) properties seen :0
Interrupted probabilistic random walk after 1542988 steps, run timeout after 3001 ms. (steps per millisecond=514 ) properties seen :0 out of 1
Exhaustive walk after 1542988 steps, saw 771580 distinct states, run finished after 3001 ms. (steps per millisecond=514 ) properties seen :0
// Phase 1: matrix 64 rows 69 cols
[2024-05-31 22:18:01] [INFO ] Computed 14 invariants in 1 ms
[2024-05-31 22:18:01] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/48 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/102 variables, 48/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/128 variables, 16/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/128 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/129 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/129 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/129 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/133 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/133 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/133 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 93 constraints, problems are : Problem set: 0 solved, 1 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 69/69 constraints, ReadFeed: 10/10 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) 21/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/48 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/102 variables, 48/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/128 variables, 16/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/128 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/128 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/129 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/129 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/129 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/133 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/133 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/133 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 94 constraints, problems are : Problem set: 0 solved, 1 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 69/69 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 292ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 64/64 transitions.
Applied a total of 0 rules in 12 ms. Remains 69 /69 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 69/69 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 69 /69 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 22:18:01] [INFO ] Invariant cache hit.
[2024-05-31 22:18:03] [INFO ] Implicit Places using invariants in 1580 ms returned []
[2024-05-31 22:18:03] [INFO ] Invariant cache hit.
[2024-05-31 22:18:03] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 22:18:03] [INFO ] Implicit Places using invariants and state equation in 116 ms returned [37, 42, 60, 66]
[2024-05-31 22:18:03] [INFO ] Actually due to overlaps returned [42, 37]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1717 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 67/69 places, 64/64 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 63
Applied a total of 2 rules in 3 ms. Remains 66 /67 variables (removed 1) and now considering 63/64 (removed 1) transitions.
// Phase 1: matrix 63 rows 66 cols
[2024-05-31 22:18:03] [INFO ] Computed 12 invariants in 1 ms
[2024-05-31 22:18:03] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-31 22:18:03] [INFO ] Invariant cache hit.
[2024-05-31 22:18:03] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 22:18:03] [INFO ] Implicit Places using invariants and state equation in 100 ms returned [57, 63]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 175 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 64/69 places, 63/64 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 64 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 62
Applied a total of 2 rules in 3 ms. Remains 63 /64 variables (removed 1) and now considering 62/63 (removed 1) transitions.
// Phase 1: matrix 62 rows 63 cols
[2024-05-31 22:18:03] [INFO ] Computed 10 invariants in 2 ms
[2024-05-31 22:18:03] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-31 22:18:03] [INFO ] Invariant cache hit.
[2024-05-31 22:18:03] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 22:18:04] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 63/69 places, 62/64 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2277 ms. Remains : 63/69 places, 62/64 transitions.
RANDOM walk for 40000 steps (5779 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3667 resets) in 275 ms. (144 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1321809 steps, run timeout after 3001 ms. (steps per millisecond=440 ) properties seen :0 out of 1
Probabilistic random walk after 1321809 steps, saw 660907 distinct states, run finished after 3001 ms. (steps per millisecond=440 ) properties seen :0
[2024-05-31 22:18:07] [INFO ] Invariant cache hit.
[2024-05-31 22:18:07] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/42 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:18:07] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 52/94 variables, 42/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 26/120 variables, 16/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/120 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/120 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/120 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/121 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/121 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/121 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/125 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/125 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/125 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 84 constraints, problems are : Problem set: 0 solved, 1 unsolved in 111 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/42 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 52/94 variables, 42/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 26/120 variables, 16/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/120 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/120 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/120 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/120 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/120 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/121 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/121 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/121 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/125 variables, 4/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/125 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/125 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 85 constraints, problems are : Problem set: 0 solved, 1 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 206ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 63 /63 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 63/63 places, 62/62 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 62/62 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2024-05-31 22:18:07] [INFO ] Invariant cache hit.
[2024-05-31 22:18:07] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-31 22:18:07] [INFO ] Invariant cache hit.
[2024-05-31 22:18:07] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 22:18:07] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-05-31 22:18:07] [INFO ] Redundant transitions in 1 ms returned []
Running 61 sub problems to find dead transitions.
[2024-05-31 22:18:07] [INFO ] Invariant cache hit.
[2024-05-31 22:18:07] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 62/124 variables, 62/72 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 1/125 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 83 constraints, problems are : Problem set: 0 solved, 61 unsolved in 941 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 62/124 variables, 62/72 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 10/82 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 61/143 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 1/125 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-31 22:18:09] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/125 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 145 constraints, problems are : Problem set: 0 solved, 61 unsolved in 2699 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 63/63 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 1/1 constraints]
After SMT, in 3693ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 3695ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3888 ms. Remains : 63/63 places, 62/62 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 63 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 62 transition count 61
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 62 transition count 57
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 58 transition count 57
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 56 transition count 55
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 56 transition count 55
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 16 place count 55 transition count 54
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 55 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 54 transition count 53
Applied a total of 18 rules in 13 ms. Remains 54 /63 variables (removed 9) and now considering 53/62 (removed 9) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 53 rows 54 cols
[2024-05-31 22:18:11] [INFO ] Computed 10 invariants in 1 ms
[2024-05-31 22:18:11] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-31 22:18:11] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 1 ms returned sat
[2024-05-31 22:18:11] [INFO ] After 21ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-31 22:18:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 22:18:11] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:18:11] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 22:18:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-31 22:18:11] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-31 22:18:11] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-31 22:18:11] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 22:18:11] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 22:18:11] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 190 ms.
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 62 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Applied a total of 0 rules in 2 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 156 cols
[2024-05-31 22:18:11] [INFO ] Computed 14 invariants in 2 ms
[2024-05-31 22:18:11] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-31 22:18:11] [INFO ] Invariant cache hit.
[2024-05-31 22:18:11] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-05-31 22:18:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-31 22:18:14] [INFO ] Deduced a trap composed of 7 places in 374 ms of which 10 ms to minimize.
[2024-05-31 22:18:14] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 147/303 variables, 156/172 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-31 22:18:16] [INFO ] Deduced a trap composed of 43 places in 47 ms of which 1 ms to minimize.
[2024-05-31 22:18:16] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:18:16] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:18:16] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:18:16] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-05-31 22:18:17] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:18:17] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 7/179 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-31 22:18:17] [INFO ] Deduced a trap composed of 37 places in 27 ms of which 1 ms to minimize.
[2024-05-31 22:18:17] [INFO ] Deduced a trap composed of 43 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-31 22:18:19] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (OVERLAPS) 0/303 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 182 constraints, problems are : Problem set: 0 solved, 146 unsolved in 10134 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 147/303 variables, 156/182 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 146/328 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-31 22:18:24] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 0/303 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 329 constraints, problems are : Problem set: 0 solved, 146 unsolved in 11313 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 13/13 constraints]
After SMT, in 21480ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 21483ms
Finished structural reductions in LTL mode , in 1 iterations and 21711 ms. Remains : 156/156 places, 147/147 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 79 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (1340 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1127 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Probably explored full state space saw : 413268 states, properties seen :0
Probabilistic random walk after 826575 steps, saw 413268 distinct states, run finished after 2078 ms. (steps per millisecond=397 ) properties seen :0
Interrupted probabilistic random walk after 1234143 steps, run timeout after 3001 ms. (steps per millisecond=411 ) properties seen :0 out of 1
Exhaustive walk after 1234143 steps, saw 617095 distinct states, run finished after 3001 ms. (steps per millisecond=411 ) properties seen :0
[2024-05-31 22:18:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/45 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 61/106 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/117 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/121 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 128/249 variables, 121/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 40/289 variables, 27/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/297 variables, 4/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/297 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 5/302 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/302 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/303 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/303 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/303 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 170 constraints, problems are : Problem set: 0 solved, 1 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 156/156 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, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 61/106 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/117 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:18:39] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/121 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:18:39] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 128/249 variables, 121/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/249 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 40/289 variables, 27/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/289 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/289 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/297 variables, 4/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/297 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/302 variables, 3/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:18:39] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/302 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/302 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/303 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:18:39] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/303 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/303 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/303 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 175 constraints, problems are : Problem set: 0 solved, 1 unsolved in 366 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 561ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 73 ms.
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 155 transition count 109
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 76 place count 118 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 117 transition count 108
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 77 place count 117 transition count 102
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 89 place count 111 transition count 102
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 149 place count 81 transition count 72
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 157 place count 77 transition count 72
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 164 place count 77 transition count 65
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 171 place count 70 transition count 65
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 183 place count 70 transition count 65
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 184 place count 69 transition count 64
Applied a total of 184 rules in 17 ms. Remains 69 /156 variables (removed 87) and now considering 64/147 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 69/156 places, 64/147 transitions.
RANDOM walk for 40000 steps (5131 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3366 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Probably explored full state space saw : 584830 states, properties seen :0
Probabilistic random walk after 1169680 steps, saw 584830 distinct states, run finished after 2408 ms. (steps per millisecond=485 ) properties seen :0
Interrupted probabilistic random walk after 1441084 steps, run timeout after 3001 ms. (steps per millisecond=480 ) properties seen :0 out of 1
Exhaustive walk after 1441084 steps, saw 720596 distinct states, run finished after 3001 ms. (steps per millisecond=480 ) properties seen :0
// Phase 1: matrix 64 rows 69 cols
[2024-05-31 22:18:44] [INFO ] Computed 14 invariants in 1 ms
[2024-05-31 22:18:44] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/48 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/102 variables, 48/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/128 variables, 16/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/128 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/129 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/129 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/129 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/133 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/133 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/133 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 93 constraints, problems are : Problem set: 0 solved, 1 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 69/69 constraints, ReadFeed: 10/10 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) 21/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 25/48 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/102 variables, 48/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 6/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/128 variables, 16/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/128 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/128 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/129 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/129 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/129 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/133 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/133 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/133 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 94 constraints, problems are : Problem set: 0 solved, 1 unsolved in 88 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 69/69 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 189ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 69/69 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 69 /69 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 22:18:45] [INFO ] Invariant cache hit.
[2024-05-31 22:18:45] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-31 22:18:45] [INFO ] Invariant cache hit.
[2024-05-31 22:18:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 22:18:45] [INFO ] Implicit Places using invariants and state equation in 130 ms returned [37, 42, 60, 66]
[2024-05-31 22:18:45] [INFO ] Actually due to overlaps returned [42, 37]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 219 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 67/69 places, 64/64 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 63
Applied a total of 2 rules in 3 ms. Remains 66 /67 variables (removed 1) and now considering 63/64 (removed 1) transitions.
// Phase 1: matrix 63 rows 66 cols
[2024-05-31 22:18:45] [INFO ] Computed 12 invariants in 1 ms
[2024-05-31 22:18:45] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-31 22:18:45] [INFO ] Invariant cache hit.
[2024-05-31 22:18:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 22:18:45] [INFO ] Implicit Places using invariants and state equation in 112 ms returned [57, 63]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 183 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 64/69 places, 63/64 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 64 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 62
Applied a total of 2 rules in 4 ms. Remains 63 /64 variables (removed 1) and now considering 62/63 (removed 1) transitions.
// Phase 1: matrix 62 rows 63 cols
[2024-05-31 22:18:45] [INFO ] Computed 10 invariants in 1 ms
[2024-05-31 22:18:45] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-31 22:18:45] [INFO ] Invariant cache hit.
[2024-05-31 22:18:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 22:18:45] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 63/69 places, 62/64 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 581 ms. Remains : 63/69 places, 62/64 transitions.
RANDOM walk for 40000 steps (5785 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3648 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1449432 steps, run visited all 1 properties in 2874 ms. (steps per millisecond=504 )
Probabilistic random walk after 1449432 steps, saw 724763 distinct states, run finished after 2874 ms. (steps per millisecond=504 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 82 ms.
Product exploration explored 100000 steps with 25000 reset in 207 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Graph (complete) has 258 edges and 156 vertex of which 155 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 155 transition count 146
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 36 place count 155 transition count 151
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 44 place count 155 transition count 151
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 151 transition count 147
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 151 transition count 147
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 1 with 29 rules applied. Total rules applied 81 place count 151 transition count 152
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 150 transition count 151
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 150 transition count 151
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 73 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 89 place count 150 transition count 182
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 96 place count 143 transition count 168
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 103 place count 143 transition count 168
Deduced a syphon composed of 66 places in 0 ms
Applied a total of 103 rules in 39 ms. Remains 143 /156 variables (removed 13) and now considering 168/147 (removed -21) transitions.
[2024-05-31 22:18:49] [INFO ] Redundant transitions in 4 ms returned []
Running 167 sub problems to find dead transitions.
// Phase 1: matrix 168 rows 143 cols
[2024-05-31 22:18:49] [INFO ] Computed 14 invariants in 1 ms
[2024-05-31 22:18:49] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-31 22:18:51] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-31 22:18:51] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
Problem TDEAD96 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 2/16 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 166 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
At refinement iteration 6 (OVERLAPS) 168/311 variables, 143/159 constraints. Problems are: Problem set: 96 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/311 variables, 6/165 constraints. Problems are: Problem set: 96 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/311 variables, 0/165 constraints. Problems are: Problem set: 96 solved, 71 unsolved
At refinement iteration 9 (OVERLAPS) 0/311 variables, 0/165 constraints. Problems are: Problem set: 96 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 311/311 variables, and 165 constraints, problems are : Problem set: 96 solved, 71 unsolved in 4095 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 143/143 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 96 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 96 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 13/89 variables, 2/2 constraints. Problems are: Problem set: 96 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 2/4 constraints. Problems are: Problem set: 96 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/4 constraints. Problems are: Problem set: 96 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 39/128 variables, 12/16 constraints. Problems are: Problem set: 96 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/16 constraints. Problems are: Problem set: 96 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 168/296 variables, 128/144 constraints. Problems are: Problem set: 96 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 6/150 constraints. Problems are: Problem set: 96 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 71/221 constraints. Problems are: Problem set: 96 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 0/221 constraints. Problems are: Problem set: 96 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 15/311 variables, 15/236 constraints. Problems are: Problem set: 96 solved, 71 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/311 variables, 0/236 constraints. Problems are: Problem set: 96 solved, 71 unsolved
At refinement iteration 12 (OVERLAPS) 0/311 variables, 0/236 constraints. Problems are: Problem set: 96 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 311/311 variables, and 236 constraints, problems are : Problem set: 96 solved, 71 unsolved in 4015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 143/143 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 71/167 constraints, Known Traps: 2/2 constraints]
After SMT, in 8193ms problems are : Problem set: 96 solved, 71 unsolved
Search for dead transitions found 96 dead transitions in 8195ms
Found 96 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 96 transitions
Dead transitions reduction (with SMT) removed 96 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 143/156 places, 72/147 transitions.
Graph (complete) has 234 edges and 143 vertex of which 77 are kept as prefixes of interest. Removing 66 places using SCC suffix rule.0 ms
Discarding 66 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 77 /143 variables (removed 66) and now considering 72/72 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/156 places, 72/147 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8259 ms. Remains : 77/156 places, 72/147 transitions.
Support contains 2 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 147/147 transitions.
Applied a total of 0 rules in 1 ms. Remains 156 /156 variables (removed 0) and now considering 147/147 (removed 0) transitions.
// Phase 1: matrix 147 rows 156 cols
[2024-05-31 22:18:58] [INFO ] Computed 14 invariants in 1 ms
[2024-05-31 22:18:58] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-31 22:18:58] [INFO ] Invariant cache hit.
[2024-05-31 22:18:58] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-05-31 22:18:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-31 22:19:00] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-31 22:19:00] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 147/303 variables, 156/172 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-31 22:19:01] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:19:02] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:19:02] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:19:02] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:19:02] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:19:02] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:19:02] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 7/179 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-31 22:19:03] [INFO ] Deduced a trap composed of 37 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:19:03] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-31 22:19:04] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/303 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (OVERLAPS) 0/303 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 182 constraints, problems are : Problem set: 0 solved, 146 unsolved in 9508 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/155 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 1/156 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 147/303 variables, 156/182 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 146/328 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-31 22:19:10] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 0/303 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 329 constraints, problems are : Problem set: 0 solved, 146 unsolved in 11253 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 13/13 constraints]
After SMT, in 20791ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 20794ms
Finished structural reductions in LTL mode , in 1 iterations and 21159 ms. Remains : 156/156 places, 147/147 transitions.
Treatment of property DoubleExponent-PT-003-LTLFireability-14 finished in 110790 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)&&F(G(p1)))))'
Support contains 5 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Graph (complete) has 259 edges and 157 vertex of which 156 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 155 transition count 116
Reduce places removed 30 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 33 rules applied. Total rules applied 64 place count 125 transition count 113
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 67 place count 122 transition count 113
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 67 place count 122 transition count 108
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 77 place count 117 transition count 108
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 137 place count 87 transition count 78
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 145 place count 83 transition count 78
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 146 place count 82 transition count 77
Applied a total of 146 rules in 12 ms. Remains 82 /157 variables (removed 75) and now considering 77/148 (removed 71) transitions.
// Phase 1: matrix 77 rows 82 cols
[2024-05-31 22:19:19] [INFO ] Computed 14 invariants in 0 ms
[2024-05-31 22:19:19] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-31 22:19:19] [INFO ] Invariant cache hit.
[2024-05-31 22:19:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:19:19] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2024-05-31 22:19:19] [INFO ] Redundant transitions in 0 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-31 22:19:19] [INFO ] Invariant cache hit.
[2024-05-31 22:19:19] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 77/158 variables, 81/95 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 1/159 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:19:20] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:19:21] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:19:21] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:19:21] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (OVERLAPS) 0/159 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 102 constraints, problems are : Problem set: 0 solved, 76 unsolved in 3081 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 82/82 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/158 variables, 81/97 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 73/172 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 1/159 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 3/176 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:19:24] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/159 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 13 (OVERLAPS) 0/159 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 179 constraints, problems are : Problem set: 0 solved, 76 unsolved in 4121 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 82/82 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 5/5 constraints]
After SMT, in 7266ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 7267ms
Starting structural reductions in SI_LTL mode, iteration 1 : 82/157 places, 77/148 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7585 ms. Remains : 82/157 places, 77/148 transitions.
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-15
Product exploration explored 100000 steps with 11428 reset in 91 ms.
Product exploration explored 100000 steps with 11471 reset in 95 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 229 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 71 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (4524 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (2853 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (2867 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 5718 steps, run visited all 2 properties in 19 ms. (steps per millisecond=300 )
Probabilistic random walk after 5718 steps, saw 2889 distinct states, run finished after 19 ms. (steps per millisecond=300 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 137 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 5 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 77/77 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2024-05-31 22:19:27] [INFO ] Invariant cache hit.
[2024-05-31 22:19:28] [INFO ] Implicit Places using invariants in 364 ms returned []
[2024-05-31 22:19:28] [INFO ] Invariant cache hit.
[2024-05-31 22:19:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:19:28] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
[2024-05-31 22:19:28] [INFO ] Redundant transitions in 0 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-31 22:19:28] [INFO ] Invariant cache hit.
[2024-05-31 22:19:28] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 77/158 variables, 81/95 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 1/159 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:19:29] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:19:29] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:19:29] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:19:30] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (OVERLAPS) 0/159 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 102 constraints, problems are : Problem set: 0 solved, 76 unsolved in 3098 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 82/82 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/158 variables, 81/97 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 73/172 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 1/159 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 3/176 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:19:33] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/159 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 13 (OVERLAPS) 0/159 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 179 constraints, problems are : Problem set: 0 solved, 76 unsolved in 4151 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 82/82 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 5/5 constraints]
After SMT, in 7281ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 7284ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7769 ms. Remains : 82/82 places, 77/77 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 229 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 78 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (4568 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (2906 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (2944 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 5718 steps, run visited all 2 properties in 18 ms. (steps per millisecond=317 )
Probabilistic random walk after 5718 steps, saw 2889 distinct states, run finished after 18 ms. (steps per millisecond=317 ) properties seen :2
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 134 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 89 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 11458 reset in 86 ms.
Product exploration explored 100000 steps with 11427 reset in 93 ms.
Support contains 5 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 77/77 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2024-05-31 22:19:36] [INFO ] Invariant cache hit.
[2024-05-31 22:19:36] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-31 22:19:36] [INFO ] Invariant cache hit.
[2024-05-31 22:19:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:19:36] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-05-31 22:19:36] [INFO ] Redundant transitions in 0 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-31 22:19:36] [INFO ] Invariant cache hit.
[2024-05-31 22:19:36] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (OVERLAPS) 77/158 variables, 81/95 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 1/159 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:19:37] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:19:37] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:19:38] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:19:38] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (OVERLAPS) 0/159 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 102 constraints, problems are : Problem set: 0 solved, 76 unsolved in 3019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 82/82 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/158 variables, 81/97 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 73/172 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 1/159 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 3/176 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-31 22:19:41] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/159 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 13 (OVERLAPS) 0/159 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 179 constraints, problems are : Problem set: 0 solved, 76 unsolved in 4193 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 82/82 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 5/5 constraints]
After SMT, in 7271ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 7272ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7442 ms. Remains : 82/82 places, 77/77 transitions.
Treatment of property DoubleExponent-PT-003-LTLFireability-15 finished in 24636 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : DoubleExponent-PT-003-LTLFireability-14
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 157/157 places, 148/148 transitions.
Graph (complete) has 259 edges and 157 vertex of which 156 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 155 transition count 108
Reduce places removed 38 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 117 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 116 transition count 107
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 79 place count 116 transition count 102
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 89 place count 111 transition count 102
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 149 place count 81 transition count 72
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 157 place count 77 transition count 72
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 158 place count 77 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 159 place count 76 transition count 71
Applied a total of 159 rules in 12 ms. Remains 76 /157 variables (removed 81) and now considering 71/148 (removed 77) transitions.
// Phase 1: matrix 71 rows 76 cols
[2024-05-31 22:19:44] [INFO ] Computed 14 invariants in 0 ms
[2024-05-31 22:19:44] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-31 22:19:44] [INFO ] Invariant cache hit.
[2024-05-31 22:19:44] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 22:19:44] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-05-31 22:19:44] [INFO ] Invariant cache hit.
[2024-05-31 22:19:44] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (OVERLAPS) 71/146 variables, 75/89 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 1/147 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-31 22:19:45] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:19:45] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 2 ms to minimize.
[2024-05-31 22:19:45] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/147 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (OVERLAPS) 0/147 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 97 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1985 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 76/76 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (OVERLAPS) 71/146 variables, 75/89 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 67/160 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 1/147 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 3/167 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-31 22:19:48] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/147 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 12 (OVERLAPS) 0/147 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 168 constraints, problems are : Problem set: 0 solved, 70 unsolved in 3971 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 76/76 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 4/4 constraints]
After SMT, in 5977ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 5978ms
Starting structural reductions in LI_LTL mode, iteration 1 : 76/157 places, 71/148 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6334 ms. Remains : 76/157 places, 71/148 transitions.
Running random walk in product with property : DoubleExponent-PT-003-LTLFireability-14
Product exploration explored 100000 steps with 25000 reset in 78 ms.
Product exploration explored 100000 steps with 25000 reset in 83 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 231 edges and 76 vertex of which 75 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (5525 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3264 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Probably explored full state space saw : 675939 states, properties seen :0
Probabilistic random walk after 1351914 steps, saw 675939 distinct states, run finished after 2773 ms. (steps per millisecond=487 ) properties seen :0
Interrupted probabilistic random walk after 1440018 steps, run timeout after 3001 ms. (steps per millisecond=479 ) properties seen :0 out of 1
Exhaustive walk after 1440018 steps, saw 720061 distinct states, run finished after 3001 ms. (steps per millisecond=479 ) properties seen :0
[2024-05-31 22:19:56] [INFO ] Invariant cache hit.
[2024-05-31 22:19:56] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/53 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:19:56] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 60/113 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 27/140 variables, 17/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/143 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/143 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/143 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/147 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/147 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/147 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/147 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 76/76 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/53 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 60/113 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 27/140 variables, 17/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/143 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/143 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/143 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/147 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/147 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/147 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/147 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 96 constraints, problems are : Problem set: 0 solved, 1 unsolved in 90 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 76/76 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 234ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 71/71 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 76 transition count 64
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 69 transition count 64
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 25 place count 69 transition count 64
Applied a total of 25 rules in 5 ms. Remains 69 /76 variables (removed 7) and now considering 64/71 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 69/76 places, 64/71 transitions.
RANDOM walk for 40000 steps (5106 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3373 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1441575 steps, run timeout after 3001 ms. (steps per millisecond=480 ) properties seen :0 out of 1
Probabilistic random walk after 1441575 steps, saw 720810 distinct states, run finished after 3001 ms. (steps per millisecond=480 ) properties seen :0
// Phase 1: matrix 64 rows 69 cols
[2024-05-31 22:20:00] [INFO ] Computed 14 invariants in 2 ms
[2024-05-31 22:20:00] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/38 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/48 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:20:00] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 54/102 variables, 48/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 27/129 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/129 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/129 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/129 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/130 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/130 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/130 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/133 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:20:00] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/133 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/133 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/133 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 69/69 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 36/38 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/48 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 54/102 variables, 48/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 27/129 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/129 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/129 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/129 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/129 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/129 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/130 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/130 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/130 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/133 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/133 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/133 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 96 constraints, problems are : Problem set: 0 solved, 1 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 69/69 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 287ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 69/69 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 22:20:00] [INFO ] Invariant cache hit.
[2024-05-31 22:20:00] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-31 22:20:00] [INFO ] Invariant cache hit.
[2024-05-31 22:20:00] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 22:20:00] [INFO ] Implicit Places using invariants and state equation in 139 ms returned [37, 42, 60, 66]
[2024-05-31 22:20:00] [INFO ] Actually due to overlaps returned [42, 37]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 224 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 67/69 places, 64/64 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 63
Applied a total of 2 rules in 7 ms. Remains 66 /67 variables (removed 1) and now considering 63/64 (removed 1) transitions.
// Phase 1: matrix 63 rows 66 cols
[2024-05-31 22:20:00] [INFO ] Computed 12 invariants in 1 ms
[2024-05-31 22:20:00] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-31 22:20:00] [INFO ] Invariant cache hit.
[2024-05-31 22:20:00] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 22:20:01] [INFO ] Implicit Places using invariants and state equation in 183 ms returned [57, 63]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 282 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 64/69 places, 63/64 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 64 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 62
Applied a total of 2 rules in 2 ms. Remains 63 /64 variables (removed 1) and now considering 62/63 (removed 1) transitions.
// Phase 1: matrix 62 rows 63 cols
[2024-05-31 22:20:01] [INFO ] Computed 10 invariants in 1 ms
[2024-05-31 22:20:01] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-31 22:20:01] [INFO ] Invariant cache hit.
[2024-05-31 22:20:01] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 22:20:01] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 63/69 places, 62/64 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 718 ms. Remains : 63/69 places, 62/64 transitions.
RANDOM walk for 40000 steps (5741 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3585 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1448756 steps, run visited all 1 properties in 2860 ms. (steps per millisecond=506 )
Probabilistic random walk after 1448756 steps, saw 724420 distinct states, run finished after 2860 ms. (steps per millisecond=506 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 96 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 71/71 transitions.
Applied a total of 0 rules in 0 ms. Remains 76 /76 variables (removed 0) and now considering 71/71 (removed 0) transitions.
// Phase 1: matrix 71 rows 76 cols
[2024-05-31 22:20:04] [INFO ] Computed 14 invariants in 1 ms
[2024-05-31 22:20:04] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-05-31 22:20:04] [INFO ] Invariant cache hit.
[2024-05-31 22:20:04] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 22:20:04] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-05-31 22:20:04] [INFO ] Invariant cache hit.
[2024-05-31 22:20:04] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (OVERLAPS) 71/146 variables, 75/89 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 1/147 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-31 22:20:05] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:20:06] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:20:06] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/147 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (OVERLAPS) 0/147 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 97 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1933 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 76/76 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (OVERLAPS) 71/146 variables, 75/89 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 67/160 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 1/147 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 3/167 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-31 22:20:08] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/147 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 12 (OVERLAPS) 0/147 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 168 constraints, problems are : Problem set: 0 solved, 70 unsolved in 3570 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 76/76 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 4/4 constraints]
After SMT, in 5542ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 5542ms
Finished structural reductions in LTL mode , in 1 iterations and 5864 ms. Remains : 76/76 places, 71/71 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 231 edges and 76 vertex of which 75 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 60 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (5540 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3290 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Probably explored full state space saw : 675939 states, properties seen :0
Probabilistic random walk after 1351914 steps, saw 675939 distinct states, run finished after 2815 ms. (steps per millisecond=480 ) properties seen :0
Interrupted probabilistic random walk after 1551779 steps, run timeout after 3001 ms. (steps per millisecond=517 ) properties seen :0 out of 1
Exhaustive walk after 1551779 steps, saw 775960 distinct states, run finished after 3001 ms. (steps per millisecond=517 ) properties seen :0
[2024-05-31 22:20:16] [INFO ] Invariant cache hit.
[2024-05-31 22:20:16] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/53 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:20:16] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 60/113 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 27/140 variables, 17/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/143 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/143 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/143 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/147 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/147 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/147 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/147 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 76/76 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/42 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/53 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 60/113 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 27/140 variables, 17/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/140 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/143 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/143 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/143 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/147 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/147 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/147 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/147 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 96 constraints, problems are : Problem set: 0 solved, 1 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 76/76 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 194ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 71/71 transitions.
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 7 place count 76 transition count 64
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 14 place count 69 transition count 64
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 25 place count 69 transition count 64
Applied a total of 25 rules in 4 ms. Remains 69 /76 variables (removed 7) and now considering 64/71 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 69/76 places, 64/71 transitions.
RANDOM walk for 40000 steps (5101 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3365 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1403942 steps, run timeout after 3001 ms. (steps per millisecond=467 ) properties seen :0 out of 1
Probabilistic random walk after 1403942 steps, saw 701992 distinct states, run finished after 3001 ms. (steps per millisecond=467 ) properties seen :0
// Phase 1: matrix 64 rows 69 cols
[2024-05-31 22:20:19] [INFO ] Computed 14 invariants in 4 ms
[2024-05-31 22:20:19] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/38 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/48 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:20:19] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 54/102 variables, 48/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 27/129 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/129 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/129 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/129 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/130 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/130 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/130 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/133 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:20:19] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/133 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/133 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/133 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 69/69 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 36/38 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/48 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 54/102 variables, 48/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 27/129 variables, 17/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/129 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/129 variables, 4/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/129 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/129 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/129 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/130 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/130 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/130 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/133 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/133 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/133 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 96 constraints, problems are : Problem set: 0 solved, 1 unsolved in 89 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 69/69 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 277ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 69/69 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 69 /69 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-05-31 22:20:20] [INFO ] Invariant cache hit.
[2024-05-31 22:20:20] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-31 22:20:20] [INFO ] Invariant cache hit.
[2024-05-31 22:20:20] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 22:20:20] [INFO ] Implicit Places using invariants and state equation in 123 ms returned [37, 42, 60, 66]
[2024-05-31 22:20:20] [INFO ] Actually due to overlaps returned [42, 37]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 182 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 67/69 places, 64/64 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 63
Applied a total of 2 rules in 4 ms. Remains 66 /67 variables (removed 1) and now considering 63/64 (removed 1) transitions.
// Phase 1: matrix 63 rows 66 cols
[2024-05-31 22:20:20] [INFO ] Computed 12 invariants in 1 ms
[2024-05-31 22:20:20] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-31 22:20:20] [INFO ] Invariant cache hit.
[2024-05-31 22:20:20] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 22:20:20] [INFO ] Implicit Places using invariants and state equation in 125 ms returned [57, 63]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 228 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 64/69 places, 63/64 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 64 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 62
Applied a total of 2 rules in 3 ms. Remains 63 /64 variables (removed 1) and now considering 62/63 (removed 1) transitions.
// Phase 1: matrix 62 rows 63 cols
[2024-05-31 22:20:20] [INFO ] Computed 10 invariants in 1 ms
[2024-05-31 22:20:20] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-31 22:20:20] [INFO ] Invariant cache hit.
[2024-05-31 22:20:20] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-31 22:20:20] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 63/69 places, 62/64 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 575 ms. Remains : 63/69 places, 62/64 transitions.
RANDOM walk for 40000 steps (5721 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3678 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1448756 steps, run visited all 1 properties in 2883 ms. (steps per millisecond=502 )
Probabilistic random walk after 1448756 steps, saw 724420 distinct states, run finished after 2883 ms. (steps per millisecond=502 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 106 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 89 ms.
Product exploration explored 100000 steps with 25000 reset in 77 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 71/71 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2024-05-31 22:20:24] [INFO ] Redundant transitions in 0 ms returned []
Running 70 sub problems to find dead transitions.
// Phase 1: matrix 71 rows 76 cols
[2024-05-31 22:20:24] [INFO ] Computed 14 invariants in 1 ms
[2024-05-31 22:20:24] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (OVERLAPS) 71/146 variables, 75/89 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 1/147 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-31 22:20:25] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-31 22:20:25] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-05-31 22:20:25] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-05-31 22:20:25] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/147 variables, 4/98 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (OVERLAPS) 0/147 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 98 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1990 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 76/76 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (OVERLAPS) 71/146 variables, 75/89 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 67/160 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 1/147 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 4/168 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-31 22:20:28] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-05-31 22:20:28] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/147 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 12 (OVERLAPS) 0/147 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 170 constraints, problems are : Problem set: 0 solved, 70 unsolved in 3206 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 76/76 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 6/6 constraints]
After SMT, in 5211ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 5212ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5222 ms. Remains : 76/76 places, 71/71 transitions.
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 76/76 places, 71/71 transitions.
Applied a total of 0 rules in 1 ms. Remains 76 /76 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2024-05-31 22:20:29] [INFO ] Invariant cache hit.
[2024-05-31 22:20:29] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-31 22:20:29] [INFO ] Invariant cache hit.
[2024-05-31 22:20:29] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 22:20:29] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-05-31 22:20:29] [INFO ] Invariant cache hit.
[2024-05-31 22:20:29] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (OVERLAPS) 71/146 variables, 75/89 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 1/147 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-31 22:20:30] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:20:30] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-31 22:20:31] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/147 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (OVERLAPS) 0/147 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 97 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1887 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 76/76 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (OVERLAPS) 71/146 variables, 75/89 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 67/160 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 1/147 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 3/164 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 3/167 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-31 22:20:33] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/147 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 12 (OVERLAPS) 0/147 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 168 constraints, problems are : Problem set: 0 solved, 70 unsolved in 3563 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 76/76 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 4/4 constraints]
After SMT, in 5463ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 5464ms
Finished structural reductions in LTL mode , in 1 iterations and 5618 ms. Remains : 76/76 places, 71/71 transitions.
Treatment of property DoubleExponent-PT-003-LTLFireability-14 finished in 51338 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)&&F(G(p1)))))'
[2024-05-31 22:20:35] [INFO ] Flatten gal took : 12 ms
[2024-05-31 22:20:35] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-31 22:20:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 157 places, 148 transitions and 407 arcs took 4 ms.
Total runtime 332288 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA DoubleExponent-PT-003-LTLFireability-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-003-LTLFireability-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA DoubleExponent-PT-003-LTLFireability-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717194057669

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name DoubleExponent-PT-003-LTLFireability-02
ltl formula formula --ltl=/tmp/2270/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 157 places, 148 transitions and 407 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.020 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2270/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2270/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2270/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2270/ltl_0_
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 159 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 158, there are 151 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): ~1161 levels ~10000 states ~11148 transitions
pnml2lts-mc( 3/ 4): ~1067 levels ~20000 states ~22352 transitions
pnml2lts-mc( 3/ 4): ~1261 levels ~40000 states ~44520 transitions
pnml2lts-mc( 2/ 4): ~1444 levels ~80000 states ~88740 transitions
pnml2lts-mc( 2/ 4): ~1644 levels ~160000 states ~177300 transitions
pnml2lts-mc( 2/ 4): ~2658 levels ~320000 states ~354476 transitions
pnml2lts-mc( 1/ 4): ~4347 levels ~640000 states ~708740 transitions
pnml2lts-mc( 1/ 4): ~7551 levels ~1280000 states ~1417596 transitions
pnml2lts-mc( 1/ 4): ~13766 levels ~2560000 states ~2835256 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2385088
pnml2lts-mc( 0/ 4): unique states count: 2385088
pnml2lts-mc( 0/ 4): unique transitions count: 2639259
pnml2lts-mc( 0/ 4): - self-loop count: 255818
pnml2lts-mc( 0/ 4): - claim dead count: 10836
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 2550951
pnml2lts-mc( 0/ 4): - cum. max stack depth: 59954
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2550951 states 2826856 transitions, fanout: 1.108
pnml2lts-mc( 0/ 4): Total exploration time 5.810 sec (5.800 sec minimum, 5.805 sec on average)
pnml2lts-mc( 0/ 4): States per second: 439062, Transitions per second: 486550
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 32.8MB, 14.4 B/state, compr.: 2.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 7.0%/22.0%
pnml2lts-mc( 0/ 4): Stored 148 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 32.8MB (~256.0MB paged-in)
ltl formula name DoubleExponent-PT-003-LTLFireability-14
ltl formula formula --ltl=/tmp/2270/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
pnml2lts-mc( 0/ 4): Petri net has 157 places, 148 transitions and 407 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2270/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2270/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2270/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2270/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 159 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 158, there are 152 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):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4
pnml2lts-mc( 0/ 4): unique states count: 4
pnml2lts-mc( 0/ 4): unique transitions count: 3
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 7
pnml2lts-mc( 0/ 4): - cum. max stack depth: 7
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7 states 10 transitions, fanout: 1.429
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 92.0 B/state, compr.: 14.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 148 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name DoubleExponent-PT-003-LTLFireability-15
ltl formula formula --ltl=/tmp/2270/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
pnml2lts-mc( 0/ 4): Petri net has 157 places, 148 transitions and 407 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
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): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2270/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2270/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2270/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2270/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 158 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 158, there are 161 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): ~1035 levels ~10000 states ~11152 transitions
pnml2lts-mc( 0/ 4): ~1218 levels ~20000 states ~22364 transitions
pnml2lts-mc( 2/ 4): ~1191 levels ~40000 states ~44724 transitions
pnml2lts-mc( 2/ 4): ~1294 levels ~80000 states ~89520 transitions
pnml2lts-mc( 2/ 4): ~1450 levels ~160000 states ~179168 transitions
pnml2lts-mc( 1/ 4): ~13799 levels ~320000 states ~359972 transitions
pnml2lts-mc( 1/ 4): ~17904 levels ~640000 states ~718792 transitions
pnml2lts-mc( 0/ 4): ~5361 levels ~1280000 states ~1435768 transitions
pnml2lts-mc( 0/ 4): ~8662 levels ~2560000 states ~2870564 transitions
pnml2lts-mc( 0/ 4): ~13561 levels ~5120000 states ~5736776 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 4768998
pnml2lts-mc( 0/ 4): unique states count: 4768998
pnml2lts-mc( 0/ 4): unique transitions count: 5323424
pnml2lts-mc( 0/ 4): - self-loop count: 511280
pnml2lts-mc( 0/ 4): - claim dead count: 60367
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4972539
pnml2lts-mc( 0/ 4): - cum. max stack depth: 65679
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4972539 states 5561950 transitions, fanout: 1.119
pnml2lts-mc( 0/ 4): Total exploration time 15.140 sec (15.140 sec minimum, 15.140 sec on average)
pnml2lts-mc( 0/ 4): States per second: 328437, Transitions per second: 367368
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 64.3MB, 14.1 B/state, compr.: 2.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 14.0%/43.0%
pnml2lts-mc( 0/ 4): Stored 148 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 64.3MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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