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.r553-tall-171734901400316.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 FireWire-PT-19, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901400316
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 221K Jun 2 16:33 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 FireWire-PT-19-LTLFireability-00
FORMULA_NAME FireWire-PT-19-LTLFireability-01
FORMULA_NAME FireWire-PT-19-LTLFireability-02
FORMULA_NAME FireWire-PT-19-LTLFireability-03
FORMULA_NAME FireWire-PT-19-LTLFireability-04
FORMULA_NAME FireWire-PT-19-LTLFireability-05
FORMULA_NAME FireWire-PT-19-LTLFireability-06
FORMULA_NAME FireWire-PT-19-LTLFireability-07
FORMULA_NAME FireWire-PT-19-LTLFireability-08
FORMULA_NAME FireWire-PT-19-LTLFireability-09
FORMULA_NAME FireWire-PT-19-LTLFireability-10
FORMULA_NAME FireWire-PT-19-LTLFireability-11
FORMULA_NAME FireWire-PT-19-LTLFireability-12
FORMULA_NAME FireWire-PT-19-LTLFireability-13
FORMULA_NAME FireWire-PT-19-LTLFireability-14
FORMULA_NAME FireWire-PT-19-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717357884186

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-19
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:51:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 19:51:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:51:25] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-06-02 19:51:25] [INFO ] Transformed 602 places.
[2024-06-02 19:51:25] [INFO ] Transformed 944 transitions.
[2024-06-02 19:51:25] [INFO ] Found NUPN structural information;
[2024-06-02 19:51:25] [INFO ] Parsed PT model containing 602 places and 944 transitions and 2776 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA FireWire-PT-19-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-19-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-19-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 602/602 places, 944/944 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 593 transition count 944
Discarding 121 places :
Symmetric choice reduction at 1 with 121 rule applications. Total rules 130 place count 472 transition count 823
Iterating global reduction 1 with 121 rules applied. Total rules applied 251 place count 472 transition count 823
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 282 place count 441 transition count 781
Iterating global reduction 1 with 31 rules applied. Total rules applied 313 place count 441 transition count 781
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 316 place count 441 transition count 778
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 319 place count 438 transition count 775
Iterating global reduction 2 with 3 rules applied. Total rules applied 322 place count 438 transition count 775
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 324 place count 436 transition count 773
Iterating global reduction 2 with 2 rules applied. Total rules applied 326 place count 436 transition count 773
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 328 place count 434 transition count 771
Iterating global reduction 2 with 2 rules applied. Total rules applied 330 place count 434 transition count 771
Applied a total of 330 rules in 132 ms. Remains 434 /602 variables (removed 168) and now considering 771/944 (removed 173) transitions.
// Phase 1: matrix 771 rows 434 cols
[2024-06-02 19:51:25] [INFO ] Computed 10 invariants in 25 ms
[2024-06-02 19:51:26] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-06-02 19:51:26] [INFO ] Invariant cache hit.
[2024-06-02 19:51:26] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 806 ms to find 0 implicit places.
Running 770 sub problems to find dead transitions.
[2024-06-02 19:51:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 1 (OVERLAPS) 1/434 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-06-02 19:51:38] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 12 ms to minimize.
[2024-06-02 19:51:38] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 1 ms to minimize.
[2024-06-02 19:51:38] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-06-02 19:51:39] [INFO ] Deduced a trap composed of 90 places in 56 ms of which 1 ms to minimize.
[2024-06-02 19:51:40] [INFO ] Deduced a trap composed of 88 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:51:40] [INFO ] Deduced a trap composed of 56 places in 116 ms of which 2 ms to minimize.
[2024-06-02 19:51:41] [INFO ] Deduced a trap composed of 79 places in 135 ms of which 2 ms to minimize.
[2024-06-02 19:51:45] [INFO ] Deduced a trap composed of 74 places in 53 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-06-02 19:51:47] [INFO ] Deduced a trap composed of 76 places in 67 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)timeout

(s318 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 770 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/1205 variables, and 19 constraints, problems are : Problem set: 0 solved, 770 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/434 constraints, PredecessorRefiner: 770/770 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 770 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 1 (OVERLAPS) 1/434 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/434 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/434 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 4 (OVERLAPS) 771/1205 variables, 434/453 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1205 variables, 770/1223 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-06-02 19:52:18] [INFO ] Deduced a trap composed of 76 places in 111 ms of which 11 ms to minimize.
[2024-06-02 19:52:19] [INFO ] Deduced a trap composed of 230 places in 175 ms of which 3 ms to minimize.
[2024-06-02 19:52:22] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 1 ms to minimize.
[2024-06-02 19:52:22] [INFO ] Deduced a trap composed of 149 places in 169 ms of which 2 ms to minimize.
[2024-06-02 19:52:22] [INFO ] Deduced a trap composed of 134 places in 146 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1205/1205 variables, and 1228 constraints, problems are : Problem set: 0 solved, 770 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 434/434 constraints, PredecessorRefiner: 770/770 constraints, Known Traps: 14/14 constraints]
After SMT, in 60543ms problems are : Problem set: 0 solved, 770 unsolved
Search for dead transitions found 0 dead transitions in 60567ms
Starting structural reductions in LTL mode, iteration 1 : 434/602 places, 771/944 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61527 ms. Remains : 434/602 places, 771/944 transitions.
Support contains 42 out of 434 places after structural reductions.
[2024-06-02 19:52:27] [INFO ] Flatten gal took : 82 ms
[2024-06-02 19:52:27] [INFO ] Flatten gal took : 47 ms
[2024-06-02 19:52:27] [INFO ] Input system was already deterministic with 771 transitions.
Support contains 41 out of 434 places (down from 42) after GAL structural reductions.
RANDOM walk for 40000 steps (9 resets) in 4135 ms. (9 steps per ms) remains 30/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 30/30 properties
[2024-06-02 19:52:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 279/316 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-02 19:52:29] [INFO ] Deduced a trap composed of 79 places in 130 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 61/377 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-02 19:52:30] [INFO ] Deduced a trap composed of 76 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:52:30] [INFO ] Deduced a trap composed of 75 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/377 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 711/1088 variables, 377/390 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 27/1115 variables, 12/402 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1115 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 31/1146 variables, 15/417 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1146 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 13 (OVERLAPS) 20/1166 variables, 10/427 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1166 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 15 (OVERLAPS) 24/1190 variables, 10/437 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1190 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 17 (OVERLAPS) 14/1204 variables, 9/446 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1204/1205 variables, and 446 constraints, problems are : Problem set: 0 solved, 30 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 433/434 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 279/316 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-02 19:52:34] [INFO ] Deduced a trap composed of 75 places in 132 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 61/377 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/377 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-06-02 19:52:35] [INFO ] Deduced a trap composed of 86 places in 149 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 711/1088 variables, 377/392 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1088 variables, 30/422 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1088 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (OVERLAPS) 27/1115 variables, 12/434 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1115 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 14 (OVERLAPS) 31/1146 variables, 15/449 constraints. Problems are: Problem set: 0 solved, 30 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1146/1205 variables, and 449 constraints, problems are : Problem set: 0 solved, 30 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 404/434 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 5/5 constraints]
After SMT, in 10050ms problems are : Problem set: 0 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 37 out of 434 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 434/434 places, 771/771 transitions.
Graph (trivial) has 289 edges and 434 vertex of which 9 / 434 are part of one of the 2 SCC in 3 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 427 transition count 691
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 73 rules applied. Total rules applied 142 place count 359 transition count 686
Reduce places removed 2 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 7 rules applied. Total rules applied 149 place count 357 transition count 681
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 154 place count 352 transition count 681
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 40 Pre rules applied. Total rules applied 154 place count 352 transition count 641
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 234 place count 312 transition count 641
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 328 place count 265 transition count 594
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: -148
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 396 place count 231 transition count 742
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 402 place count 231 transition count 736
Free-agglomeration rule applied 28 times.
Iterating global reduction 4 with 28 rules applied. Total rules applied 430 place count 231 transition count 708
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 458 place count 203 transition count 708
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 464 place count 203 transition count 708
Applied a total of 464 rules in 145 ms. Remains 203 /434 variables (removed 231) and now considering 708/771 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 203/434 places, 708/771 transitions.
RANDOM walk for 40000 steps (1533 resets) in 1234 ms. (32 steps per ms) remains 18/30 properties
BEST_FIRST walk for 4003 steps (28 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (27 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (30 resets) in 23 ms. (166 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (30 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (29 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (26 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (31 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (32 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (21 resets) in 16 ms. (235 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4003 steps (27 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (24 resets) in 12 ms. (308 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (31 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (22 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (29 resets) in 14 ms. (266 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4003 steps (30 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (25 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (31 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
[2024-06-02 19:52:39] [INFO ] Flow matrix only has 683 transitions (discarded 25 similar events)
// Phase 1: matrix 683 rows 203 cols
[2024-06-02 19:52:39] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:52:39] [INFO ] State equation strengthened by 46 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 161/180 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 17/197 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 683/880 variables, 197/207 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/880 variables, 46/253 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/880 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 6/886 variables, 6/259 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/886 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/886 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 886/886 variables, and 259 constraints, problems are : Problem set: 0 solved, 16 unsolved in 887 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 161/180 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 17/197 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-02 19:52:40] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 683/880 variables, 197/208 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/880 variables, 46/254 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/880 variables, 16/270 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/880 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 6/886 variables, 6/276 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/886 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 0/886 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 886/886 variables, and 276 constraints, problems are : Problem set: 0 solved, 16 unsolved in 2056 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 1/1 constraints]
After SMT, in 2986ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 2 properties in 33303 ms.
Support contains 17 out of 203 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 203/203 places, 708/708 transitions.
Graph (trivial) has 42 edges and 203 vertex of which 2 / 203 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 202 transition count 704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 200 transition count 704
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 5 place count 200 transition count 701
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 11 place count 197 transition count 701
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 196 transition count 641
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 196 transition count 641
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 21 place count 192 transition count 637
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 22 place count 191 transition count 634
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 191 transition count 634
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 28 place count 191 transition count 629
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -27
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 38 place count 186 transition count 656
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 41 place count 186 transition count 653
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 47 place count 186 transition count 647
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 53 place count 180 transition count 647
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 71 place count 180 transition count 629
Applied a total of 71 rules in 78 ms. Remains 180 /203 variables (removed 23) and now considering 629/708 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 180/203 places, 629/708 transitions.
RANDOM walk for 40000 steps (1214 resets) in 1136 ms. (35 steps per ms) remains 9/14 properties
BEST_FIRST walk for 40004 steps (225 resets) in 81 ms. (487 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (233 resets) in 71 ms. (555 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (249 resets) in 54 ms. (727 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (53 resets) in 52 ms. (754 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40004 steps (80 resets) in 74 ms. (533 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (270 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (75 resets) in 112 ms. (354 steps per ms) remains 5/5 properties
[2024-06-02 19:53:16] [INFO ] Flow matrix only has 602 transitions (discarded 27 similar events)
// Phase 1: matrix 602 rows 180 cols
[2024-06-02 19:53:16] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:53:16] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 100/107 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 67/174 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:53:16] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-06-02 19:53:16] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 602/776 variables, 174/186 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/776 variables, 45/231 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/776 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/782 variables, 6/237 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/782 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/782 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 782/782 variables, and 237 constraints, problems are : Problem set: 0 solved, 5 unsolved in 545 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 100/107 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 67/174 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 602/776 variables, 174/186 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/776 variables, 45/231 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/776 variables, 5/236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/776 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 6/782 variables, 6/242 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/782 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/782 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 782/782 variables, and 242 constraints, problems are : Problem set: 0 solved, 5 unsolved in 607 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 180/180 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 1174ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1908 ms.
Support contains 7 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 629/629 transitions.
Graph (trivial) has 30 edges and 180 vertex of which 2 / 180 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 179 transition count 625
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 177 transition count 625
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 177 transition count 624
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 176 transition count 624
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 175 transition count 560
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 175 transition count 560
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 175 transition count 559
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -16
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 20 place count 170 transition count 575
Drop transitions (Redundant composition of simpler transitions.) removed 100 transitions
Redundant transition composition rules discarded 100 transitions
Iterating global reduction 3 with 100 rules applied. Total rules applied 120 place count 170 transition count 475
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 170 transition count 474
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 122 place count 169 transition count 474
Applied a total of 122 rules in 53 ms. Remains 169 /180 variables (removed 11) and now considering 474/629 (removed 155) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 169/180 places, 474/629 transitions.
RANDOM walk for 40000 steps (1521 resets) in 258 ms. (154 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (112 resets) in 57 ms. (689 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (105 resets) in 46 ms. (851 steps per ms) remains 2/3 properties
[2024-06-02 19:53:20] [INFO ] Flow matrix only has 456 transitions (discarded 18 similar events)
// Phase 1: matrix 456 rows 169 cols
[2024-06-02 19:53:20] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:53:20] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 98/101 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 62/163 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:53:20] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:53:20] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 456/619 variables, 163/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/619 variables, 88/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/619 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/625 variables, 6/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/625 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/625 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 625/625 variables, and 269 constraints, problems are : Problem set: 0 solved, 2 unsolved in 384 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 98/101 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 62/163 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 456/619 variables, 163/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/619 variables, 88/263 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/619 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/619 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 6/625 variables, 6/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/625 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/625 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 625/625 variables, and 271 constraints, problems are : Problem set: 0 solved, 2 unsolved in 376 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 778ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 176 ms.
Support contains 3 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 474/474 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 169 transition count 473
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 168 transition count 473
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 166 transition count 474
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 166 transition count 473
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 166 transition count 472
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 18 place count 165 transition count 463
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 3 with 18 rules applied. Total rules applied 36 place count 165 transition count 445
Applied a total of 36 rules in 56 ms. Remains 165 /169 variables (removed 4) and now considering 445/474 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 165/169 places, 445/474 transitions.
RANDOM walk for 40000 steps (1658 resets) in 224 ms. (177 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (113 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
[2024-06-02 19:53:21] [INFO ] Flow matrix only has 391 transitions (discarded 54 similar events)
// Phase 1: matrix 391 rows 165 cols
[2024-06-02 19:53:21] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:53:21] [INFO ] State equation strengthened by 93 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) 54/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 103/159 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 391/550 variables, 159/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 93/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/556 variables, 6/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/556 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 416 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, ReadFeed: 93/93 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) 54/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 103/159 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:53:21] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 391/550 variables, 159/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 93/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/556 variables, 6/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/556 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/556 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/556 variables, and 270 constraints, problems are : Problem set: 0 solved, 1 unsolved in 364 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 815ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 445/445 transitions.
Applied a total of 0 rules in 13 ms. Remains 165 /165 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 165/165 places, 445/445 transitions.
RANDOM walk for 40000 steps (1579 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (116 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 957686 steps, run timeout after 3001 ms. (steps per millisecond=319 ) properties seen :0 out of 1
Probabilistic random walk after 957686 steps, saw 263168 distinct states, run finished after 3004 ms. (steps per millisecond=318 ) properties seen :0
[2024-06-02 19:53:25] [INFO ] Flow matrix only has 391 transitions (discarded 54 similar events)
[2024-06-02 19:53:25] [INFO ] Invariant cache hit.
[2024-06-02 19:53:25] [INFO ] State equation strengthened by 93 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) 54/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 103/159 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:53:25] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 391/550 variables, 159/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 93/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 6/556 variables, 6/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/556 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/556 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 269 constraints, problems are : Problem set: 0 solved, 1 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, ReadFeed: 93/93 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) 54/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 103/159 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 391/550 variables, 159/170 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 93/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/550 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/556 variables, 6/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/556 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/556 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/556 variables, and 270 constraints, problems are : Problem set: 0 solved, 1 unsolved in 358 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 696ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 445/445 transitions.
Applied a total of 0 rules in 17 ms. Remains 165 /165 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 165/165 places, 445/445 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 445/445 transitions.
Applied a total of 0 rules in 6 ms. Remains 165 /165 variables (removed 0) and now considering 445/445 (removed 0) transitions.
[2024-06-02 19:53:25] [INFO ] Flow matrix only has 391 transitions (discarded 54 similar events)
[2024-06-02 19:53:25] [INFO ] Invariant cache hit.
[2024-06-02 19:53:25] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 19:53:25] [INFO ] Flow matrix only has 391 transitions (discarded 54 similar events)
[2024-06-02 19:53:25] [INFO ] Invariant cache hit.
[2024-06-02 19:53:26] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-06-02 19:53:26] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2024-06-02 19:53:26] [INFO ] Redundant transitions in 47 ms returned [357]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 436 sub problems to find dead transitions.
[2024-06-02 19:53:26] [INFO ] Flow matrix only has 390 transitions (discarded 54 similar events)
// Phase 1: matrix 390 rows 165 cols
[2024-06-02 19:53:26] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:53:26] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 19:53:29] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 2 ms to minimize.
[2024-06-02 19:53:29] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 0 ms to minimize.
[2024-06-02 19:53:29] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 0 ms to minimize.
[2024-06-02 19:53:29] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2024-06-02 19:53:29] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 1 ms to minimize.
[2024-06-02 19:53:30] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 1 ms to minimize.
[2024-06-02 19:53:30] [INFO ] Deduced a trap composed of 125 places in 81 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 19:53:31] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 1 ms to minimize.
[2024-06-02 19:53:31] [INFO ] Deduced a trap composed of 96 places in 85 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 5 (OVERLAPS) 390/555 variables, 165/184 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 93/277 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 8 (OVERLAPS) 0/555 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 436 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 277 constraints, problems are : Problem set: 0 solved, 436 unsolved in 19932 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 436 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (OVERLAPS) 1/165 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (OVERLAPS) 390/555 variables, 165/184 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 93/277 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 436/713 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 19:53:55] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 1 ms to minimize.
[2024-06-02 19:53:58] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:53:59] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 3/716 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/555 variables, and 716 constraints, problems are : Problem set: 0 solved, 436 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 12/12 constraints]
After SMT, in 50297ms problems are : Problem set: 0 solved, 436 unsolved
Search for dead transitions found 0 dead transitions in 50302ms
Starting structural reductions in REACHABILITY mode, iteration 1 : 165/165 places, 444/445 transitions.
Applied a total of 0 rules in 30 ms. Remains 165 /165 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 50828 ms. Remains : 165/165 places, 444/445 transitions.
Computed a total of 69 stabilizing places and 75 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 424 transition count 731
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 424 transition count 731
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 421 transition count 728
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 421 transition count 728
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 421 transition count 727
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 420 transition count 726
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 420 transition count 726
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 419 transition count 725
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 419 transition count 725
Applied a total of 31 rules in 18 ms. Remains 419 /434 variables (removed 15) and now considering 725/771 (removed 46) transitions.
// Phase 1: matrix 725 rows 419 cols
[2024-06-02 19:54:17] [INFO ] Computed 10 invariants in 18 ms
[2024-06-02 19:54:17] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-06-02 19:54:17] [INFO ] Invariant cache hit.
[2024-06-02 19:54:17] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
Running 724 sub problems to find dead transitions.
[2024-06-02 19:54:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 1 (OVERLAPS) 1/419 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 724 unsolved
[2024-06-02 19:54:27] [INFO ] Deduced a trap composed of 73 places in 67 ms of which 1 ms to minimize.
[2024-06-02 19:54:27] [INFO ] Deduced a trap composed of 86 places in 50 ms of which 2 ms to minimize.
[2024-06-02 19:54:28] [INFO ] Deduced a trap composed of 75 places in 47 ms of which 0 ms to minimize.
[2024-06-02 19:54:28] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-06-02 19:54:28] [INFO ] Deduced a trap composed of 73 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:54:29] [INFO ] Deduced a trap composed of 86 places in 50 ms of which 1 ms to minimize.
[2024-06-02 19:54:29] [INFO ] Deduced a trap composed of 86 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:54:30] [INFO ] Deduced a trap composed of 54 places in 102 ms of which 1 ms to minimize.
[2024-06-02 19:54:30] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 724 unsolved
[2024-06-02 19:54:37] [INFO ] Deduced a trap composed of 55 places in 115 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/419 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 724 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 419/1144 variables, and 20 constraints, problems are : Problem set: 0 solved, 724 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/419 constraints, PredecessorRefiner: 724/724 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 724 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 1 (OVERLAPS) 1/419 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 724 unsolved
[2024-06-02 19:54:52] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/419 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/419 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 5 (OVERLAPS) 725/1144 variables, 419/440 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1144 variables, 724/1164 constraints. Problems are: Problem set: 0 solved, 724 unsolved
[2024-06-02 19:55:13] [INFO ] Deduced a trap composed of 75 places in 114 ms of which 3 ms to minimize.
[2024-06-02 19:55:14] [INFO ] Deduced a trap composed of 223 places in 155 ms of which 4 ms to minimize.
[2024-06-02 19:55:16] [INFO ] Deduced a trap composed of 138 places in 139 ms of which 2 ms to minimize.
[2024-06-02 19:55:17] [INFO ] Deduced a trap composed of 75 places in 81 ms of which 2 ms to minimize.
[2024-06-02 19:55:17] [INFO ] Deduced a trap composed of 222 places in 148 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1144/1144 variables, and 1169 constraints, problems are : Problem set: 0 solved, 724 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 419/419 constraints, PredecessorRefiner: 724/724 constraints, Known Traps: 16/16 constraints]
After SMT, in 60326ms problems are : Problem set: 0 solved, 724 unsolved
Search for dead transitions found 0 dead transitions in 60333ms
Starting structural reductions in LTL mode, iteration 1 : 419/434 places, 725/771 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60929 ms. Remains : 419/434 places, 725/771 transitions.
Stuttering acceptance computed with spot in 328 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-19-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA FireWire-PT-19-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLFireability-00 finished in 61328 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((p0&&(p1 U (p2||G(p1)))))))'
Support contains 5 out of 434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 423 transition count 730
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 423 transition count 730
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 420 transition count 727
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 420 transition count 727
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 420 transition count 726
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 419 transition count 725
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 419 transition count 725
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 418 transition count 724
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 418 transition count 724
Applied a total of 33 rules in 17 ms. Remains 418 /434 variables (removed 16) and now considering 724/771 (removed 47) transitions.
// Phase 1: matrix 724 rows 418 cols
[2024-06-02 19:55:18] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 19:55:18] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-06-02 19:55:18] [INFO ] Invariant cache hit.
[2024-06-02 19:55:19] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
Running 723 sub problems to find dead transitions.
[2024-06-02 19:55:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (OVERLAPS) 1/418 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 19:55:28] [INFO ] Deduced a trap composed of 85 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:55:29] [INFO ] Deduced a trap composed of 86 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:55:30] [INFO ] Deduced a trap composed of 86 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:55:31] [INFO ] Deduced a trap composed of 54 places in 111 ms of which 2 ms to minimize.
[2024-06-02 19:55:31] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 2 ms to minimize.
[2024-06-02 19:55:31] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 2 ms to minimize.
[2024-06-02 19:55:35] [INFO ] Deduced a trap composed of 72 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 19:55:36] [INFO ] Deduced a trap composed of 75 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:55:36] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 19:55:48] [INFO ] Deduced a trap composed of 73 places in 74 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1142 variables, and 20 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/418 constraints, PredecessorRefiner: 723/723 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 723 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (OVERLAPS) 1/418 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 19:55:55] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 19:56:01] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 6 (OVERLAPS) 724/1142 variables, 418/440 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1142 variables, 723/1163 constraints. Problems are: Problem set: 0 solved, 723 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1142/1142 variables, and 1163 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 418/418 constraints, PredecessorRefiner: 723/723 constraints, Known Traps: 12/12 constraints]
After SMT, in 60317ms problems are : Problem set: 0 solved, 723 unsolved
Search for dead transitions found 0 dead transitions in 60326ms
Starting structural reductions in LTL mode, iteration 1 : 418/434 places, 724/771 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60984 ms. Remains : 418/434 places, 724/771 transitions.
Stuttering acceptance computed with spot in 189 ms :[true, (AND (NOT p2) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : FireWire-PT-19-LTLFireability-01
Product exploration explored 100000 steps with 33333 reset in 298 ms.
Product exploration explored 100000 steps with 33333 reset in 179 ms.
Computed a total of 63 stabilizing places and 69 stable transitions
Computed a total of 63 stabilizing places and 69 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (X p2)), (X (X (NOT (OR (NOT p0) (AND (NOT p2) (NOT p1)))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 143 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-19-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-19-LTLFireability-01 finished in 61870 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((X(X(X(X(X(F(p1))))))&&p0))))'
Support contains 4 out of 434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 423 transition count 730
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 423 transition count 730
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 420 transition count 727
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 420 transition count 727
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 420 transition count 726
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 419 transition count 725
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 419 transition count 725
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 418 transition count 724
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 418 transition count 724
Applied a total of 33 rules in 17 ms. Remains 418 /434 variables (removed 16) and now considering 724/771 (removed 47) transitions.
[2024-06-02 19:56:20] [INFO ] Invariant cache hit.
[2024-06-02 19:56:20] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-06-02 19:56:20] [INFO ] Invariant cache hit.
[2024-06-02 19:56:20] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
Running 723 sub problems to find dead transitions.
[2024-06-02 19:56:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (OVERLAPS) 1/418 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 19:56:30] [INFO ] Deduced a trap composed of 85 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:56:31] [INFO ] Deduced a trap composed of 86 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:56:32] [INFO ] Deduced a trap composed of 86 places in 57 ms of which 1 ms to minimize.
[2024-06-02 19:56:32] [INFO ] Deduced a trap composed of 54 places in 112 ms of which 2 ms to minimize.
[2024-06-02 19:56:32] [INFO ] Deduced a trap composed of 55 places in 131 ms of which 2 ms to minimize.
[2024-06-02 19:56:33] [INFO ] Deduced a trap composed of 73 places in 159 ms of which 2 ms to minimize.
[2024-06-02 19:56:36] [INFO ] Deduced a trap composed of 72 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 19:56:38] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:56:38] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 19:56:49] [INFO ] Deduced a trap composed of 73 places in 60 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1142 variables, and 20 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/418 constraints, PredecessorRefiner: 723/723 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 723 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (OVERLAPS) 1/418 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 19:56:58] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 19:57:02] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 6 (OVERLAPS) 724/1142 variables, 418/440 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1142 variables, 723/1163 constraints. Problems are: Problem set: 0 solved, 723 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1142/1142 variables, and 1163 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 418/418 constraints, PredecessorRefiner: 723/723 constraints, Known Traps: 12/12 constraints]
After SMT, in 60285ms problems are : Problem set: 0 solved, 723 unsolved
Search for dead transitions found 0 dead transitions in 60290ms
Starting structural reductions in LTL mode, iteration 1 : 418/434 places, 724/771 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60938 ms. Remains : 418/434 places, 724/771 transitions.
Stuttering acceptance computed with spot in 294 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : FireWire-PT-19-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 105 ms.
Stuttering criterion allowed to conclude after 99 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-19-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLFireability-02 finished in 61374 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(G(!p1)||(!p1&&F(p2)))))'
Support contains 4 out of 434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 425 transition count 761
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 425 transition count 761
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 422 transition count 758
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 422 transition count 758
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 422 transition count 757
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 421 transition count 756
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 421 transition count 756
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 420 transition count 755
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 420 transition count 755
Applied a total of 29 rules in 32 ms. Remains 420 /434 variables (removed 14) and now considering 755/771 (removed 16) transitions.
// Phase 1: matrix 755 rows 420 cols
[2024-06-02 19:57:21] [INFO ] Computed 10 invariants in 7 ms
[2024-06-02 19:57:21] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-06-02 19:57:21] [INFO ] Invariant cache hit.
[2024-06-02 19:57:22] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
Running 754 sub problems to find dead transitions.
[2024-06-02 19:57:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 1 (OVERLAPS) 1/420 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-02 19:57:32] [INFO ] Deduced a trap composed of 74 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:57:32] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-06-02 19:57:32] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 1 ms to minimize.
[2024-06-02 19:57:33] [INFO ] Deduced a trap composed of 85 places in 81 ms of which 1 ms to minimize.
[2024-06-02 19:57:34] [INFO ] Deduced a trap composed of 87 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:57:34] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:57:34] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2024-06-02 19:57:34] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 0 ms to minimize.
[2024-06-02 19:57:35] [INFO ] Deduced a trap composed of 86 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:57:35] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 2 ms to minimize.
[2024-06-02 19:57:35] [INFO ] Deduced a trap composed of 74 places in 127 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 4 (OVERLAPS) 755/1175 variables, 420/441 constraints. Problems are: Problem set: 0 solved, 754 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1175/1175 variables, and 441 constraints, problems are : Problem set: 0 solved, 754 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 754/754 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 754 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 1 (OVERLAPS) 1/420 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-02 19:58:00] [INFO ] Deduced a trap composed of 56 places in 121 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 5 (OVERLAPS) 755/1175 variables, 420/442 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1175 variables, 754/1196 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-02 19:58:21] [INFO ] Deduced a trap composed of 218 places in 161 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1175/1175 variables, and 1197 constraints, problems are : Problem set: 0 solved, 754 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 754/754 constraints, Known Traps: 13/13 constraints]
After SMT, in 60286ms problems are : Problem set: 0 solved, 754 unsolved
Search for dead transitions found 0 dead transitions in 60293ms
Starting structural reductions in LTL mode, iteration 1 : 420/434 places, 755/771 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60919 ms. Remains : 420/434 places, 755/771 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p0) p1), true, (NOT p0), (AND (NOT p2) p1), (NOT p2)]
Running random walk in product with property : FireWire-PT-19-LTLFireability-04
Stuttering criterion allowed to conclude after 132 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-19-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLFireability-04 finished in 61113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Graph (trivial) has 336 edges and 434 vertex of which 18 / 434 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 418 transition count 675
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 84 rules applied. Total rules applied 164 place count 339 transition count 670
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 166 place count 337 transition count 670
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 166 place count 337 transition count 630
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 246 place count 297 transition count 630
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 251 place count 292 transition count 566
Iterating global reduction 3 with 5 rules applied. Total rules applied 256 place count 292 transition count 566
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 257 place count 292 transition count 565
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 257 place count 292 transition count 563
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 261 place count 290 transition count 563
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 262 place count 289 transition count 562
Iterating global reduction 4 with 1 rules applied. Total rules applied 263 place count 289 transition count 562
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 265 place count 289 transition count 560
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 266 place count 288 transition count 560
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 6 with 90 rules applied. Total rules applied 356 place count 243 transition count 515
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -148
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 452 place count 195 transition count 663
Drop transitions (Redundant composition of simpler transitions.) removed 59 transitions
Redundant transition composition rules discarded 59 transitions
Iterating global reduction 6 with 59 rules applied. Total rules applied 511 place count 195 transition count 604
Applied a total of 511 rules in 184 ms. Remains 195 /434 variables (removed 239) and now considering 604/771 (removed 167) transitions.
[2024-06-02 19:58:22] [INFO ] Flow matrix only has 579 transitions (discarded 25 similar events)
// Phase 1: matrix 579 rows 195 cols
[2024-06-02 19:58:22] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:58:23] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-06-02 19:58:23] [INFO ] Flow matrix only has 579 transitions (discarded 25 similar events)
[2024-06-02 19:58:23] [INFO ] Invariant cache hit.
[2024-06-02 19:58:23] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-02 19:58:24] [INFO ] Implicit Places using invariants and state equation in 665 ms returned []
Implicit Place search using SMT with State Equation took 1031 ms to find 0 implicit places.
[2024-06-02 19:58:24] [INFO ] Redundant transitions in 413 ms returned []
Running 576 sub problems to find dead transitions.
[2024-06-02 19:58:24] [INFO ] Flow matrix only has 579 transitions (discarded 25 similar events)
[2024-06-02 19:58:24] [INFO ] Invariant cache hit.
[2024-06-02 19:58:24] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 2 (OVERLAPS) 1/195 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-02 19:58:29] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 1 ms to minimize.
[2024-06-02 19:58:29] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 3 ms to minimize.
[2024-06-02 19:58:29] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
[2024-06-02 19:58:29] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
[2024-06-02 19:58:29] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
[2024-06-02 19:58:30] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 1 ms to minimize.
[2024-06-02 19:58:30] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 0 ms to minimize.
[2024-06-02 19:58:30] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 5 ms to minimize.
[2024-06-02 19:58:30] [INFO ] Deduced a trap composed of 40 places in 107 ms of which 1 ms to minimize.
[2024-06-02 19:58:31] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 5 (OVERLAPS) 578/773 variables, 195/215 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/773 variables, 68/283 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/773 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-02 19:58:47] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/773 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 773/774 variables, and 284 constraints, problems are : Problem set: 0 solved, 576 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 195/195 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 576 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/194 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 3 (OVERLAPS) 1/195 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-02 19:58:58] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 2 ms to minimize.
[2024-06-02 19:58:58] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 576 unsolved
[2024-06-02 19:59:01] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 8 (OVERLAPS) 578/773 variables, 195/219 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/773 variables, 68/287 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/773 variables, 576/863 constraints. Problems are: Problem set: 0 solved, 576 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/773 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 576 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 773/774 variables, and 863 constraints, problems are : Problem set: 0 solved, 576 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 195/195 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 576/576 constraints, Known Traps: 14/14 constraints]
After SMT, in 60681ms problems are : Problem set: 0 solved, 576 unsolved
Search for dead transitions found 0 dead transitions in 60698ms
Starting structural reductions in SI_LTL mode, iteration 1 : 195/434 places, 604/771 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62340 ms. Remains : 195/434 places, 604/771 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-19-LTLFireability-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-19-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLFireability-06 finished in 62385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(p0)&&F(G(p1))))&&(p2||G(p3)))))'
Support contains 5 out of 434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 423 transition count 730
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 423 transition count 730
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 420 transition count 727
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 420 transition count 727
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 420 transition count 726
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 419 transition count 725
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 419 transition count 725
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 418 transition count 724
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 418 transition count 724
Applied a total of 33 rules in 32 ms. Remains 418 /434 variables (removed 16) and now considering 724/771 (removed 47) transitions.
// Phase 1: matrix 724 rows 418 cols
[2024-06-02 19:59:25] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:59:25] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-06-02 19:59:25] [INFO ] Invariant cache hit.
[2024-06-02 19:59:26] [INFO ] Implicit Places using invariants and state equation in 685 ms returned []
Implicit Place search using SMT with State Equation took 963 ms to find 0 implicit places.
Running 723 sub problems to find dead transitions.
[2024-06-02 19:59:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (OVERLAPS) 1/418 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 19:59:35] [INFO ] Deduced a trap composed of 85 places in 73 ms of which 1 ms to minimize.
[2024-06-02 19:59:36] [INFO ] Deduced a trap composed of 86 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:59:37] [INFO ] Deduced a trap composed of 86 places in 60 ms of which 0 ms to minimize.
[2024-06-02 19:59:38] [INFO ] Deduced a trap composed of 54 places in 104 ms of which 2 ms to minimize.
[2024-06-02 19:59:38] [INFO ] Deduced a trap composed of 55 places in 126 ms of which 2 ms to minimize.
[2024-06-02 19:59:38] [INFO ] Deduced a trap composed of 73 places in 128 ms of which 2 ms to minimize.
[2024-06-02 19:59:42] [INFO ] Deduced a trap composed of 72 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 19:59:43] [INFO ] Deduced a trap composed of 75 places in 63 ms of which 1 ms to minimize.
[2024-06-02 19:59:43] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 19:59:54] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 418/1142 variables, and 20 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/418 constraints, PredecessorRefiner: 723/723 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 723 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 1 (OVERLAPS) 1/418 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/418 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 20:00:03] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/418 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 723 unsolved
[2024-06-02 20:00:08] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/418 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/418 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 6 (OVERLAPS) 724/1142 variables, 418/440 constraints. Problems are: Problem set: 0 solved, 723 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1142 variables, 723/1163 constraints. Problems are: Problem set: 0 solved, 723 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1142/1142 variables, and 1163 constraints, problems are : Problem set: 0 solved, 723 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 418/418 constraints, PredecessorRefiner: 723/723 constraints, Known Traps: 12/12 constraints]
After SMT, in 60361ms problems are : Problem set: 0 solved, 723 unsolved
Search for dead transitions found 0 dead transitions in 60369ms
Starting structural reductions in LTL mode, iteration 1 : 418/434 places, 724/771 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61366 ms. Remains : 418/434 places, 724/771 transitions.
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), true, (OR (NOT p0) (NOT p1)), (NOT p3), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-19-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-19-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLFireability-07 finished in 61676 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||(F(p0)&&(p1||F(p2))))))'
Support contains 4 out of 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Graph (trivial) has 330 edges and 434 vertex of which 18 / 434 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 418 transition count 679
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 80 rules applied. Total rules applied 156 place count 343 transition count 674
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 159 place count 341 transition count 673
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 160 place count 340 transition count 673
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 40 Pre rules applied. Total rules applied 160 place count 340 transition count 633
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 240 place count 300 transition count 633
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 244 place count 296 transition count 599
Iterating global reduction 4 with 4 rules applied. Total rules applied 248 place count 296 transition count 599
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 248 place count 296 transition count 597
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 252 place count 294 transition count 597
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 253 place count 293 transition count 596
Iterating global reduction 4 with 1 rules applied. Total rules applied 254 place count 293 transition count 596
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 256 place count 293 transition count 594
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 257 place count 292 transition count 594
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 6 with 88 rules applied. Total rules applied 345 place count 248 transition count 550
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -189
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 6 with 94 rules applied. Total rules applied 439 place count 201 transition count 739
Drop transitions (Redundant composition of simpler transitions.) removed 84 transitions
Redundant transition composition rules discarded 84 transitions
Iterating global reduction 6 with 84 rules applied. Total rules applied 523 place count 201 transition count 655
Applied a total of 523 rules in 72 ms. Remains 201 /434 variables (removed 233) and now considering 655/771 (removed 116) transitions.
[2024-06-02 20:00:26] [INFO ] Flow matrix only has 624 transitions (discarded 31 similar events)
// Phase 1: matrix 624 rows 201 cols
[2024-06-02 20:00:26] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 20:00:27] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-06-02 20:00:27] [INFO ] Flow matrix only has 624 transitions (discarded 31 similar events)
[2024-06-02 20:00:27] [INFO ] Invariant cache hit.
[2024-06-02 20:00:27] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-06-02 20:00:27] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
[2024-06-02 20:00:27] [INFO ] Redundant transitions in 55 ms returned []
Running 627 sub problems to find dead transitions.
[2024-06-02 20:00:27] [INFO ] Flow matrix only has 624 transitions (discarded 31 similar events)
[2024-06-02 20:00:27] [INFO ] Invariant cache hit.
[2024-06-02 20:00:27] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 2 (OVERLAPS) 1/201 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 627 unsolved
[2024-06-02 20:00:33] [INFO ] Deduced a trap composed of 56 places in 112 ms of which 1 ms to minimize.
[2024-06-02 20:00:33] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 1 ms to minimize.
[2024-06-02 20:00:33] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
[2024-06-02 20:00:33] [INFO ] Deduced a trap composed of 72 places in 106 ms of which 1 ms to minimize.
[2024-06-02 20:00:33] [INFO ] Deduced a trap composed of 70 places in 101 ms of which 1 ms to minimize.
[2024-06-02 20:00:33] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 2 ms to minimize.
[2024-06-02 20:00:34] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 0 ms to minimize.
[2024-06-02 20:00:34] [INFO ] Deduced a trap composed of 37 places in 126 ms of which 2 ms to minimize.
[2024-06-02 20:00:34] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 1 ms to minimize.
[2024-06-02 20:00:34] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 2 ms to minimize.
[2024-06-02 20:00:34] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 1 ms to minimize.
[2024-06-02 20:00:34] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 5 (OVERLAPS) 623/824 variables, 201/223 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/824 variables, 69/292 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/824 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 8 (OVERLAPS) 0/824 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 627 unsolved
No progress, stopping.
After SMT solving in domain Real declared 824/825 variables, and 292 constraints, problems are : Problem set: 0 solved, 627 unsolved in 27885 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 627/627 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 627 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/200 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 3 (OVERLAPS) 1/201 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 6 (OVERLAPS) 623/824 variables, 201/223 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/824 variables, 69/292 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/824 variables, 627/919 constraints. Problems are: Problem set: 0 solved, 627 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/824 variables, 0/919 constraints. Problems are: Problem set: 0 solved, 627 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 824/825 variables, and 919 constraints, problems are : Problem set: 0 solved, 627 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 201/201 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 627/627 constraints, Known Traps: 12/12 constraints]
After SMT, in 58529ms problems are : Problem set: 0 solved, 627 unsolved
Search for dead transitions found 0 dead transitions in 58534ms
Starting structural reductions in SI_LTL mode, iteration 1 : 201/434 places, 655/771 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59400 ms. Remains : 201/434 places, 655/771 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p2)]
Running random walk in product with property : FireWire-PT-19-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-19-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLFireability-08 finished in 59551 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) U p1)) U p2) U G(!p3)))'
Support contains 5 out of 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Graph (trivial) has 337 edges and 434 vertex of which 18 / 434 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 418 transition count 675
Reduce places removed 79 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 84 rules applied. Total rules applied 164 place count 339 transition count 670
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 166 place count 337 transition count 670
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 166 place count 337 transition count 629
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 248 place count 296 transition count 629
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 251 place count 293 transition count 597
Iterating global reduction 3 with 3 rules applied. Total rules applied 254 place count 293 transition count 597
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 254 place count 293 transition count 595
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 258 place count 291 transition count 595
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 259 place count 290 transition count 594
Iterating global reduction 3 with 1 rules applied. Total rules applied 260 place count 290 transition count 594
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 262 place count 290 transition count 592
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 263 place count 289 transition count 592
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 353 place count 244 transition count 547
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -193
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 5 with 94 rules applied. Total rules applied 447 place count 197 transition count 740
Drop transitions (Redundant composition of simpler transitions.) removed 87 transitions
Redundant transition composition rules discarded 87 transitions
Iterating global reduction 5 with 87 rules applied. Total rules applied 534 place count 197 transition count 653
Applied a total of 534 rules in 66 ms. Remains 197 /434 variables (removed 237) and now considering 653/771 (removed 118) transitions.
[2024-06-02 20:01:26] [INFO ] Flow matrix only has 620 transitions (discarded 33 similar events)
// Phase 1: matrix 620 rows 197 cols
[2024-06-02 20:01:26] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 20:01:26] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-06-02 20:01:26] [INFO ] Flow matrix only has 620 transitions (discarded 33 similar events)
[2024-06-02 20:01:26] [INFO ] Invariant cache hit.
[2024-06-02 20:01:26] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-06-02 20:01:27] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
[2024-06-02 20:01:27] [INFO ] Redundant transitions in 59 ms returned []
Running 625 sub problems to find dead transitions.
[2024-06-02 20:01:27] [INFO ] Flow matrix only has 620 transitions (discarded 33 similar events)
[2024-06-02 20:01:27] [INFO ] Invariant cache hit.
[2024-06-02 20:01:27] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 2 (OVERLAPS) 1/197 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 625 unsolved
[2024-06-02 20:01:32] [INFO ] Deduced a trap composed of 53 places in 105 ms of which 2 ms to minimize.
[2024-06-02 20:01:32] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 1 ms to minimize.
[2024-06-02 20:01:33] [INFO ] Deduced a trap composed of 34 places in 102 ms of which 1 ms to minimize.
[2024-06-02 20:01:33] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 1 ms to minimize.
[2024-06-02 20:01:33] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 2 ms to minimize.
[2024-06-02 20:01:33] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2024-06-02 20:01:33] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-06-02 20:01:33] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 0 ms to minimize.
[2024-06-02 20:01:33] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 1 ms to minimize.
[2024-06-02 20:01:34] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 0 ms to minimize.
[2024-06-02 20:01:34] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
[2024-06-02 20:01:34] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 625 unsolved
[2024-06-02 20:01:40] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 6 (OVERLAPS) 619/816 variables, 197/220 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/816 variables, 69/289 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/816 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 625 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 816/817 variables, and 289 constraints, problems are : Problem set: 0 solved, 625 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 625/625 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 625 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 3 (OVERLAPS) 1/197 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 6 (OVERLAPS) 619/816 variables, 197/220 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/816 variables, 69/289 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/816 variables, 625/914 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/816 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 625 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 816/817 variables, and 914 constraints, problems are : Problem set: 0 solved, 625 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 625/625 constraints, Known Traps: 13/13 constraints]
After SMT, in 60693ms problems are : Problem set: 0 solved, 625 unsolved
Search for dead transitions found 0 dead transitions in 60699ms
Starting structural reductions in SI_LTL mode, iteration 1 : 197/434 places, 653/771 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61480 ms. Remains : 197/434 places, 653/771 transitions.
Stuttering acceptance computed with spot in 347 ms :[p3, (NOT p0), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p0) p3 p1), (AND (NOT p1) p2 p3)]
Running random walk in product with property : FireWire-PT-19-LTLFireability-09
Product exploration explored 100000 steps with 39990 reset in 384 ms.
Product exploration explored 100000 steps with 40087 reset in 386 ms.
Computed a total of 7 stabilizing places and 39 stable transitions
Computed a total of 7 stabilizing places and 39 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND p3 p1 (NOT p0)))), (X (NOT (AND p3 p2))), (X (NOT (AND p3 (NOT p2) (NOT p1)))), (X (NOT (AND p3 p2 (NOT p1)))), (X (NOT p3)), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND p3 (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p3) p1 (NOT p0)))), (X (NOT (AND (NOT p3) p2 (NOT p1) (NOT p0)))), (X (NOT (AND p3 (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND p3 p2 (NOT p1) (NOT p0)))), (X (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p3 p1 (NOT p0))))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), (X (X (NOT (AND p3 p2 (NOT p1))))), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND p3 p2 (NOT p1) (NOT p0))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 39 factoid took 167 ms. Reduced automaton from 7 states, 25 edges and 4 AP (stutter insensitive) to 7 states, 25 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 305 ms :[p3, (NOT p0), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p0) p3 p1), (AND (NOT p1) p2 p3)]
RANDOM walk for 40000 steps (2417 resets) in 754 ms. (52 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (31 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (33 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (33 resets) in 42 ms. (93 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (33 resets) in 55 ms. (71 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (36 resets) in 44 ms. (88 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (34 resets) in 55 ms. (71 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (31 resets) in 77 ms. (51 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (32 resets) in 50 ms. (78 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (35 resets) in 54 ms. (72 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (32 resets) in 74 ms. (53 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (33 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (34 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (31 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (33 resets) in 10 ms. (363 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (34 resets) in 13 ms. (286 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (33 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (32 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (30 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (30 resets) in 9 ms. (400 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 281019 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :10 out of 19
Probabilistic random walk after 281019 steps, saw 89452 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :10
[2024-06-02 20:02:32] [INFO ] Flow matrix only has 620 transitions (discarded 33 similar events)
[2024-06-02 20:02:32] [INFO ] Invariant cache hit.
[2024-06-02 20:02:33] [INFO ] State equation strengthened by 69 read => feed constraints.
Problem apf6 is UNSAT
Problem apf12 is UNSAT
Problem apf13 is UNSAT
Problem apf14 is UNSAT
Problem apf18 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 156/161 variables, 4/4 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 30/191 variables, 6/10 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/10 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 619/810 variables, 191/201 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/810 variables, 69/270 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/810 variables, 0/270 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 6/816 variables, 6/276 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/816 variables, 0/276 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/816 variables, 0/276 constraints. Problems are: Problem set: 5 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 816/817 variables, and 276 constraints, problems are : Problem set: 5 solved, 4 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 156/161 variables, 4/4 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/191 variables, 6/10 constraints. Problems are: Problem set: 5 solved, 4 unsolved
[2024-06-02 20:02:33] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 1/11 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/11 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 619/810 variables, 191/202 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/810 variables, 69/271 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/810 variables, 4/275 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/810 variables, 0/275 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 6/816 variables, 6/281 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/816 variables, 0/281 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/816 variables, 0/281 constraints. Problems are: Problem set: 5 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 816/817 variables, and 281 constraints, problems are : Problem set: 5 solved, 4 unsolved in 768 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 4/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 1125ms problems are : Problem set: 5 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1615 ms.
Support contains 5 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 653/653 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 197 transition count 650
Free-agglomeration rule applied 30 times.
Iterating global reduction 1 with 30 rules applied. Total rules applied 33 place count 197 transition count 620
Reduce places removed 30 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 72 place count 167 transition count 611
Drop transitions (Redundant composition of simpler transitions.) removed 85 transitions
Redundant transition composition rules discarded 85 transitions
Iterating global reduction 2 with 85 rules applied. Total rules applied 157 place count 167 transition count 526
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 163 place count 167 transition count 526
Applied a total of 163 rules in 32 ms. Remains 167 /197 variables (removed 30) and now considering 526/653 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 167/197 places, 526/653 transitions.
RANDOM walk for 18210 steps (725 resets) in 221 ms. (82 steps per ms) remains 0/4 properties
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND p3 p1 (NOT p0)))), (X (NOT (AND p3 p2))), (X (NOT (AND p3 (NOT p2) (NOT p1)))), (X (NOT (AND p3 p2 (NOT p1)))), (X (NOT p3)), (X (AND (NOT p3) (NOT p2))), (X (NOT (AND p3 (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p3) p1 (NOT p0)))), (X (NOT (AND (NOT p3) p2 (NOT p1) (NOT p0)))), (X (NOT (AND p3 (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND p3 p2 (NOT p1) (NOT p0)))), (X (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p3 p1 (NOT p0))))), (X (X (NOT (AND p3 p2)))), (X (X (NOT (AND p3 (NOT p2) (NOT p1))))), (X (X (NOT (AND p3 p2 (NOT p1))))), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) p1 (NOT p0))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1) (NOT p0))))), (X (X (NOT (AND p3 (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND p3 p2 (NOT p1) (NOT p0))))), (X (X (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR p1 (NOT p3) p2)), (G (OR p0 p1 (NOT p3) p2)), (G (OR p3 (NOT p2))), (G (OR p0 p1 p3 (NOT p2))), (G (OR p0 (NOT p1) p3))]
False Knowledge obtained : [(F (NOT (AND (NOT p3) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (F (NOT (OR (NOT p3) p2))), (F p3), (F (NOT (OR p1 (NOT p3) (NOT p2)))), (F (NOT (OR p0 p1 (NOT p3) (NOT p2)))), (F (NOT (OR p0 (NOT p1) (NOT p3)))), (F p2), (F p1), (F (NOT (AND (NOT p1) (NOT p2)))), (F p0), (F (NOT (OR (NOT p3) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 44 factoid took 761 ms. Reduced automaton from 7 states, 25 edges and 4 AP (stutter insensitive) to 7 states, 22 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 317 ms :[(OR p3 (AND (NOT p1) p2) (AND (NOT p0) p1)), (NOT p0), (NOT p1), (NOT p1), (OR (NOT p2) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) p3 p1), (AND (NOT p1) p2 p3)]
Stuttering acceptance computed with spot in 301 ms :[(OR p3 (AND (NOT p1) p2) (AND (NOT p0) p1)), (NOT p0), (NOT p1), (NOT p1), (OR (NOT p2) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) p3 p1), (AND (NOT p1) p2 p3)]
Support contains 5 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 653/653 transitions.
Applied a total of 0 rules in 12 ms. Remains 197 /197 variables (removed 0) and now considering 653/653 (removed 0) transitions.
[2024-06-02 20:02:37] [INFO ] Flow matrix only has 620 transitions (discarded 33 similar events)
[2024-06-02 20:02:37] [INFO ] Invariant cache hit.
[2024-06-02 20:02:37] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 20:02:37] [INFO ] Flow matrix only has 620 transitions (discarded 33 similar events)
[2024-06-02 20:02:37] [INFO ] Invariant cache hit.
[2024-06-02 20:02:37] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-06-02 20:02:37] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
[2024-06-02 20:02:38] [INFO ] Redundant transitions in 55 ms returned []
Running 625 sub problems to find dead transitions.
[2024-06-02 20:02:38] [INFO ] Flow matrix only has 620 transitions (discarded 33 similar events)
[2024-06-02 20:02:38] [INFO ] Invariant cache hit.
[2024-06-02 20:02:38] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 2 (OVERLAPS) 1/197 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 625 unsolved
[2024-06-02 20:02:43] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 1 ms to minimize.
[2024-06-02 20:02:43] [INFO ] Deduced a trap composed of 76 places in 118 ms of which 1 ms to minimize.
[2024-06-02 20:02:43] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 1 ms to minimize.
[2024-06-02 20:02:44] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2024-06-02 20:02:44] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 2 ms to minimize.
[2024-06-02 20:02:44] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2024-06-02 20:02:44] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:02:44] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 0 ms to minimize.
[2024-06-02 20:02:44] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 0 ms to minimize.
[2024-06-02 20:02:44] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-06-02 20:02:45] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:02:45] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 625 unsolved
[2024-06-02 20:02:51] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 6 (OVERLAPS) 619/816 variables, 197/220 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/816 variables, 69/289 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/816 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 625 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 816/817 variables, and 289 constraints, problems are : Problem set: 0 solved, 625 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 625/625 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 625 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 3 (OVERLAPS) 1/197 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 6 (OVERLAPS) 619/816 variables, 197/220 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/816 variables, 69/289 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/816 variables, 625/914 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/816 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 625 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 816/817 variables, and 914 constraints, problems are : Problem set: 0 solved, 625 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 625/625 constraints, Known Traps: 13/13 constraints]
After SMT, in 60690ms problems are : Problem set: 0 solved, 625 unsolved
Search for dead transitions found 0 dead transitions in 60696ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61417 ms. Remains : 197/197 places, 653/653 transitions.
Computed a total of 7 stabilizing places and 39 stable transitions
Computed a total of 7 stabilizing places and 39 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0))), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT p3)), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p2 p3))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p3 (NOT p0)))), (X (AND (NOT p2) (NOT p3))), (X (NOT (OR (AND (NOT p1) (NOT p2) p3) (AND (NOT p1) p2 (NOT p3))))), (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) p2 p3 (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p2) p3 (NOT p0)) (AND p1 (NOT p3) (NOT p0)) (AND p2 (NOT p3) (NOT p0))))), (X (NOT (OR (AND (NOT p2) p3) (AND p2 (NOT p3))))), (X (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 p3)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p3 (NOT p0))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) p3) (AND (NOT p1) p2 (NOT p3)))))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 p3 (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) p3 (NOT p0)) (AND p1 (NOT p3) (NOT p0)) (AND p2 (NOT p3) (NOT p0)))))), (X (X (NOT (OR (AND (NOT p2) p3) (AND p2 (NOT p3)))))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 35 factoid took 225 ms. Reduced automaton from 7 states, 22 edges and 4 AP (stutter insensitive) to 7 states, 22 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 292 ms :[(OR p3 (AND (NOT p1) p2) (AND (NOT p0) p1)), (NOT p0), (NOT p1), (NOT p1), (OR (NOT p2) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) p3 p1), (AND (NOT p1) p2 p3)]
RANDOM walk for 40000 steps (2428 resets) in 546 ms. (73 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (33 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (31 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (33 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (35 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (35 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (34 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (35 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (35 resets) in 29 ms. (133 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (34 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (34 resets) in 25 ms. (154 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (35 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (35 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (31 resets) in 51 ms. (77 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (34 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (38 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (34 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (35 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 179896 steps, run timeout after 3006 ms. (steps per millisecond=59 ) properties seen :11 out of 17
Probabilistic random walk after 179896 steps, saw 55229 distinct states, run finished after 3007 ms. (steps per millisecond=59 ) properties seen :11
[2024-06-02 20:03:42] [INFO ] Flow matrix only has 620 transitions (discarded 33 similar events)
[2024-06-02 20:03:42] [INFO ] Invariant cache hit.
[2024-06-02 20:03:42] [INFO ] State equation strengthened by 69 read => feed constraints.
Problem apf9 is UNSAT
Problem apf12 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 156/161 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/191 variables, 6/10 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 619/810 variables, 191/201 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/810 variables, 69/270 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/810 variables, 0/270 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 6/816 variables, 6/276 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/816 variables, 0/276 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/816 variables, 0/276 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 816/817 variables, and 276 constraints, problems are : Problem set: 2 solved, 4 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 156/161 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/191 variables, 6/10 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-06-02 20:03:43] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 1/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 619/810 variables, 191/202 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/810 variables, 69/271 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/810 variables, 4/275 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/810 variables, 0/275 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 6/816 variables, 6/281 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/816 variables, 0/281 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/816 variables, 0/281 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 816/817 variables, and 281 constraints, problems are : Problem set: 2 solved, 4 unsolved in 717 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 1106ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 315 ms.
Support contains 5 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 653/653 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 197 transition count 650
Free-agglomeration rule applied 30 times.
Iterating global reduction 1 with 30 rules applied. Total rules applied 33 place count 197 transition count 620
Reduce places removed 30 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 72 place count 167 transition count 611
Drop transitions (Redundant composition of simpler transitions.) removed 85 transitions
Redundant transition composition rules discarded 85 transitions
Iterating global reduction 2 with 85 rules applied. Total rules applied 157 place count 167 transition count 526
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 163 place count 167 transition count 526
Applied a total of 163 rules in 33 ms. Remains 167 /197 variables (removed 30) and now considering 526/653 (removed 127) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 167/197 places, 526/653 transitions.
RANDOM walk for 10726 steps (428 resets) in 152 ms. (70 steps per ms) remains 0/4 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0))), (X (NOT (AND (NOT p1) p2 p3))), (X (NOT p3)), (X (NOT (AND (NOT p2) p3))), (X (NOT (AND p2 p3))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p3 (NOT p0)))), (X (AND (NOT p2) (NOT p3))), (X (NOT (OR (AND (NOT p1) (NOT p2) p3) (AND (NOT p1) p2 (NOT p3))))), (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p1) p2 p3 (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p2) p3 (NOT p0)) (AND p1 (NOT p3) (NOT p0)) (AND p2 (NOT p3) (NOT p0))))), (X (NOT (OR (AND (NOT p2) p3) (AND p2 (NOT p3))))), (X (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 p3)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND p2 p3)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p3 (NOT p0))))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) p3) (AND (NOT p1) p2 (NOT p3)))))), (X (X (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) p2 p3 (NOT p0))))), (X (X (NOT (OR (AND (NOT p1) (NOT p2) p3 (NOT p0)) (AND p1 (NOT p3) (NOT p0)) (AND p2 (NOT p3) (NOT p0)))))), (X (X (NOT (OR (AND (NOT p2) p3) (AND p2 (NOT p3)))))), (X (X (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (AND (OR p1 p2 (NOT p3)) (OR p1 (NOT p2) p3))), (G (AND (OR p1 p2 (NOT p3) p0) (OR (NOT p1) p3 p0) (OR (NOT p2) p3 p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p1) (NOT p3) p0))), (F p0), (F (NOT (OR p2 (NOT p3)))), (F (NOT (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0))))), (F p3), (F (NOT (AND (OR p2 (NOT p3)) (OR (NOT p2) p3)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p3)))), (F p2), (F (NOT (OR p1 (NOT p2) (NOT p3)))), (F p1), (F (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)))), (F (NOT (OR p1 (NOT p2) (NOT p3) p0))), (F (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))))]
Knowledge based reduction with 37 factoid took 703 ms. Reduced automaton from 7 states, 22 edges and 4 AP (stutter insensitive) to 7 states, 22 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 352 ms :[(OR p3 (AND (NOT p1) p2) (AND (NOT p0) p1)), (NOT p0), (NOT p1), (NOT p1), (OR (NOT p2) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) p3 p1), (AND (NOT p1) p2 p3)]
Stuttering acceptance computed with spot in 338 ms :[(OR p3 (AND (NOT p1) p2) (AND (NOT p0) p1)), (NOT p0), (NOT p1), (NOT p1), (OR (NOT p2) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) p3 p1), (AND (NOT p1) p2 p3)]
Stuttering acceptance computed with spot in 340 ms :[(OR p3 (AND (NOT p1) p2) (AND (NOT p0) p1)), (NOT p0), (NOT p1), (NOT p1), (OR (NOT p2) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) p3 p1), (AND (NOT p1) p2 p3)]
Product exploration explored 100000 steps with 39992 reset in 368 ms.
Product exploration explored 100000 steps with 39990 reset in 374 ms.
Support contains 5 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 653/653 transitions.
Applied a total of 0 rules in 10 ms. Remains 197 /197 variables (removed 0) and now considering 653/653 (removed 0) transitions.
[2024-06-02 20:03:46] [INFO ] Flow matrix only has 620 transitions (discarded 33 similar events)
[2024-06-02 20:03:46] [INFO ] Invariant cache hit.
[2024-06-02 20:03:46] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-02 20:03:46] [INFO ] Flow matrix only has 620 transitions (discarded 33 similar events)
[2024-06-02 20:03:46] [INFO ] Invariant cache hit.
[2024-06-02 20:03:46] [INFO ] State equation strengthened by 69 read => feed constraints.
[2024-06-02 20:03:47] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
[2024-06-02 20:03:47] [INFO ] Redundant transitions in 64 ms returned []
Running 625 sub problems to find dead transitions.
[2024-06-02 20:03:47] [INFO ] Flow matrix only has 620 transitions (discarded 33 similar events)
[2024-06-02 20:03:47] [INFO ] Invariant cache hit.
[2024-06-02 20:03:47] [INFO ] State equation strengthened by 69 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 2 (OVERLAPS) 1/197 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 625 unsolved
[2024-06-02 20:03:53] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 2 ms to minimize.
[2024-06-02 20:03:53] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 1 ms to minimize.
[2024-06-02 20:03:53] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 1 ms to minimize.
[2024-06-02 20:03:53] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 1 ms to minimize.
[2024-06-02 20:03:53] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
[2024-06-02 20:03:53] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-06-02 20:03:53] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 0 ms to minimize.
[2024-06-02 20:03:54] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-06-02 20:03:54] [INFO ] Deduced a trap composed of 41 places in 38 ms of which 0 ms to minimize.
[2024-06-02 20:03:54] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-06-02 20:03:55] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-06-02 20:03:55] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 625 unsolved
[2024-06-02 20:04:00] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 6 (OVERLAPS) 619/816 variables, 197/220 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/816 variables, 69/289 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/816 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 625 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 816/817 variables, and 289 constraints, problems are : Problem set: 0 solved, 625 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 625/625 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 625 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 3 (OVERLAPS) 1/197 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 6 (OVERLAPS) 619/816 variables, 197/220 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/816 variables, 69/289 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/816 variables, 625/914 constraints. Problems are: Problem set: 0 solved, 625 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/816 variables, 0/914 constraints. Problems are: Problem set: 0 solved, 625 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 816/817 variables, and 914 constraints, problems are : Problem set: 0 solved, 625 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 197/197 constraints, ReadFeed: 69/69 constraints, PredecessorRefiner: 625/625 constraints, Known Traps: 13/13 constraints]
After SMT, in 60670ms problems are : Problem set: 0 solved, 625 unsolved
Search for dead transitions found 0 dead transitions in 60676ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61415 ms. Remains : 197/197 places, 653/653 transitions.
Treatment of property FireWire-PT-19-LTLFireability-09 finished in 201825 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)||(G((p2||X(X(p3))))&&p1))))'
Support contains 4 out of 434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 424 transition count 731
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 424 transition count 731
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 422 transition count 729
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 422 transition count 729
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 421 transition count 728
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 421 transition count 728
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 420 transition count 727
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 420 transition count 727
Applied a total of 28 rules in 21 ms. Remains 420 /434 variables (removed 14) and now considering 727/771 (removed 44) transitions.
// Phase 1: matrix 727 rows 420 cols
[2024-06-02 20:04:48] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 20:04:48] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-06-02 20:04:48] [INFO ] Invariant cache hit.
[2024-06-02 20:04:48] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
Running 726 sub problems to find dead transitions.
[2024-06-02 20:04:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (OVERLAPS) 1/420 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-06-02 20:04:58] [INFO ] Deduced a trap composed of 85 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:04:59] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:04:59] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-06-02 20:05:00] [INFO ] Deduced a trap composed of 88 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:05:01] [INFO ] Deduced a trap composed of 86 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:05:01] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 2 ms to minimize.
[2024-06-02 20:05:01] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 2 ms to minimize.
[2024-06-02 20:05:01] [INFO ] Deduced a trap composed of 73 places in 111 ms of which 1 ms to minimize.
[2024-06-02 20:05:05] [INFO ] Deduced a trap composed of 72 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-06-02 20:05:06] [INFO ] Deduced a trap composed of 74 places in 52 ms of which 1 ms to minimize.
[2024-06-02 20:05:06] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-06-02 20:05:07] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 726 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 420/1147 variables, and 22 constraints, problems are : Problem set: 0 solved, 726 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/420 constraints, PredecessorRefiner: 726/726 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 726 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 1 (OVERLAPS) 1/420 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 4 (OVERLAPS) 727/1147 variables, 420/442 constraints. Problems are: Problem set: 0 solved, 726 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1147 variables, 726/1168 constraints. Problems are: Problem set: 0 solved, 726 unsolved
[2024-06-02 20:05:37] [INFO ] Deduced a trap composed of 218 places in 156 ms of which 3 ms to minimize.
[2024-06-02 20:05:37] [INFO ] Deduced a trap composed of 208 places in 148 ms of which 2 ms to minimize.
[2024-06-02 20:05:40] [INFO ] Deduced a trap composed of 138 places in 153 ms of which 3 ms to minimize.
[2024-06-02 20:05:40] [INFO ] Deduced a trap composed of 143 places in 145 ms of which 6 ms to minimize.
[2024-06-02 20:05:40] [INFO ] Deduced a trap composed of 130 places in 135 ms of which 3 ms to minimize.
[2024-06-02 20:05:41] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1147/1147 variables, and 1174 constraints, problems are : Problem set: 0 solved, 726 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 726/726 constraints, Known Traps: 18/18 constraints]
After SMT, in 60299ms problems are : Problem set: 0 solved, 726 unsolved
Search for dead transitions found 0 dead transitions in 60306ms
Starting structural reductions in LTL mode, iteration 1 : 420/434 places, 727/771 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60998 ms. Remains : 420/434 places, 727/771 transitions.
Stuttering acceptance computed with spot in 398 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (NOT p0), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : FireWire-PT-19-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-19-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLFireability-10 finished in 61438 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((!p0&&X(!p0))) U p1))'
Support contains 3 out of 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Graph (trivial) has 337 edges and 434 vertex of which 18 / 434 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 418 transition count 677
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 82 rules applied. Total rules applied 160 place count 341 transition count 672
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 162 place count 339 transition count 672
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 162 place count 339 transition count 631
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 244 place count 298 transition count 631
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 249 place count 293 transition count 567
Iterating global reduction 3 with 5 rules applied. Total rules applied 254 place count 293 transition count 567
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 255 place count 293 transition count 566
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 255 place count 293 transition count 564
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 259 place count 291 transition count 564
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 260 place count 290 transition count 563
Iterating global reduction 4 with 1 rules applied. Total rules applied 261 place count 290 transition count 563
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 263 place count 290 transition count 561
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 264 place count 289 transition count 561
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 6 with 90 rules applied. Total rules applied 354 place count 244 transition count 516
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -140
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 450 place count 196 transition count 656
Drop transitions (Redundant composition of simpler transitions.) removed 59 transitions
Redundant transition composition rules discarded 59 transitions
Iterating global reduction 6 with 59 rules applied. Total rules applied 509 place count 196 transition count 597
Applied a total of 509 rules in 57 ms. Remains 196 /434 variables (removed 238) and now considering 597/771 (removed 174) transitions.
[2024-06-02 20:05:49] [INFO ] Flow matrix only has 570 transitions (discarded 27 similar events)
// Phase 1: matrix 570 rows 196 cols
[2024-06-02 20:05:49] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 20:05:49] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-02 20:05:49] [INFO ] Flow matrix only has 570 transitions (discarded 27 similar events)
[2024-06-02 20:05:49] [INFO ] Invariant cache hit.
[2024-06-02 20:05:49] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-02 20:05:50] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2024-06-02 20:05:50] [INFO ] Redundant transitions in 63 ms returned []
Running 578 sub problems to find dead transitions.
[2024-06-02 20:05:50] [INFO ] Flow matrix only has 570 transitions (discarded 27 similar events)
[2024-06-02 20:05:50] [INFO ] Invariant cache hit.
[2024-06-02 20:05:50] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 2 (OVERLAPS) 1/196 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 578 unsolved
[2024-06-02 20:05:55] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 1 ms to minimize.
[2024-06-02 20:05:55] [INFO ] Deduced a trap composed of 51 places in 109 ms of which 2 ms to minimize.
[2024-06-02 20:05:55] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 0 ms to minimize.
[2024-06-02 20:05:55] [INFO ] Deduced a trap composed of 72 places in 111 ms of which 1 ms to minimize.
[2024-06-02 20:05:55] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
[2024-06-02 20:05:55] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 1 ms to minimize.
[2024-06-02 20:05:56] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 0 ms to minimize.
[2024-06-02 20:05:56] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 1 ms to minimize.
[2024-06-02 20:05:56] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-06-02 20:05:56] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:05:57] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-06-02 20:05:57] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2024-06-02 20:05:57] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 13/23 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 5 (OVERLAPS) 569/765 variables, 196/219 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/765 variables, 68/287 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 8 (OVERLAPS) 0/765 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 578 unsolved
No progress, stopping.
After SMT solving in domain Real declared 765/766 variables, and 287 constraints, problems are : Problem set: 0 solved, 578 unsolved in 25587 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 196/196 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 578/578 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 578 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/195 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 3 (OVERLAPS) 1/196 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 6 (OVERLAPS) 569/765 variables, 196/219 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/765 variables, 68/287 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/765 variables, 578/865 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/765 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/766 variables, and 865 constraints, problems are : Problem set: 0 solved, 578 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 196/196 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 578/578 constraints, Known Traps: 13/13 constraints]
After SMT, in 56145ms problems are : Problem set: 0 solved, 578 unsolved
Search for dead transitions found 0 dead transitions in 56151ms
Starting structural reductions in SI_LTL mode, iteration 1 : 196/434 places, 597/771 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56836 ms. Remains : 196/434 places, 597/771 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), true, p0]
Running random walk in product with property : FireWire-PT-19-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-19-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLFireability-11 finished in 56938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((F(G(p0)) U p1)))))'
Support contains 3 out of 434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 424 transition count 731
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 424 transition count 731
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 421 transition count 728
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 421 transition count 728
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 421 transition count 727
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 420 transition count 726
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 420 transition count 726
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 419 transition count 725
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 419 transition count 725
Applied a total of 31 rules in 24 ms. Remains 419 /434 variables (removed 15) and now considering 725/771 (removed 46) transitions.
// Phase 1: matrix 725 rows 419 cols
[2024-06-02 20:06:46] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 20:06:46] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-06-02 20:06:46] [INFO ] Invariant cache hit.
[2024-06-02 20:06:47] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
Running 724 sub problems to find dead transitions.
[2024-06-02 20:06:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 1 (OVERLAPS) 1/419 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 724 unsolved
[2024-06-02 20:06:56] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 0 ms to minimize.
[2024-06-02 20:06:57] [INFO ] Deduced a trap composed of 85 places in 64 ms of which 1 ms to minimize.
[2024-06-02 20:06:58] [INFO ] Deduced a trap composed of 86 places in 50 ms of which 1 ms to minimize.
[2024-06-02 20:06:58] [INFO ] Deduced a trap composed of 73 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:06:59] [INFO ] Deduced a trap composed of 86 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:06:59] [INFO ] Deduced a trap composed of 55 places in 125 ms of which 1 ms to minimize.
[2024-06-02 20:06:59] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 2 ms to minimize.
[2024-06-02 20:07:03] [INFO ] Deduced a trap composed of 72 places in 56 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 724 unsolved
[2024-06-02 20:07:06] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/419 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 724 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 419/1144 variables, and 19 constraints, problems are : Problem set: 0 solved, 724 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/419 constraints, PredecessorRefiner: 724/724 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 724 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 1 (OVERLAPS) 1/419 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/419 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 4 (OVERLAPS) 725/1144 variables, 419/438 constraints. Problems are: Problem set: 0 solved, 724 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1144 variables, 724/1162 constraints. Problems are: Problem set: 0 solved, 724 unsolved
[2024-06-02 20:07:35] [INFO ] Deduced a trap composed of 74 places in 119 ms of which 2 ms to minimize.
[2024-06-02 20:07:36] [INFO ] Deduced a trap composed of 263 places in 137 ms of which 3 ms to minimize.
[2024-06-02 20:07:36] [INFO ] Deduced a trap composed of 222 places in 146 ms of which 2 ms to minimize.
[2024-06-02 20:07:38] [INFO ] Deduced a trap composed of 212 places in 151 ms of which 2 ms to minimize.
[2024-06-02 20:07:38] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 1 ms to minimize.
[2024-06-02 20:07:39] [INFO ] Deduced a trap composed of 157 places in 154 ms of which 2 ms to minimize.
[2024-06-02 20:07:39] [INFO ] Deduced a trap composed of 141 places in 144 ms of which 3 ms to minimize.
[2024-06-02 20:07:39] [INFO ] Deduced a trap composed of 146 places in 154 ms of which 2 ms to minimize.
[2024-06-02 20:07:39] [INFO ] Deduced a trap composed of 142 places in 156 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1144/1144 variables, and 1171 constraints, problems are : Problem set: 0 solved, 724 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 419/419 constraints, PredecessorRefiner: 724/724 constraints, Known Traps: 18/18 constraints]
After SMT, in 60309ms problems are : Problem set: 0 solved, 724 unsolved
Search for dead transitions found 0 dead transitions in 60316ms
Starting structural reductions in LTL mode, iteration 1 : 419/434 places, 725/771 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61063 ms. Remains : 419/434 places, 725/771 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-19-LTLFireability-12
Stuttering criterion allowed to conclude after 152 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-19-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLFireability-12 finished in 61269 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((X(G(p0))&&G((p1&&(p2 U p3))))))'
Support contains 6 out of 434 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Graph (trivial) has 331 edges and 434 vertex of which 18 / 434 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 77 place count 418 transition count 678
Reduce places removed 76 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 80 rules applied. Total rules applied 157 place count 342 transition count 674
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 159 place count 340 transition count 674
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 159 place count 340 transition count 634
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 239 place count 300 transition count 634
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 244 place count 295 transition count 570
Iterating global reduction 3 with 5 rules applied. Total rules applied 249 place count 295 transition count 570
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 250 place count 295 transition count 569
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 250 place count 295 transition count 567
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 254 place count 293 transition count 567
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 255 place count 292 transition count 566
Iterating global reduction 4 with 1 rules applied. Total rules applied 256 place count 292 transition count 566
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 258 place count 292 transition count 564
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 259 place count 291 transition count 564
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 6 with 90 rules applied. Total rules applied 349 place count 246 transition count 519
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -152
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 6 with 92 rules applied. Total rules applied 441 place count 200 transition count 671
Drop transitions (Redundant composition of simpler transitions.) removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 6 with 57 rules applied. Total rules applied 498 place count 200 transition count 614
Applied a total of 498 rules in 49 ms. Remains 200 /434 variables (removed 234) and now considering 614/771 (removed 157) transitions.
[2024-06-02 20:07:47] [INFO ] Flow matrix only has 587 transitions (discarded 27 similar events)
// Phase 1: matrix 587 rows 200 cols
[2024-06-02 20:07:47] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 20:07:48] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-02 20:07:48] [INFO ] Flow matrix only has 587 transitions (discarded 27 similar events)
[2024-06-02 20:07:48] [INFO ] Invariant cache hit.
[2024-06-02 20:07:48] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-02 20:07:48] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
[2024-06-02 20:07:49] [INFO ] Redundant transitions in 803 ms returned []
Running 577 sub problems to find dead transitions.
[2024-06-02 20:07:49] [INFO ] Flow matrix only has 587 transitions (discarded 27 similar events)
[2024-06-02 20:07:49] [INFO ] Invariant cache hit.
[2024-06-02 20:07:49] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (OVERLAPS) 1/200 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 577 unsolved
[2024-06-02 20:07:54] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 1 ms to minimize.
[2024-06-02 20:07:54] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 2 ms to minimize.
[2024-06-02 20:07:54] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:07:54] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 1 ms to minimize.
[2024-06-02 20:07:55] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:07:55] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 0 ms to minimize.
[2024-06-02 20:07:55] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 1 ms to minimize.
[2024-06-02 20:07:55] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 1 ms to minimize.
[2024-06-02 20:07:56] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2024-06-02 20:07:56] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 0 ms to minimize.
[2024-06-02 20:07:56] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/200 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 577 unsolved
[2024-06-02 20:08:01] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 6 (OVERLAPS) 586/786 variables, 200/222 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/786 variables, 67/289 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/786 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 577 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 786/787 variables, and 289 constraints, problems are : Problem set: 0 solved, 577 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 200/200 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 577 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 3 (OVERLAPS) 1/200 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 6 (OVERLAPS) 586/786 variables, 200/222 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/786 variables, 67/289 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/786 variables, 577/866 constraints. Problems are: Problem set: 0 solved, 577 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/786 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 577 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 786/787 variables, and 866 constraints, problems are : Problem set: 0 solved, 577 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 200/200 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 577/577 constraints, Known Traps: 12/12 constraints]
After SMT, in 60545ms problems are : Problem set: 0 solved, 577 unsolved
Search for dead transitions found 0 dead transitions in 60549ms
Starting structural reductions in SI_LTL mode, iteration 1 : 200/434 places, 614/771 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62009 ms. Remains : 200/434 places, 614/771 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p1) (NOT p3) (NOT p0)), (NOT p0), (NOT p3), (OR (NOT p1) (NOT p3))]
Running random walk in product with property : FireWire-PT-19-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-19-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-19-LTLFireability-14 finished in 62234 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(F(((!p0&&X(p1)) U (G((!p0&&X(p1)))||(!p0&&X((p1&&X(p2))))))))||(X(p1)&&F(((!p0&&X(p1)) U (G((!p0&&X(p1)))||(!p0&&X((p1&&X(p2)))))))))))))'
Support contains 4 out of 434 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 434/434 places, 771/771 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 425 transition count 761
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 425 transition count 761
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 422 transition count 758
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 422 transition count 758
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 422 transition count 757
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 421 transition count 756
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 421 transition count 756
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 420 transition count 755
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 420 transition count 755
Applied a total of 29 rules in 26 ms. Remains 420 /434 variables (removed 14) and now considering 755/771 (removed 16) transitions.
// Phase 1: matrix 755 rows 420 cols
[2024-06-02 20:08:50] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 20:08:50] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-06-02 20:08:50] [INFO ] Invariant cache hit.
[2024-06-02 20:08:50] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
Running 754 sub problems to find dead transitions.
[2024-06-02 20:08:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 1 (OVERLAPS) 1/420 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-02 20:09:00] [INFO ] Deduced a trap composed of 86 places in 53 ms of which 2 ms to minimize.
[2024-06-02 20:09:01] [INFO ] Deduced a trap composed of 86 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:09:02] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-06-02 20:09:02] [INFO ] Deduced a trap composed of 86 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:09:02] [INFO ] Deduced a trap composed of 55 places in 107 ms of which 2 ms to minimize.
[2024-06-02 20:09:03] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 2 ms to minimize.
[2024-06-02 20:09:03] [INFO ] Deduced a trap composed of 74 places in 119 ms of which 2 ms to minimize.
[2024-06-02 20:09:07] [INFO ] Deduced a trap composed of 73 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 4 (OVERLAPS) 755/1175 variables, 420/438 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-02 20:09:20] [INFO ] Deduced a trap composed of 90 places in 138 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1175/1175 variables, and 439 constraints, problems are : Problem set: 0 solved, 754 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 754/754 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 754 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 1 (OVERLAPS) 1/420 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-02 20:09:27] [INFO ] Deduced a trap composed of 75 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:09:27] [INFO ] Deduced a trap composed of 73 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 5 (OVERLAPS) 755/1175 variables, 420/441 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1175 variables, 754/1195 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-02 20:09:46] [INFO ] Deduced a trap composed of 133 places in 158 ms of which 2 ms to minimize.
[2024-06-02 20:09:47] [INFO ] Deduced a trap composed of 135 places in 151 ms of which 2 ms to minimize.
[2024-06-02 20:09:47] [INFO ] Deduced a trap composed of 248 places in 154 ms of which 2 ms to minimize.
[2024-06-02 20:09:48] [INFO ] Deduced a trap composed of 73 places in 124 ms of which 2 ms to minimize.
[2024-06-02 20:09:50] [INFO ] Deduced a trap composed of 75 places in 132 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1175/1175 variables, and 1200 constraints, problems are : Problem set: 0 solved, 754 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 754/754 constraints, Known Traps: 16/16 constraints]
After SMT, in 60320ms problems are : Problem set: 0 solved, 754 unsolved
Search for dead transitions found 0 dead transitions in 60328ms
Starting structural reductions in LTL mode, iteration 1 : 420/434 places, 755/771 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60909 ms. Remains : 420/434 places, 755/771 transitions.
Stuttering acceptance computed with spot in 348 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (AND p0 p1 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 p1 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
Running random walk in product with property : FireWire-PT-19-LTLFireability-15
Product exploration explored 100000 steps with 22226 reset in 143 ms.
Product exploration explored 100000 steps with 22220 reset in 178 ms.
Computed a total of 63 stabilizing places and 69 stable transitions
Computed a total of 63 stabilizing places and 69 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 20 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (AND p0 p1 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 p1 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
RANDOM walk for 40000 steps (16 resets) in 341 ms. (116 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (22 resets) in 320 ms. (124 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (13 resets) in 537 ms. (74 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (17 resets) in 432 ms. (92 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (17 resets) in 491 ms. (81 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (20 resets) in 314 ms. (126 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (14 resets) in 401 ms. (99 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (18 resets) in 307 ms. (129 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (12 resets) in 425 ms. (93 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (10 resets) in 478 ms. (83 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (16 resets) in 374 ms. (106 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (20 resets) in 259 ms. (153 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (17 resets) in 358 ms. (111 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (12 resets) in 421 ms. (94 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 652671 steps, run timeout after 6001 ms. (steps per millisecond=108 ) properties seen :0 out of 13
Probabilistic random walk after 652671 steps, saw 115207 distinct states, run finished after 6002 ms. (steps per millisecond=108 ) properties seen :0
[2024-06-02 20:10:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem apf6 is UNSAT
Problem apf9 is UNSAT
At refinement iteration 1 (OVERLAPS) 210/214 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 155/369 variables, 7/10 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 701/1070 variables, 369/379 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1070 variables, 0/379 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 27/1097 variables, 12/391 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1097 variables, 0/391 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 30/1127 variables, 15/406 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1127 variables, 0/406 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 18/1145 variables, 9/415 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1145 variables, 0/415 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 13 (OVERLAPS) 21/1166 variables, 9/424 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1166 variables, 0/424 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 9/1175 variables, 6/430 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1175 variables, 0/430 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 0/1175 variables, 0/430 constraints. Problems are: Problem set: 2 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1175/1175 variables, and 430 constraints, problems are : Problem set: 2 solved, 11 unsolved in 2054 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 210/214 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 155/369 variables, 7/10 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 701/1070 variables, 369/379 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1070 variables, 11/390 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1070 variables, 0/390 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 27/1097 variables, 12/402 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1097 variables, 0/402 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 30/1127 variables, 15/417 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1127 variables, 0/417 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 18/1145 variables, 9/426 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1145 variables, 0/426 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 21/1166 variables, 9/435 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1166 variables, 0/435 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 9/1175 variables, 6/441 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1175 variables, 0/441 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 18 (OVERLAPS) 0/1175 variables, 0/441 constraints. Problems are: Problem set: 2 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1175/1175 variables, and 441 constraints, problems are : Problem set: 2 solved, 11 unsolved in 2401 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 11/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 4473ms problems are : Problem set: 2 solved, 11 unsolved
Fused 11 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 3243 ms.
Support contains 4 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 755/755 transitions.
Graph (trivial) has 320 edges and 420 vertex of which 18 / 420 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 405 transition count 663
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 76 rules applied. Total rules applied 147 place count 335 transition count 657
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 150 place count 332 transition count 657
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 150 place count 332 transition count 610
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 244 place count 285 transition count 610
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 245 place count 284 transition count 580
Iterating global reduction 3 with 1 rules applied. Total rules applied 246 place count 284 transition count 580
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 247 place count 284 transition count 579
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 327 place count 244 transition count 539
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -162
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 415 place count 200 transition count 701
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 424 place count 200 transition count 692
Drop transitions (Redundant composition of simpler transitions.) removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 5 with 75 rules applied. Total rules applied 499 place count 200 transition count 617
Free-agglomeration rule applied 32 times.
Iterating global reduction 5 with 32 rules applied. Total rules applied 531 place count 200 transition count 585
Reduce places removed 32 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 5 with 86 rules applied. Total rules applied 617 place count 168 transition count 531
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 6 with 45 rules applied. Total rules applied 662 place count 168 transition count 486
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 665 place count 168 transition count 486
Applied a total of 665 rules in 52 ms. Remains 168 /420 variables (removed 252) and now considering 486/755 (removed 269) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 168/420 places, 486/755 transitions.
RANDOM walk for 37042 steps (1460 resets) in 561 ms. (65 steps per ms) remains 0/11 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X (NOT p0))), (G (OR p1 (NOT p0))), (G (OR p1 (NOT p0) p2))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F (NOT (OR (NOT p1) p0 p2))), (F (NOT (OR p1 p0 p2))), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F (NOT p1)), (F (NOT (OR p1 p0))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND p1 (NOT p0)))), (F p0), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 4 factoid took 398 ms. Reduced automaton from 8 states, 20 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 353 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 337 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
Support contains 4 out of 420 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 420/420 places, 755/755 transitions.
Applied a total of 0 rules in 10 ms. Remains 420 /420 variables (removed 0) and now considering 755/755 (removed 0) transitions.
[2024-06-02 20:10:09] [INFO ] Invariant cache hit.
[2024-06-02 20:10:09] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-02 20:10:09] [INFO ] Invariant cache hit.
[2024-06-02 20:10:10] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
Running 754 sub problems to find dead transitions.
[2024-06-02 20:10:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 1 (OVERLAPS) 1/420 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-02 20:10:19] [INFO ] Deduced a trap composed of 86 places in 53 ms of which 1 ms to minimize.
[2024-06-02 20:10:20] [INFO ] Deduced a trap composed of 86 places in 54 ms of which 2 ms to minimize.
[2024-06-02 20:10:21] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-06-02 20:10:21] [INFO ] Deduced a trap composed of 86 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:10:22] [INFO ] Deduced a trap composed of 55 places in 111 ms of which 2 ms to minimize.
[2024-06-02 20:10:22] [INFO ] Deduced a trap composed of 56 places in 123 ms of which 2 ms to minimize.
[2024-06-02 20:10:22] [INFO ] Deduced a trap composed of 74 places in 121 ms of which 2 ms to minimize.
[2024-06-02 20:10:26] [INFO ] Deduced a trap composed of 73 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 4 (OVERLAPS) 755/1175 variables, 420/438 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-02 20:10:39] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1175/1175 variables, and 439 constraints, problems are : Problem set: 0 solved, 754 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 754/754 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 754 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 1 (OVERLAPS) 1/420 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-02 20:10:47] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 1 ms to minimize.
[2024-06-02 20:10:47] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 5 (OVERLAPS) 755/1175 variables, 420/441 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1175 variables, 754/1195 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-02 20:11:07] [INFO ] Deduced a trap composed of 133 places in 156 ms of which 2 ms to minimize.
[2024-06-02 20:11:07] [INFO ] Deduced a trap composed of 135 places in 144 ms of which 2 ms to minimize.
[2024-06-02 20:11:07] [INFO ] Deduced a trap composed of 248 places in 144 ms of which 3 ms to minimize.
[2024-06-02 20:11:08] [INFO ] Deduced a trap composed of 73 places in 126 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1175/1175 variables, and 1199 constraints, problems are : Problem set: 0 solved, 754 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 754/754 constraints, Known Traps: 15/15 constraints]
After SMT, in 60295ms problems are : Problem set: 0 solved, 754 unsolved
Search for dead transitions found 0 dead transitions in 60304ms
Finished structural reductions in LTL mode , in 1 iterations and 60870 ms. Remains : 420/420 places, 755/755 transitions.
Computed a total of 63 stabilizing places and 69 stable transitions
Computed a total of 63 stabilizing places and 69 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 219 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 365 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
RANDOM walk for 40000 steps (20 resets) in 372 ms. (107 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (20 resets) in 414 ms. (96 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (19 resets) in 364 ms. (109 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (8 resets) in 384 ms. (103 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (18 resets) in 409 ms. (97 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (19 resets) in 227 ms. (175 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (13 resets) in 217 ms. (183 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (14 resets) in 159 ms. (250 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (15 resets) in 288 ms. (138 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 372889 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :0 out of 8
Probabilistic random walk after 372889 steps, saw 68268 distinct states, run finished after 3001 ms. (steps per millisecond=124 ) properties seen :0
[2024-06-02 20:11:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 210/214 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 155/369 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 701/1070 variables, 369/379 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1070 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 27/1097 variables, 12/391 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1097 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 30/1127 variables, 15/406 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1127 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 18/1145 variables, 9/415 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1145 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 21/1166 variables, 9/424 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1166 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 9/1175 variables, 6/430 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1175 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 0/1175 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1175/1175 variables, and 430 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1473 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 210/214 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 155/369 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 701/1070 variables, 369/379 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1070 variables, 8/387 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1070 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 27/1097 variables, 12/399 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1097 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 30/1127 variables, 15/414 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1127 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 18/1145 variables, 9/423 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1145 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 21/1166 variables, 9/432 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1166 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 9/1175 variables, 6/438 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1175 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (OVERLAPS) 0/1175 variables, 0/438 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1175/1175 variables, and 438 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1705 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 3187ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1741 ms.
Support contains 4 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 755/755 transitions.
Graph (trivial) has 320 edges and 420 vertex of which 18 / 420 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 405 transition count 663
Reduce places removed 70 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 76 rules applied. Total rules applied 147 place count 335 transition count 657
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 150 place count 332 transition count 657
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 150 place count 332 transition count 610
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 244 place count 285 transition count 610
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 245 place count 284 transition count 580
Iterating global reduction 3 with 1 rules applied. Total rules applied 246 place count 284 transition count 580
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 247 place count 284 transition count 579
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 327 place count 244 transition count 539
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -162
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 415 place count 200 transition count 701
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 424 place count 200 transition count 692
Drop transitions (Redundant composition of simpler transitions.) removed 75 transitions
Redundant transition composition rules discarded 75 transitions
Iterating global reduction 5 with 75 rules applied. Total rules applied 499 place count 200 transition count 617
Free-agglomeration rule applied 32 times.
Iterating global reduction 5 with 32 rules applied. Total rules applied 531 place count 200 transition count 585
Reduce places removed 32 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 5 with 86 rules applied. Total rules applied 617 place count 168 transition count 531
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 6 with 45 rules applied. Total rules applied 662 place count 168 transition count 486
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 665 place count 168 transition count 486
Applied a total of 665 rules in 50 ms. Remains 168 /420 variables (removed 252) and now considering 486/755 (removed 269) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 168/420 places, 486/755 transitions.
RANDOM walk for 40000 steps (1588 resets) in 280 ms. (142 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p1) p0 p2))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p0 p2))), (F (NOT p2)), (F (NOT (OR p1 p2))), (F (NOT (AND p1 (NOT p0)))), (F p0)]
Knowledge based reduction with 2 factoid took 316 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 348 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 330 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
Stuttering acceptance computed with spot in 447 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (AND p0 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))]
Product exploration explored 100000 steps with 22209 reset in 138 ms.
Product exploration explored 100000 steps with 22244 reset in 142 ms.
Support contains 4 out of 420 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 420/420 places, 755/755 transitions.
Applied a total of 0 rules in 8 ms. Remains 420 /420 variables (removed 0) and now considering 755/755 (removed 0) transitions.
[2024-06-02 20:11:22] [INFO ] Invariant cache hit.
[2024-06-02 20:11:22] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-06-02 20:11:22] [INFO ] Invariant cache hit.
[2024-06-02 20:11:22] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
Running 754 sub problems to find dead transitions.
[2024-06-02 20:11:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 1 (OVERLAPS) 1/420 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-02 20:11:32] [INFO ] Deduced a trap composed of 86 places in 57 ms of which 1 ms to minimize.
[2024-06-02 20:11:33] [INFO ] Deduced a trap composed of 86 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:11:34] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-06-02 20:11:34] [INFO ] Deduced a trap composed of 86 places in 48 ms of which 1 ms to minimize.
[2024-06-02 20:11:35] [INFO ] Deduced a trap composed of 55 places in 110 ms of which 1 ms to minimize.
[2024-06-02 20:11:35] [INFO ] Deduced a trap composed of 56 places in 121 ms of which 1 ms to minimize.
[2024-06-02 20:11:35] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 2 ms to minimize.
[2024-06-02 20:11:39] [INFO ] Deduced a trap composed of 73 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 4 (OVERLAPS) 755/1175 variables, 420/438 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-02 20:11:52] [INFO ] Deduced a trap composed of 90 places in 138 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 1.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 1.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 1.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 1.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 timeout
0.0)
(s390 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1175/1175 variables, and 439 constraints, problems are : Problem set: 0 solved, 754 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 754/754 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 754 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/419 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 1 (OVERLAPS) 1/420 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/420 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-02 20:11:59] [INFO ] Deduced a trap composed of 75 places in 51 ms of which 1 ms to minimize.
[2024-06-02 20:11:59] [INFO ] Deduced a trap composed of 73 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/420 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 5 (OVERLAPS) 755/1175 variables, 420/441 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1175 variables, 754/1195 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-02 20:12:19] [INFO ] Deduced a trap composed of 133 places in 171 ms of which 3 ms to minimize.
[2024-06-02 20:12:19] [INFO ] Deduced a trap composed of 135 places in 164 ms of which 3 ms to minimize.
[2024-06-02 20:12:19] [INFO ] Deduced a trap composed of 248 places in 143 ms of which 2 ms to minimize.
[2024-06-02 20:12:20] [INFO ] Deduced a trap composed of 73 places in 156 ms of which 2 ms to minimize.
[2024-06-02 20:12:22] [INFO ] Deduced a trap composed of 75 places in 129 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1175/1175 variables, and 1200 constraints, problems are : Problem set: 0 solved, 754 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 420/420 constraints, PredecessorRefiner: 754/754 constraints, Known Traps: 16/16 constraints]
After SMT, in 60341ms problems are : Problem set: 0 solved, 754 unsolved
Search for dead transitions found 0 dead transitions in 60349ms
Finished structural reductions in LTL mode , in 1 iterations and 60900 ms. Remains : 420/420 places, 755/755 transitions.
Treatment of property FireWire-PT-19-LTLFireability-15 finished in 212853 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) U p1)) U p2) U G(!p3)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(F(((!p0&&X(p1)) U (G((!p0&&X(p1)))||(!p0&&X((p1&&X(p2))))))))||(X(p1)&&F(((!p0&&X(p1)) U (G((!p0&&X(p1)))||(!p0&&X((p1&&X(p2)))))))))))))'
[2024-06-02 20:12:23] [INFO ] Flatten gal took : 30 ms
[2024-06-02 20:12:23] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-02 20:12:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 434 places, 771 transitions and 2382 arcs took 4 ms.
Total runtime 1257960 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA FireWire-PT-19-LTLFireability-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA FireWire-PT-19-LTLFireability-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717359145023

--------------------
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 FireWire-PT-19-LTLFireability-09
ltl formula formula --ltl=/tmp/2649/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 434 places, 771 transitions and 2382 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2649/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2649/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2649/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.020 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2649/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 436 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 435, there are 811 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): ~420 levels ~10000 states ~79868 transitions
pnml2lts-mc( 0/ 4): ~427 levels ~20000 states ~178852 transitions
pnml2lts-mc( 3/ 4): ~430 levels ~40000 states ~422420 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~426!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 24074
pnml2lts-mc( 0/ 4): unique states count: 45354
pnml2lts-mc( 0/ 4): unique transitions count: 466217
pnml2lts-mc( 0/ 4): - self-loop count: 5633
pnml2lts-mc( 0/ 4): - claim dead count: 300436
pnml2lts-mc( 0/ 4): - claim found count: 100974
pnml2lts-mc( 0/ 4): - claim success count: 45365
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1783
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 45365 states 466305 transitions, fanout: 10.279
pnml2lts-mc( 0/ 4): Total exploration time 0.990 sec (0.970 sec minimum, 0.983 sec on average)
pnml2lts-mc( 0/ 4): States per second: 45823, Transitions per second: 471015
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.5MB, 10.3 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 783 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.5MB (~256.0MB paged-in)
ltl formula name FireWire-PT-19-LTLFireability-15
ltl formula formula --ltl=/tmp/2649/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 434 places, 771 transitions and 2382 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.150 real 0.030 user 0.050 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2649/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2649/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2649/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2649/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): There are 435 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 435, there are 845 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: 28
pnml2lts-mc( 0/ 4): unique states count: 28
pnml2lts-mc( 0/ 4): unique transitions count: 71
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 74
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 49
pnml2lts-mc( 0/ 4): - cum. max stack depth: 16
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 49 states 162 transitions, fanout: 3.306
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.000 sec minimum, 0.007 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4900, Transitions per second: 16200
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, 53.4 B/state, compr.: 3.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 783 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)

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="FireWire-PT-19"
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 FireWire-PT-19, 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 r553-tall-171734901400316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-19.tgz
mv FireWire-PT-19 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 ;