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.r496-tall-171640602500028.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 FlexibleBarrier-PT-06b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640602500028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 08:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 13 08:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 08:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Apr 13 08:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 141K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717181883019

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-06b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:58:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 18:58:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:58:04] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2024-05-31 18:58:04] [INFO ] Transformed 542 places.
[2024-05-31 18:58:04] [INFO ] Transformed 621 transitions.
[2024-05-31 18:58:04] [INFO ] Found NUPN structural information;
[2024-05-31 18:58:04] [INFO ] Parsed PT model containing 542 places and 621 transitions and 1533 arcs in 204 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 5 formulas.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 542/542 places, 621/621 transitions.
Discarding 179 places :
Symmetric choice reduction at 0 with 179 rule applications. Total rules 179 place count 363 transition count 442
Iterating global reduction 0 with 179 rules applied. Total rules applied 358 place count 363 transition count 442
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 430 place count 291 transition count 370
Iterating global reduction 0 with 72 rules applied. Total rules applied 502 place count 291 transition count 370
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 542 place count 251 transition count 330
Iterating global reduction 0 with 40 rules applied. Total rules applied 582 place count 251 transition count 330
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 599 place count 251 transition count 313
Applied a total of 599 rules in 109 ms. Remains 251 /542 variables (removed 291) and now considering 313/621 (removed 308) transitions.
// Phase 1: matrix 313 rows 251 cols
[2024-05-31 18:58:04] [INFO ] Computed 8 invariants in 22 ms
[2024-05-31 18:58:05] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-31 18:58:05] [INFO ] Invariant cache hit.
[2024-05-31 18:58:05] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
Running 312 sub problems to find dead transitions.
[2024-05-31 18:58:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/251 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-05-31 18:58:08] [INFO ] Deduced a trap composed of 171 places in 127 ms of which 27 ms to minimize.
[2024-05-31 18:58:08] [INFO ] Deduced a trap composed of 171 places in 125 ms of which 1 ms to minimize.
[2024-05-31 18:58:09] [INFO ] Deduced a trap composed of 166 places in 185 ms of which 2 ms to minimize.
[2024-05-31 18:58:09] [INFO ] Deduced a trap composed of 88 places in 77 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-05-31 18:58:11] [INFO ] Deduced a trap composed of 74 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-05-31 18:58:14] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 1 ms to minimize.
[2024-05-31 18:58:14] [INFO ] Deduced a trap composed of 89 places in 66 ms of which 3 ms to minimize.
[2024-05-31 18:58:14] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 2 ms to minimize.
[2024-05-31 18:58:14] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 2 ms to minimize.
[2024-05-31 18:58:14] [INFO ] Deduced a trap composed of 169 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (OVERLAPS) 313/564 variables, 251/269 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-05-31 18:58:20] [INFO ] Deduced a trap composed of 169 places in 87 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-05-31 18:58:22] [INFO ] Deduced a trap composed of 169 places in 76 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/564 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/564 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 10 (OVERLAPS) 0/564 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 312 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 271 constraints, problems are : Problem set: 0 solved, 312 unsolved in 24217 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 312 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (OVERLAPS) 1/251 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 313/564 variables, 251/271 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/564 variables, 312/583 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-05-31 18:58:33] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-05-31 18:58:33] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-31 18:58:33] [INFO ] Deduced a trap composed of 61 places in 51 ms of which 1 ms to minimize.
[2024-05-31 18:58:34] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 2 ms to minimize.
[2024-05-31 18:58:34] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 2 ms to minimize.
[2024-05-31 18:58:35] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 1 ms to minimize.
[2024-05-31 18:58:35] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 2 ms to minimize.
[2024-05-31 18:58:36] [INFO ] Deduced a trap composed of 68 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 8/591 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-05-31 18:58:39] [INFO ] Deduced a trap composed of 91 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-05-31 18:58:48] [INFO ] Deduced a trap composed of 191 places in 81 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/564 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/564 variables, 0/593 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 564/564 variables, and 593 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 22/22 constraints]
After SMT, in 54368ms problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 54383ms
Starting structural reductions in LTL mode, iteration 1 : 251/542 places, 313/621 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55055 ms. Remains : 251/542 places, 313/621 transitions.
Support contains 31 out of 251 places after structural reductions.
[2024-05-31 18:58:59] [INFO ] Flatten gal took : 51 ms
[2024-05-31 18:58:59] [INFO ] Flatten gal took : 25 ms
[2024-05-31 18:58:59] [INFO ] Input system was already deterministic with 313 transitions.
Support contains 30 out of 251 places (down from 31) after GAL structural reductions.
RANDOM walk for 40000 steps (749 resets) in 1548 ms. (25 steps per ms) remains 4/29 properties
BEST_FIRST walk for 40004 steps (108 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (105 resets) in 87 ms. (454 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (113 resets) in 95 ms. (416 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (111 resets) in 117 ms. (339 steps per ms) remains 3/3 properties
[2024-05-31 18:59:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 78/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 170/251 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 313/564 variables, 251/259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/564 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 259 constraints, problems are : Problem set: 0 solved, 3 unsolved in 395 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 78/81 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 170/251 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 313/564 variables, 251/259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 3/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/564 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 262 constraints, problems are : Problem set: 0 solved, 3 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 251/251 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 698ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 87 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=21 )
Parikh walk visited 3 properties in 9 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 313/313 transitions.
Graph (trivial) has 230 edges and 251 vertex of which 37 / 251 are part of one of the 6 SCC in 2 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 219 transition count 249
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 188 transition count 249
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 63 place count 188 transition count 233
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 95 place count 172 transition count 233
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 117 place count 150 transition count 211
Iterating global reduction 2 with 22 rules applied. Total rules applied 139 place count 150 transition count 211
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 144 place count 145 transition count 206
Iterating global reduction 2 with 5 rules applied. Total rules applied 149 place count 145 transition count 206
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 153 place count 145 transition count 202
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 229 place count 107 transition count 164
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 232 place count 104 transition count 161
Iterating global reduction 3 with 3 rules applied. Total rules applied 235 place count 104 transition count 161
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 238 place count 104 transition count 158
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 244 place count 104 transition count 152
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 246 place count 102 transition count 150
Applied a total of 246 rules in 69 ms. Remains 102 /251 variables (removed 149) and now considering 150/313 (removed 163) transitions.
[2024-05-31 18:59:01] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
// Phase 1: matrix 139 rows 102 cols
[2024-05-31 18:59:01] [INFO ] Computed 8 invariants in 1 ms
[2024-05-31 18:59:01] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-31 18:59:01] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
[2024-05-31 18:59:01] [INFO ] Invariant cache hit.
[2024-05-31 18:59:02] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-05-31 18:59:02] [INFO ] Redundant transitions in 4 ms returned []
Running 81 sub problems to find dead transitions.
[2024-05-31 18:59:02] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
[2024-05-31 18:59:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 6/102 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 138/240 variables, 102/110 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 0/240 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/241 variables, and 110 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1435 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 6/102 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 138/240 variables, 102/110 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 81/191 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 0/240 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/241 variables, and 191 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1602 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 102/102 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
After SMT, in 3063ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 3064ms
Starting structural reductions in SI_LTL mode, iteration 1 : 102/251 places, 150/313 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3315 ms. Remains : 102/251 places, 150/313 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-00
Stuttering criterion allowed to conclude after 1720 steps with 137 reset in 17 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-00 finished in 3575 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((F(p1)&&p0)) U p2))'
Support contains 3 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 313/313 transitions.
Graph (trivial) has 226 edges and 251 vertex of which 37 / 251 are part of one of the 6 SCC in 1 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 219 transition count 250
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 61 place count 189 transition count 250
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 61 place count 189 transition count 234
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 93 place count 173 transition count 234
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 114 place count 152 transition count 213
Iterating global reduction 2 with 21 rules applied. Total rules applied 135 place count 152 transition count 213
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 141 place count 146 transition count 207
Iterating global reduction 2 with 6 rules applied. Total rules applied 147 place count 146 transition count 207
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 152 place count 146 transition count 202
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 226 place count 109 transition count 165
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 227 place count 108 transition count 164
Iterating global reduction 3 with 1 rules applied. Total rules applied 228 place count 108 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 229 place count 108 transition count 163
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 235 place count 108 transition count 157
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 237 place count 106 transition count 155
Applied a total of 237 rules in 53 ms. Remains 106 /251 variables (removed 145) and now considering 155/313 (removed 158) transitions.
[2024-05-31 18:59:05] [INFO ] Flow matrix only has 144 transitions (discarded 11 similar events)
// Phase 1: matrix 144 rows 106 cols
[2024-05-31 18:59:05] [INFO ] Computed 8 invariants in 1 ms
[2024-05-31 18:59:05] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-31 18:59:05] [INFO ] Flow matrix only has 144 transitions (discarded 11 similar events)
[2024-05-31 18:59:05] [INFO ] Invariant cache hit.
[2024-05-31 18:59:05] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2024-05-31 18:59:05] [INFO ] Redundant transitions in 4 ms returned []
Running 85 sub problems to find dead transitions.
[2024-05-31 18:59:05] [INFO ] Flow matrix only has 144 transitions (discarded 11 similar events)
[2024-05-31 18:59:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 6/106 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 143/249 variables, 106/114 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 0/249 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/250 variables, and 114 constraints, problems are : Problem set: 0 solved, 85 unsolved in 1623 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 6/106 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 143/249 variables, 106/114 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 85/199 constraints. Problems are: Problem set: 0 solved, 85 unsolved
[2024-05-31 18:59:07] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/249 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/250 variables, and 200 constraints, problems are : Problem set: 0 solved, 85 unsolved in 2191 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 1/1 constraints]
After SMT, in 3842ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 3843ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/251 places, 155/313 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4058 ms. Remains : 106/251 places, 155/313 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-03 finished in 4214 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0 U p1)&&X((!p1 U G(p2)))))))'
Support contains 5 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 313/313 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 238 transition count 300
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 238 transition count 300
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 231 transition count 293
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 231 transition count 293
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 231 transition count 289
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 229 transition count 287
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 229 transition count 287
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 50 place count 229 transition count 285
Applied a total of 50 rules in 21 ms. Remains 229 /251 variables (removed 22) and now considering 285/313 (removed 28) transitions.
// Phase 1: matrix 285 rows 229 cols
[2024-05-31 18:59:09] [INFO ] Computed 8 invariants in 2 ms
[2024-05-31 18:59:09] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-31 18:59:09] [INFO ] Invariant cache hit.
[2024-05-31 18:59:09] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-05-31 18:59:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 285/514 variables, 229/237 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 0/514 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 237 constraints, problems are : Problem set: 0 solved, 284 unsolved in 8706 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 285/514 variables, 229/237 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 284/521 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-31 18:59:21] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 2 ms to minimize.
[2024-05-31 18:59:22] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 1 ms to minimize.
[2024-05-31 18:59:22] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 1 ms to minimize.
[2024-05-31 18:59:23] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 2 ms to minimize.
[2024-05-31 18:59:23] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 2 ms to minimize.
[2024-05-31 18:59:23] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 1 ms to minimize.
[2024-05-31 18:59:24] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 7/528 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (OVERLAPS) 0/514 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 514/514 variables, and 528 constraints, problems are : Problem set: 0 solved, 284 unsolved in 16808 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 7/7 constraints]
After SMT, in 25579ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 25582ms
Starting structural reductions in LTL mode, iteration 1 : 229/251 places, 285/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25886 ms. Remains : 229/251 places, 285/313 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 44 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-04 finished in 26122 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) U ((X(p0)&&(p1 U (p2&&F(p1))))||X(G(p0))))))'
Support contains 3 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 313/313 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 238 transition count 300
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 238 transition count 300
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 34 place count 230 transition count 292
Iterating global reduction 0 with 8 rules applied. Total rules applied 42 place count 230 transition count 292
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 48 place count 230 transition count 286
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 229 transition count 285
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 229 transition count 285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 229 transition count 284
Applied a total of 51 rules in 19 ms. Remains 229 /251 variables (removed 22) and now considering 284/313 (removed 29) transitions.
// Phase 1: matrix 284 rows 229 cols
[2024-05-31 18:59:35] [INFO ] Computed 8 invariants in 3 ms
[2024-05-31 18:59:35] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-31 18:59:35] [INFO ] Invariant cache hit.
[2024-05-31 18:59:35] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2024-05-31 18:59:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 284/513 variables, 229/237 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (OVERLAPS) 0/513 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 513/513 variables, and 237 constraints, problems are : Problem set: 0 solved, 283 unsolved in 8579 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 284/513 variables, 229/237 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 283/520 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-31 18:59:47] [INFO ] Deduced a trap composed of 120 places in 74 ms of which 2 ms to minimize.
[2024-05-31 18:59:47] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 2 ms to minimize.
[2024-05-31 18:59:48] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 2 ms to minimize.
[2024-05-31 18:59:48] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-31 18:59:48] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 4 ms to minimize.
[2024-05-31 18:59:49] [INFO ] Deduced a trap composed of 65 places in 56 ms of which 1 ms to minimize.
[2024-05-31 18:59:49] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 1 ms to minimize.
[2024-05-31 18:59:50] [INFO ] Deduced a trap composed of 160 places in 59 ms of which 1 ms to minimize.
[2024-05-31 18:59:50] [INFO ] Deduced a trap composed of 160 places in 59 ms of which 2 ms to minimize.
[2024-05-31 18:59:50] [INFO ] Deduced a trap composed of 160 places in 73 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 10/530 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-31 18:59:54] [INFO ] Deduced a trap composed of 160 places in 60 ms of which 1 ms to minimize.
[2024-05-31 18:59:54] [INFO ] Deduced a trap composed of 163 places in 66 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 2/532 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 0/513 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 513/513 variables, and 532 constraints, problems are : Problem set: 0 solved, 283 unsolved in 21550 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 12/12 constraints]
After SMT, in 30199ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 30202ms
Starting structural reductions in LTL mode, iteration 1 : 229/251 places, 284/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30457 ms. Remains : 229/251 places, 284/313 transitions.
Stuttering acceptance computed with spot in 343 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-05
Product exploration explored 100000 steps with 25043 reset in 190 ms.
Product exploration explored 100000 steps with 24990 reset in 148 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (AND (NOT p2) (NOT p1) p0)), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 136 ms. Reduced automaton from 10 states, 28 edges and 3 AP (stutter sensitive) to 10 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 365 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (723 resets) in 464 ms. (86 steps per ms) remains 2/13 properties
BEST_FIRST walk for 40004 steps (121 resets) in 177 ms. (224 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (112 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
[2024-05-31 19:00:07] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 100/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 126/229 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 284/513 variables, 229/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/513 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 513/513 variables, and 237 constraints, problems are : Problem set: 0 solved, 2 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 100/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 126/229 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 284/513 variables, 229/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 19:00:07] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/513 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 513/513 variables, and 240 constraints, problems are : Problem set: 0 solved, 2 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 379ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 712 steps, including 9 resets, run visited all 2 properties in 12 ms. (steps per millisecond=59 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 11 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (AND (NOT p2) (NOT p1) p0)), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1)))), (F p2), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p0 (NOT p2) p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 21 factoid took 524 ms. Reduced automaton from 10 states, 28 edges and 3 AP (stutter sensitive) to 10 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 403 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 424 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p2))]
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 284/284 transitions.
Applied a total of 0 rules in 4 ms. Remains 229 /229 variables (removed 0) and now considering 284/284 (removed 0) transitions.
[2024-05-31 19:00:09] [INFO ] Invariant cache hit.
[2024-05-31 19:00:09] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-31 19:00:09] [INFO ] Invariant cache hit.
[2024-05-31 19:00:09] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2024-05-31 19:00:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 284/513 variables, 229/237 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (OVERLAPS) 0/513 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 513/513 variables, and 237 constraints, problems are : Problem set: 0 solved, 283 unsolved in 8675 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 284/513 variables, 229/237 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 283/520 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-31 19:00:21] [INFO ] Deduced a trap composed of 120 places in 79 ms of which 2 ms to minimize.
[2024-05-31 19:00:21] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
[2024-05-31 19:00:22] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 2 ms to minimize.
[2024-05-31 19:00:22] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 2 ms to minimize.
[2024-05-31 19:00:22] [INFO ] Deduced a trap composed of 66 places in 53 ms of which 1 ms to minimize.
[2024-05-31 19:00:23] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 1 ms to minimize.
[2024-05-31 19:00:23] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 1 ms to minimize.
[2024-05-31 19:00:23] [INFO ] Deduced a trap composed of 160 places in 71 ms of which 2 ms to minimize.
[2024-05-31 19:00:24] [INFO ] Deduced a trap composed of 160 places in 64 ms of which 1 ms to minimize.
[2024-05-31 19:00:24] [INFO ] Deduced a trap composed of 160 places in 69 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 10/530 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-31 19:00:28] [INFO ] Deduced a trap composed of 160 places in 70 ms of which 1 ms to minimize.
[2024-05-31 19:00:28] [INFO ] Deduced a trap composed of 163 places in 68 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 2/532 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 0/513 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 513/513 variables, and 532 constraints, problems are : Problem set: 0 solved, 283 unsolved in 21901 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 12/12 constraints]
After SMT, in 30635ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 30637ms
Finished structural reductions in LTL mode , in 1 iterations and 30838 ms. Remains : 229/229 places, 284/284 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 132 ms. Reduced automaton from 10 states, 28 edges and 3 AP (stutter sensitive) to 10 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 417 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (735 resets) in 289 ms. (137 steps per ms) remains 2/13 properties
BEST_FIRST walk for 40004 steps (115 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (110 resets) in 22 ms. (1739 steps per ms) remains 2/2 properties
[2024-05-31 19:00:40] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 100/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 126/229 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 284/513 variables, 229/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/513 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 513/513 variables, and 237 constraints, problems are : Problem set: 0 solved, 2 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 100/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 126/229 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 284/513 variables, 229/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 19:00:41] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/513 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 513/513 variables, and 240 constraints, problems are : Problem set: 0 solved, 2 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 370ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 699 steps, including 9 resets, run visited all 2 properties in 14 ms. (steps per millisecond=49 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 13 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p0), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT p2))), (X (X (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1)))), (F p2), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p0 (NOT p2) p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 21 factoid took 545 ms. Reduced automaton from 10 states, 28 edges and 3 AP (stutter sensitive) to 10 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 428 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 393 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 438 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 24918 reset in 119 ms.
Product exploration explored 100000 steps with 25050 reset in 148 ms.
Applying partial POR strategy [false, false, true, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 395 ms :[(NOT p0), (NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p1) (NOT p0)), (NOT p1), (OR (NOT p1) (NOT p2))]
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 229/229 places, 284/284 transitions.
Graph (trivial) has 203 edges and 229 vertex of which 37 / 229 are part of one of the 6 SCC in 1 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 198 transition count 252
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 15 Pre rules applied. Total rules applied 25 place count 198 transition count 252
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 40 place count 198 transition count 252
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 65 place count 173 transition count 227
Deduced a syphon composed of 25 places in 1 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 90 place count 173 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 172 transition count 226
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 172 transition count 226
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 127 place count 172 transition count 237
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 144 place count 155 transition count 220
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 161 place count 155 transition count 220
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 166 place count 155 transition count 230
Deduced a syphon composed of 48 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 177 place count 155 transition count 219
Deduced a syphon composed of 48 places in 0 ms
Applied a total of 177 rules in 64 ms. Remains 155 /229 variables (removed 74) and now considering 219/284 (removed 65) transitions.
[2024-05-31 19:00:44] [INFO ] Redundant transitions in 7 ms returned []
Running 218 sub problems to find dead transitions.
[2024-05-31 19:00:44] [INFO ] Flow matrix only has 208 transitions (discarded 11 similar events)
// Phase 1: matrix 208 rows 155 cols
[2024-05-31 19:00:44] [INFO ] Computed 8 invariants in 2 ms
[2024-05-31 19:00:44] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-31 19:00:45] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 6 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
[2024-05-31 19:00:45] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
[2024-05-31 19:00:45] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
[2024-05-31 19:00:45] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
[2024-05-31 19:00:45] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
[2024-05-31 19:00:45] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
[2024-05-31 19:00:45] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
Problem TDEAD138 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
[2024-05-31 19:00:45] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
Problem TDEAD185 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD216 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 8/16 constraints. Problems are: Problem set: 64 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/16 constraints. Problems are: Problem set: 64 solved, 154 unsolved
At refinement iteration 4 (OVERLAPS) 207/362 variables, 155/171 constraints. Problems are: Problem set: 64 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 47/218 constraints. Problems are: Problem set: 64 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 0/218 constraints. Problems are: Problem set: 64 solved, 154 unsolved
At refinement iteration 7 (OVERLAPS) 1/363 variables, 1/219 constraints. Problems are: Problem set: 64 solved, 154 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/363 variables, 0/219 constraints. Problems are: Problem set: 64 solved, 154 unsolved
At refinement iteration 9 (OVERLAPS) 0/363 variables, 0/219 constraints. Problems are: Problem set: 64 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 363/363 variables, and 219 constraints, problems are : Problem set: 64 solved, 154 unsolved in 6773 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 64 solved, 154 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 64 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 49/155 variables, 8/8 constraints. Problems are: Problem set: 64 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 8/16 constraints. Problems are: Problem set: 64 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/16 constraints. Problems are: Problem set: 64 solved, 154 unsolved
At refinement iteration 4 (OVERLAPS) 207/362 variables, 155/171 constraints. Problems are: Problem set: 64 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/362 variables, 47/218 constraints. Problems are: Problem set: 64 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 154/372 constraints. Problems are: Problem set: 64 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/372 constraints. Problems are: Problem set: 64 solved, 154 unsolved
At refinement iteration 8 (OVERLAPS) 1/363 variables, 1/373 constraints. Problems are: Problem set: 64 solved, 154 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/363 variables, 0/373 constraints. Problems are: Problem set: 64 solved, 154 unsolved
At refinement iteration 10 (OVERLAPS) 0/363 variables, 0/373 constraints. Problems are: Problem set: 64 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 363/363 variables, and 373 constraints, problems are : Problem set: 64 solved, 154 unsolved in 6867 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 154/218 constraints, Known Traps: 8/8 constraints]
After SMT, in 13714ms problems are : Problem set: 64 solved, 154 unsolved
Search for dead transitions found 64 dead transitions in 13717ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 155/229 places, 155/284 transitions.
Graph (complete) has 411 edges and 155 vertex of which 107 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.4 ms
Discarding 48 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 16 ms. Remains 107 /155 variables (removed 48) and now considering 155/155 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 107/229 places, 155/284 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13818 ms. Remains : 107/229 places, 155/284 transitions.
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 229/229 places, 284/284 transitions.
Applied a total of 0 rules in 4 ms. Remains 229 /229 variables (removed 0) and now considering 284/284 (removed 0) transitions.
// Phase 1: matrix 284 rows 229 cols
[2024-05-31 19:00:57] [INFO ] Computed 8 invariants in 3 ms
[2024-05-31 19:00:57] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-31 19:00:57] [INFO ] Invariant cache hit.
[2024-05-31 19:00:57] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2024-05-31 19:00:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 284/513 variables, 229/237 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (OVERLAPS) 0/513 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Real declared 513/513 variables, and 237 constraints, problems are : Problem set: 0 solved, 283 unsolved in 8650 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 283 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (OVERLAPS) 284/513 variables, 229/237 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 283/520 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-31 19:01:09] [INFO ] Deduced a trap composed of 120 places in 78 ms of which 1 ms to minimize.
[2024-05-31 19:01:09] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 2 ms to minimize.
[2024-05-31 19:01:10] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 1 ms to minimize.
[2024-05-31 19:01:10] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-31 19:01:11] [INFO ] Deduced a trap composed of 66 places in 58 ms of which 1 ms to minimize.
[2024-05-31 19:01:11] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2024-05-31 19:01:11] [INFO ] Deduced a trap composed of 65 places in 51 ms of which 1 ms to minimize.
[2024-05-31 19:01:12] [INFO ] Deduced a trap composed of 160 places in 67 ms of which 2 ms to minimize.
[2024-05-31 19:01:12] [INFO ] Deduced a trap composed of 160 places in 65 ms of which 1 ms to minimize.
[2024-05-31 19:01:12] [INFO ] Deduced a trap composed of 160 places in 77 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 10/530 constraints. Problems are: Problem set: 0 solved, 283 unsolved
[2024-05-31 19:01:16] [INFO ] Deduced a trap composed of 160 places in 71 ms of which 2 ms to minimize.
[2024-05-31 19:01:16] [INFO ] Deduced a trap composed of 163 places in 74 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 2/532 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 8 (OVERLAPS) 0/513 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 283 unsolved
No progress, stopping.
After SMT solving in domain Int declared 513/513 variables, and 532 constraints, problems are : Problem set: 0 solved, 283 unsolved in 21618 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 12/12 constraints]
After SMT, in 30319ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 30321ms
Finished structural reductions in LTL mode , in 1 iterations and 30556 ms. Remains : 229/229 places, 284/284 transitions.
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-05 finished in 112713 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((X(X(X(p1)))||p0))))'
Support contains 2 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 313/313 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 236 transition count 298
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 236 transition count 298
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 39 place count 227 transition count 289
Iterating global reduction 0 with 9 rules applied. Total rules applied 48 place count 227 transition count 289
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 54 place count 227 transition count 283
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 225 transition count 281
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 225 transition count 281
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 60 place count 225 transition count 279
Applied a total of 60 rules in 12 ms. Remains 225 /251 variables (removed 26) and now considering 279/313 (removed 34) transitions.
// Phase 1: matrix 279 rows 225 cols
[2024-05-31 19:01:28] [INFO ] Computed 8 invariants in 1 ms
[2024-05-31 19:01:28] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-31 19:01:28] [INFO ] Invariant cache hit.
[2024-05-31 19:01:28] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2024-05-31 19:01:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/225 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 279/504 variables, 225/233 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (OVERLAPS) 0/504 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 233 constraints, problems are : Problem set: 0 solved, 278 unsolved in 8248 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/225 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 279/504 variables, 225/233 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 278/511 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-05-31 19:01:39] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2024-05-31 19:01:40] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 2 ms to minimize.
[2024-05-31 19:01:40] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 1 ms to minimize.
[2024-05-31 19:01:41] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 2 ms to minimize.
[2024-05-31 19:01:41] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 1 ms to minimize.
[2024-05-31 19:01:41] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 2 ms to minimize.
[2024-05-31 19:01:42] [INFO ] Deduced a trap composed of 158 places in 70 ms of which 2 ms to minimize.
[2024-05-31 19:01:42] [INFO ] Deduced a trap composed of 158 places in 59 ms of which 1 ms to minimize.
[2024-05-31 19:01:42] [INFO ] Deduced a trap composed of 158 places in 70 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 9/520 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-05-31 19:01:50] [INFO ] Deduced a trap composed of 161 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/504 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/504 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 9 (OVERLAPS) 0/504 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Int declared 504/504 variables, and 521 constraints, problems are : Problem set: 0 solved, 278 unsolved in 25770 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 10/10 constraints]
After SMT, in 34072ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 34075ms
Starting structural reductions in LTL mode, iteration 1 : 225/251 places, 279/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34292 ms. Remains : 225/251 places, 279/313 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-06
Product exploration explored 100000 steps with 1827 reset in 153 ms.
Product exploration explored 100000 steps with 1841 reset in 166 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 74 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (723 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (108 resets) in 19 ms. (2000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (105 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 873578 steps, run timeout after 3001 ms. (steps per millisecond=291 ) properties seen :0 out of 2
Probabilistic random walk after 873578 steps, saw 246269 distinct states, run finished after 3004 ms. (steps per millisecond=290 ) properties seen :0
[2024-05-31 19:02:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 38/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 185/225 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 279/504 variables, 225/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/504 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 233 constraints, problems are : Problem set: 0 solved, 2 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 38/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 185/225 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 279/504 variables, 225/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/504 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 504/504 variables, and 235 constraints, problems are : Problem set: 0 solved, 2 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 303ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 56 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=28 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 128 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 279/279 transitions.
Applied a total of 0 rules in 4 ms. Remains 225 /225 variables (removed 0) and now considering 279/279 (removed 0) transitions.
[2024-05-31 19:02:07] [INFO ] Invariant cache hit.
[2024-05-31 19:02:07] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-31 19:02:07] [INFO ] Invariant cache hit.
[2024-05-31 19:02:07] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2024-05-31 19:02:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/225 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 279/504 variables, 225/233 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (OVERLAPS) 0/504 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 233 constraints, problems are : Problem set: 0 solved, 278 unsolved in 8483 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/225 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 279/504 variables, 225/233 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 278/511 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-05-31 19:02:19] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 2 ms to minimize.
[2024-05-31 19:02:19] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 1 ms to minimize.
[2024-05-31 19:02:19] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 2 ms to minimize.
[2024-05-31 19:02:20] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-05-31 19:02:20] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 2 ms to minimize.
[2024-05-31 19:02:21] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 2 ms to minimize.
[2024-05-31 19:02:21] [INFO ] Deduced a trap composed of 158 places in 69 ms of which 2 ms to minimize.
[2024-05-31 19:02:21] [INFO ] Deduced a trap composed of 158 places in 62 ms of which 1 ms to minimize.
[2024-05-31 19:02:21] [INFO ] Deduced a trap composed of 158 places in 71 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 9/520 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-05-31 19:02:29] [INFO ] Deduced a trap composed of 161 places in 68 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/504 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/504 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 9 (OVERLAPS) 0/504 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Int declared 504/504 variables, and 521 constraints, problems are : Problem set: 0 solved, 278 unsolved in 25295 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 10/10 constraints]
After SMT, in 33839ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 33842ms
Finished structural reductions in LTL mode , in 1 iterations and 34059 ms. Remains : 225/225 places, 279/279 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 93 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (731 resets) in 207 ms. (192 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (107 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (108 resets) in 21 ms. (1818 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 994285 steps, run timeout after 3001 ms. (steps per millisecond=331 ) properties seen :0 out of 2
Probabilistic random walk after 994285 steps, saw 277191 distinct states, run finished after 3001 ms. (steps per millisecond=331 ) properties seen :0
[2024-05-31 19:02:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 38/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 185/225 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 279/504 variables, 225/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/504 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 233 constraints, problems are : Problem set: 0 solved, 2 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 38/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 185/225 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 279/504 variables, 225/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/504 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 504/504 variables, and 235 constraints, problems are : Problem set: 0 solved, 2 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 300ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 57 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=28 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 150 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1836 reset in 218 ms.
Product exploration explored 100000 steps with 1834 reset in 228 ms.
Support contains 2 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 279/279 transitions.
Applied a total of 0 rules in 5 ms. Remains 225 /225 variables (removed 0) and now considering 279/279 (removed 0) transitions.
[2024-05-31 19:02:46] [INFO ] Invariant cache hit.
[2024-05-31 19:02:46] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-31 19:02:46] [INFO ] Invariant cache hit.
[2024-05-31 19:02:46] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2024-05-31 19:02:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/225 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 279/504 variables, 225/233 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (OVERLAPS) 0/504 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/504 variables, and 233 constraints, problems are : Problem set: 0 solved, 278 unsolved in 8360 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/224 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/225 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (OVERLAPS) 279/504 variables, 225/233 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 278/511 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-05-31 19:02:58] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 1 ms to minimize.
[2024-05-31 19:02:58] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 2 ms to minimize.
[2024-05-31 19:02:58] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 1 ms to minimize.
[2024-05-31 19:02:59] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 2 ms to minimize.
[2024-05-31 19:02:59] [INFO ] Deduced a trap composed of 65 places in 69 ms of which 2 ms to minimize.
[2024-05-31 19:02:59] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 1 ms to minimize.
[2024-05-31 19:03:00] [INFO ] Deduced a trap composed of 158 places in 64 ms of which 1 ms to minimize.
[2024-05-31 19:03:00] [INFO ] Deduced a trap composed of 158 places in 66 ms of which 2 ms to minimize.
[2024-05-31 19:03:00] [INFO ] Deduced a trap composed of 158 places in 73 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 9/520 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-05-31 19:03:08] [INFO ] Deduced a trap composed of 161 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/504 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/504 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 9 (OVERLAPS) 0/504 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Int declared 504/504 variables, and 521 constraints, problems are : Problem set: 0 solved, 278 unsolved in 25432 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 225/225 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 10/10 constraints]
After SMT, in 33842ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 33845ms
Finished structural reductions in LTL mode , in 1 iterations and 34058 ms. Remains : 225/225 places, 279/279 transitions.
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-06 finished in 112145 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((X(G((X(X(p1)) U (!p0||G(p1))))) U (p0&&X(G((X(X(p1)) U (!p0||G(p1)))))))))))'
Support contains 2 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 313/313 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 238 transition count 300
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 238 transition count 300
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 231 transition count 293
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 231 transition count 293
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 231 transition count 289
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 229 transition count 287
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 229 transition count 287
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 50 place count 229 transition count 285
Applied a total of 50 rules in 8 ms. Remains 229 /251 variables (removed 22) and now considering 285/313 (removed 28) transitions.
// Phase 1: matrix 285 rows 229 cols
[2024-05-31 19:03:20] [INFO ] Computed 8 invariants in 3 ms
[2024-05-31 19:03:20] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-31 19:03:20] [INFO ] Invariant cache hit.
[2024-05-31 19:03:20] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-05-31 19:03:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 285/514 variables, 229/237 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 0/514 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 237 constraints, problems are : Problem set: 0 solved, 284 unsolved in 8635 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (OVERLAPS) 285/514 variables, 229/237 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 284/521 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-31 19:03:32] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 2 ms to minimize.
[2024-05-31 19:03:33] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2024-05-31 19:03:33] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2024-05-31 19:03:33] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2024-05-31 19:03:34] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 1 ms to minimize.
[2024-05-31 19:03:34] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 1 ms to minimize.
[2024-05-31 19:03:35] [INFO ] Deduced a trap composed of 159 places in 72 ms of which 1 ms to minimize.
[2024-05-31 19:03:35] [INFO ] Deduced a trap composed of 160 places in 72 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 8/529 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-31 19:03:39] [INFO ] Deduced a trap composed of 183 places in 76 ms of which 2 ms to minimize.
[2024-05-31 19:03:39] [INFO ] Deduced a trap composed of 161 places in 72 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 2/531 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-31 19:03:42] [INFO ] Deduced a trap composed of 67 places in 52 ms of which 1 ms to minimize.
[2024-05-31 19:03:44] [INFO ] Deduced a trap composed of 160 places in 76 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 2/533 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-31 19:03:48] [INFO ] Deduced a trap composed of 163 places in 73 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/514 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/514 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 10 (OVERLAPS) 0/514 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 514/514 variables, and 534 constraints, problems are : Problem set: 0 solved, 284 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 13/13 constraints]
After SMT, in 38703ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 38705ms
Starting structural reductions in LTL mode, iteration 1 : 229/251 places, 285/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38931 ms. Remains : 229/251 places, 285/313 transitions.
Stuttering acceptance computed with spot in 318 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (AND p0 (NOT p1)), (NOT p1), true]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 88 ms.
Product exploration explored 100000 steps with 50000 reset in 115 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 8 states, 13 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-06b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-07 finished in 39492 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 1 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 313/313 transitions.
Graph (trivial) has 205 edges and 251 vertex of which 37 / 251 are part of one of the 6 SCC in 1 ms
Free SCC test removed 31 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 219 transition count 249
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 188 transition count 249
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 63 place count 188 transition count 233
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 95 place count 172 transition count 233
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 118 place count 149 transition count 210
Iterating global reduction 2 with 23 rules applied. Total rules applied 141 place count 149 transition count 210
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 147 place count 143 transition count 204
Iterating global reduction 2 with 6 rules applied. Total rules applied 153 place count 143 transition count 204
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 159 place count 143 transition count 198
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 235 place count 105 transition count 160
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 237 place count 103 transition count 158
Iterating global reduction 3 with 2 rules applied. Total rules applied 239 place count 103 transition count 158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 241 place count 103 transition count 156
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 243 place count 101 transition count 154
Applied a total of 243 rules in 27 ms. Remains 101 /251 variables (removed 150) and now considering 154/313 (removed 159) transitions.
[2024-05-31 19:04:00] [INFO ] Flow matrix only has 138 transitions (discarded 16 similar events)
// Phase 1: matrix 138 rows 101 cols
[2024-05-31 19:04:00] [INFO ] Computed 8 invariants in 0 ms
[2024-05-31 19:04:00] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-31 19:04:00] [INFO ] Flow matrix only has 138 transitions (discarded 16 similar events)
[2024-05-31 19:04:00] [INFO ] Invariant cache hit.
[2024-05-31 19:04:00] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2024-05-31 19:04:00] [INFO ] Redundant transitions in 1 ms returned []
Running 110 sub problems to find dead transitions.
[2024-05-31 19:04:00] [INFO ] Flow matrix only has 138 transitions (discarded 16 similar events)
[2024-05-31 19:04:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 137/238 variables, 101/109 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (OVERLAPS) 0/238 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/239 variables, and 109 constraints, problems are : Problem set: 0 solved, 110 unsolved in 1866 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 1/101 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 137/238 variables, 101/109 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 110/219 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/238 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/239 variables, and 219 constraints, problems are : Problem set: 0 solved, 110 unsolved in 2221 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 101/101 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 4129ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 4132ms
Starting structural reductions in SI_LTL mode, iteration 1 : 101/251 places, 154/313 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4314 ms. Remains : 101/251 places, 154/313 transitions.
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-08
Product exploration explored 100000 steps with 7127 reset in 294 ms.
Stack based approach found an accepted trace after 1233 steps with 85 reset with depth 7 and stack size 7 in 3 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-08 finished in 4671 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 251 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 251/251 places, 313/313 transitions.
Graph (trivial) has 222 edges and 251 vertex of which 31 / 251 are part of one of the 5 SCC in 1 ms
Free SCC test removed 26 places
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 224 transition count 254
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 63 place count 193 transition count 254
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 63 place count 193 transition count 236
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 99 place count 175 transition count 236
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 119 place count 155 transition count 216
Iterating global reduction 2 with 20 rules applied. Total rules applied 139 place count 155 transition count 216
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 145 place count 149 transition count 210
Iterating global reduction 2 with 6 rules applied. Total rules applied 151 place count 149 transition count 210
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 157 place count 149 transition count 204
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 239 place count 108 transition count 163
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 240 place count 107 transition count 162
Iterating global reduction 3 with 1 rules applied. Total rules applied 241 place count 107 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 242 place count 107 transition count 161
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
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 246 place count 105 transition count 168
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 254 place count 105 transition count 160
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 255 place count 104 transition count 159
Applied a total of 255 rules in 32 ms. Remains 104 /251 variables (removed 147) and now considering 159/313 (removed 154) transitions.
[2024-05-31 19:04:04] [INFO ] Flow matrix only has 149 transitions (discarded 10 similar events)
// Phase 1: matrix 149 rows 104 cols
[2024-05-31 19:04:04] [INFO ] Computed 8 invariants in 2 ms
[2024-05-31 19:04:04] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-31 19:04:04] [INFO ] Flow matrix only has 149 transitions (discarded 10 similar events)
[2024-05-31 19:04:04] [INFO ] Invariant cache hit.
[2024-05-31 19:04:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 19:04:04] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2024-05-31 19:04:04] [INFO ] Redundant transitions in 1 ms returned []
Running 131 sub problems to find dead transitions.
[2024-05-31 19:04:04] [INFO ] Flow matrix only has 149 transitions (discarded 10 similar events)
[2024-05-31 19:04:04] [INFO ] Invariant cache hit.
[2024-05-31 19:04:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 148/252 variables, 104/112 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 1/253 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 0/253 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 113 constraints, problems are : Problem set: 0 solved, 131 unsolved in 2818 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 148/252 variables, 104/112 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 131/243 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 1/253 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 0/253 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 253/253 variables, and 244 constraints, problems are : Problem set: 0 solved, 131 unsolved in 3948 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
After SMT, in 6803ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 6804ms
Starting structural reductions in SI_LTL mode, iteration 1 : 104/251 places, 159/313 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6984 ms. Remains : 104/251 places, 159/313 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-10
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-10 finished in 7045 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 (X(p1)&&(p2 U (p3||G(p2)))))))'
Support contains 4 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 313/313 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 238 transition count 300
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 238 transition count 300
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 231 transition count 293
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 231 transition count 293
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 45 place count 231 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 230 transition count 287
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 230 transition count 287
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 48 place count 230 transition count 286
Applied a total of 48 rules in 17 ms. Remains 230 /251 variables (removed 21) and now considering 286/313 (removed 27) transitions.
// Phase 1: matrix 286 rows 230 cols
[2024-05-31 19:04:11] [INFO ] Computed 8 invariants in 4 ms
[2024-05-31 19:04:11] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-31 19:04:11] [INFO ] Invariant cache hit.
[2024-05-31 19:04:11] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 285 sub problems to find dead transitions.
[2024-05-31 19:04:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 286/516 variables, 230/238 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/516 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (OVERLAPS) 0/516 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 516/516 variables, and 238 constraints, problems are : Problem set: 0 solved, 285 unsolved in 8969 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 286/516 variables, 230/238 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/516 variables, 285/523 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-31 19:04:23] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-31 19:04:24] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 2 ms to minimize.
[2024-05-31 19:04:24] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 1 ms to minimize.
[2024-05-31 19:04:25] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 1 ms to minimize.
[2024-05-31 19:04:25] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 2 ms to minimize.
[2024-05-31 19:04:25] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 2 ms to minimize.
[2024-05-31 19:04:26] [INFO ] Deduced a trap composed of 66 places in 50 ms of which 0 ms to minimize.
[2024-05-31 19:04:26] [INFO ] Deduced a trap composed of 160 places in 67 ms of which 2 ms to minimize.
[2024-05-31 19:04:26] [INFO ] Deduced a trap composed of 161 places in 61 ms of which 1 ms to minimize.
[2024-05-31 19:04:27] [INFO ] Deduced a trap composed of 160 places in 71 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/516 variables, 10/533 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-31 19:04:33] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/516 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-31 19:04:44] [INFO ] Deduced a trap composed of 163 places in 77 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/516 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-31 19:04:46] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-31 19:04:48] [INFO ] Deduced a trap composed of 160 places in 65 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/516 variables, 2/537 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 516/516 variables, and 537 constraints, problems are : Problem set: 0 solved, 285 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 14/14 constraints]
After SMT, in 39051ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 39054ms
Starting structural reductions in LTL mode, iteration 1 : 230/251 places, 286/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39299 ms. Remains : 230/251 places, 286/313 transitions.
Stuttering acceptance computed with spot in 314 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)), (NOT p1), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-11
Product exploration explored 100000 steps with 33409 reset in 147 ms.
Product exploration explored 100000 steps with 33417 reset in 157 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p3 p2 p0 p1), (X p2), (X (NOT (OR (AND p3 (NOT p1)) (AND p2 (NOT p1))))), (X p3), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (OR (AND p3 (NOT p0) (NOT p1)) (AND p2 (NOT p0) (NOT p1))))), (X p0), (X (NOT (AND (NOT p3) (NOT p2)))), (X (OR p3 p2)), (X (NOT (OR (AND p3 (NOT p0)) (AND p2 (NOT p0))))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (OR (AND p3 (NOT p1)) (AND p2 (NOT p1)))))), (X (X p3)), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p3 (NOT p0) (NOT p1)) (AND p2 (NOT p0) (NOT p1)))))), (X (X p0)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (OR p3 p2))), (X (X (NOT (OR (AND p3 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 29 factoid took 136 ms. Reduced automaton from 6 states, 20 edges and 4 AP (stutter sensitive) to 6 states, 20 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) (NOT p1) p3)), (NOT p1), (AND (NOT p2) (NOT p3))]
Reduction of identical properties reduced properties to check from 14 to 12
RANDOM walk for 40000 steps (723 resets) in 406 ms. (98 steps per ms) remains 6/12 properties
BEST_FIRST walk for 40004 steps (101 resets) in 269 ms. (148 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (110 resets) in 42 ms. (930 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (78 resets) in 24 ms. (1600 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (111 resets) in 425 ms. (93 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (81 resets) in 142 ms. (279 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (110 resets) in 148 ms. (268 steps per ms) remains 6/6 properties
[2024-05-31 19:04:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf4 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 1 (OVERLAPS) 97/101 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 129/230 variables, 5/8 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 286/516 variables, 230/238 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/238 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/516 variables, 0/238 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 516/516 variables, and 238 constraints, problems are : Problem set: 2 solved, 4 unsolved in 228 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 230/230 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/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 98/101 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 129/230 variables, 5/8 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 286/516 variables, 230/238 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 4/242 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 0/242 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/516 variables, 0/242 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 516/516 variables, and 242 constraints, problems are : Problem set: 2 solved, 4 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 445ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 6400 steps, including 120 resets, run visited all 4 properties in 18 ms. (steps per millisecond=355 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 18 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p3 p2 p0 p1), (X p2), (X (NOT (OR (AND p3 (NOT p1)) (AND p2 (NOT p1))))), (X p3), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (OR (AND p3 (NOT p0) (NOT p1)) (AND p2 (NOT p0) (NOT p1))))), (X p0), (X (NOT (AND (NOT p3) (NOT p2)))), (X (OR p3 p2)), (X (NOT (OR (AND p3 (NOT p0)) (AND p2 (NOT p0))))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X p1), (X (X p2)), (X (X (NOT (OR (AND p3 (NOT p1)) (AND p2 (NOT p1)))))), (X (X p3)), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND p3 (NOT p0) (NOT p1)) (AND p2 (NOT p0) (NOT p1)))))), (X (X p0)), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (OR p3 p2))), (X (X (NOT (OR (AND p3 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (NOT (AND (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X p1)), (G (AND (OR (NOT p2) p1 p0) (OR (NOT p3) p1 p0))), (G (OR p2 p3 p1 p0))]
False Knowledge obtained : [(F (NOT (OR p2 p3))), (F (NOT (OR (NOT p2) p3 p1))), (F (NOT (OR p2 p3))), (F (NOT (AND (OR (NOT p2) p0) (OR (NOT p3) p0)))), (F (NOT p1)), (F (NOT p0)), (F (NOT (AND (OR (NOT p2) p1) (OR (NOT p3) p1)))), (F (NOT p2)), (F (NOT (OR p2 p3 p0))), (F (NOT p3)), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR p2 p3 p1)))]
Knowledge based reduction with 31 factoid took 574 ms. Reduced automaton from 6 states, 20 edges and 4 AP (stutter sensitive) to 5 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3))]
Support contains 4 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 286/286 transitions.
Applied a total of 0 rules in 6 ms. Remains 230 /230 variables (removed 0) and now considering 286/286 (removed 0) transitions.
[2024-05-31 19:04:54] [INFO ] Invariant cache hit.
[2024-05-31 19:04:54] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-31 19:04:54] [INFO ] Invariant cache hit.
[2024-05-31 19:04:54] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 285 sub problems to find dead transitions.
[2024-05-31 19:04:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 286/516 variables, 230/238 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/516 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (OVERLAPS) 0/516 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 516/516 variables, and 238 constraints, problems are : Problem set: 0 solved, 285 unsolved in 8944 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 286/516 variables, 230/238 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/516 variables, 285/523 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-31 19:05:06] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-31 19:05:06] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 2 ms to minimize.
[2024-05-31 19:05:07] [INFO ] Deduced a trap composed of 62 places in 62 ms of which 1 ms to minimize.
[2024-05-31 19:05:07] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 2 ms to minimize.
[2024-05-31 19:05:07] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 1 ms to minimize.
[2024-05-31 19:05:08] [INFO ] Deduced a trap composed of 67 places in 58 ms of which 1 ms to minimize.
[2024-05-31 19:05:08] [INFO ] Deduced a trap composed of 66 places in 39 ms of which 1 ms to minimize.
[2024-05-31 19:05:09] [INFO ] Deduced a trap composed of 160 places in 66 ms of which 1 ms to minimize.
[2024-05-31 19:05:09] [INFO ] Deduced a trap composed of 161 places in 60 ms of which 2 ms to minimize.
[2024-05-31 19:05:09] [INFO ] Deduced a trap composed of 160 places in 66 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/516 variables, 10/533 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-31 19:05:15] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/516 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-31 19:05:25] [INFO ] Deduced a trap composed of 163 places in 69 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/516 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-31 19:05:28] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-31 19:05:30] [INFO ] Deduced a trap composed of 160 places in 66 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/516 variables, 2/537 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 516/516 variables, and 537 constraints, problems are : Problem set: 0 solved, 285 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 14/14 constraints]
After SMT, in 39025ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 39027ms
Finished structural reductions in LTL mode , in 1 iterations and 39241 ms. Remains : 230/230 places, 286/286 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p2 p3 p1), (X p2), (X p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (OR p2 p3)), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p3)))), (X p0), (X (NOT (AND p2 (NOT p3)))), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (OR p2 p3))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p3))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p3))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 128 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3))]
Reduction of identical properties reduced properties to check from 11 to 9
RANDOM walk for 40000 steps (738 resets) in 378 ms. (105 steps per ms) remains 2/9 properties
BEST_FIRST walk for 40003 steps (112 resets) in 22 ms. (1739 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (81 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
[2024-05-31 19:05:33] [INFO ] Invariant cache hit.
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) 129/230 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 286/516 variables, 230/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/516 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 516/516 variables, and 238 constraints, problems are : Problem set: 0 solved, 2 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/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) 129/230 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 286/516 variables, 230/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/516 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 516/516 variables, and 240 constraints, problems are : Problem set: 0 solved, 2 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 299ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 43 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=43 )
Parikh walk visited 2 properties in 12 ms.
Knowledge obtained : [(AND p0 p2 p3 p1), (X p2), (X p3), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (OR p2 p3)), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p3)))), (X p0), (X (NOT (AND p2 (NOT p3)))), (X p1), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (OR p2 p3))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p3))))), (X (X p0)), (X (X (NOT (AND p2 (NOT p3))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 p3))), (F (NOT (OR (NOT p2) p3 p1))), (F (NOT (OR p2 p3 p1))), (F (NOT (OR p2 p3))), (F (NOT p2)), (F (NOT (OR p2 p3 p0))), (F (NOT p3)), (F (NOT (OR (NOT p2) p3))), (F (NOT p1)), (F (NOT (AND (OR (NOT p2) p1) (OR (NOT p3) p1)))), (F (NOT p0))]
Knowledge based reduction with 23 factoid took 512 ms. Reduced automaton from 5 states, 15 edges and 4 AP (stutter sensitive) to 5 states, 15 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 33415 reset in 115 ms.
Product exploration explored 100000 steps with 33265 reset in 112 ms.
Applying partial POR strategy [false, true, false, false, false]
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3))]
Support contains 4 out of 230 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 230/230 places, 286/286 transitions.
Graph (trivial) has 193 edges and 230 vertex of which 24 / 230 are part of one of the 4 SCC in 0 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 210 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 2 rules applied. Total rules applied 27 place count 210 transition count 265
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 27 place count 210 transition count 266
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 44 place count 210 transition count 266
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 66 place count 188 transition count 244
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 88 place count 188 transition count 244
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 187 transition count 243
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 187 transition count 243
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 2 with 42 rules applied. Total rules applied 132 place count 187 transition count 255
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 153 place count 166 transition count 234
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 174 place count 166 transition count 234
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 183 place count 166 transition count 272
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 187 place count 162 transition count 263
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 191 place count 162 transition count 263
Deduced a syphon composed of 54 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 207 place count 162 transition count 247
Deduced a syphon composed of 54 places in 0 ms
Applied a total of 207 rules in 41 ms. Remains 162 /230 variables (removed 68) and now considering 247/286 (removed 39) transitions.
[2024-05-31 19:05:36] [INFO ] Redundant transitions in 2 ms returned []
Running 245 sub problems to find dead transitions.
[2024-05-31 19:05:36] [INFO ] Flow matrix only has 238 transitions (discarded 9 similar events)
// Phase 1: matrix 238 rows 162 cols
[2024-05-31 19:05:36] [INFO ] Computed 8 invariants in 0 ms
[2024-05-31 19:05:36] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 245 unsolved
[2024-05-31 19:05:37] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD37 is UNSAT
[2024-05-31 19:05:37] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
[2024-05-31 19:05:37] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
[2024-05-31 19:05:37] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
[2024-05-31 19:05:37] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
[2024-05-31 19:05:37] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
[2024-05-31 19:05:37] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 0 ms to minimize.
Problem TDEAD133 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
[2024-05-31 19:05:38] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
Problem TDEAD173 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD242 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 8/16 constraints. Problems are: Problem set: 82 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 82 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 237/399 variables, 162/178 constraints. Problems are: Problem set: 82 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 50/228 constraints. Problems are: Problem set: 82 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/228 constraints. Problems are: Problem set: 82 solved, 163 unsolved
At refinement iteration 7 (OVERLAPS) 1/400 variables, 1/229 constraints. Problems are: Problem set: 82 solved, 163 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 0/229 constraints. Problems are: Problem set: 82 solved, 163 unsolved
At refinement iteration 9 (OVERLAPS) 0/400 variables, 0/229 constraints. Problems are: Problem set: 82 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/400 variables, and 229 constraints, problems are : Problem set: 82 solved, 163 unsolved in 7745 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 162/162 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 82 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 82 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 55/162 variables, 8/8 constraints. Problems are: Problem set: 82 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 8/16 constraints. Problems are: Problem set: 82 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 0/16 constraints. Problems are: Problem set: 82 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 237/399 variables, 162/178 constraints. Problems are: Problem set: 82 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 50/228 constraints. Problems are: Problem set: 82 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 163/391 constraints. Problems are: Problem set: 82 solved, 163 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 0/391 constraints. Problems are: Problem set: 82 solved, 163 unsolved
At refinement iteration 8 (OVERLAPS) 1/400 variables, 1/392 constraints. Problems are: Problem set: 82 solved, 163 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 0/392 constraints. Problems are: Problem set: 82 solved, 163 unsolved
At refinement iteration 10 (OVERLAPS) 0/400 variables, 0/392 constraints. Problems are: Problem set: 82 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/400 variables, and 392 constraints, problems are : Problem set: 82 solved, 163 unsolved in 7647 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 162/162 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 163/245 constraints, Known Traps: 8/8 constraints]
After SMT, in 15479ms problems are : Problem set: 82 solved, 163 unsolved
Search for dead transitions found 82 dead transitions in 15481ms
Found 82 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 82 transitions
Dead transitions reduction (with SMT) removed 82 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 162/230 places, 165/286 transitions.
Graph (complete) has 436 edges and 162 vertex of which 108 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.1 ms
Discarding 54 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 108 /162 variables (removed 54) and now considering 165/165 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 108/230 places, 165/286 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15572 ms. Remains : 108/230 places, 165/286 transitions.
Support contains 4 out of 230 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 230/230 places, 286/286 transitions.
Applied a total of 0 rules in 2 ms. Remains 230 /230 variables (removed 0) and now considering 286/286 (removed 0) transitions.
// Phase 1: matrix 286 rows 230 cols
[2024-05-31 19:05:51] [INFO ] Computed 8 invariants in 4 ms
[2024-05-31 19:05:51] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-31 19:05:51] [INFO ] Invariant cache hit.
[2024-05-31 19:05:51] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 285 sub problems to find dead transitions.
[2024-05-31 19:05:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 286/516 variables, 230/238 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/516 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (OVERLAPS) 0/516 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 516/516 variables, and 238 constraints, problems are : Problem set: 0 solved, 285 unsolved in 8785 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 286/516 variables, 230/238 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/516 variables, 285/523 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-31 19:06:03] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-31 19:06:03] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 2 ms to minimize.
[2024-05-31 19:06:04] [INFO ] Deduced a trap composed of 62 places in 62 ms of which 1 ms to minimize.
[2024-05-31 19:06:04] [INFO ] Deduced a trap composed of 63 places in 58 ms of which 1 ms to minimize.
[2024-05-31 19:06:04] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 1 ms to minimize.
[2024-05-31 19:06:05] [INFO ] Deduced a trap composed of 67 places in 58 ms of which 1 ms to minimize.
[2024-05-31 19:06:05] [INFO ] Deduced a trap composed of 66 places in 45 ms of which 1 ms to minimize.
[2024-05-31 19:06:06] [INFO ] Deduced a trap composed of 160 places in 61 ms of which 2 ms to minimize.
[2024-05-31 19:06:06] [INFO ] Deduced a trap composed of 161 places in 59 ms of which 1 ms to minimize.
[2024-05-31 19:06:06] [INFO ] Deduced a trap composed of 160 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/516 variables, 10/533 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-31 19:06:12] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/516 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-31 19:06:23] [INFO ] Deduced a trap composed of 163 places in 68 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/516 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-31 19:06:25] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-31 19:06:27] [INFO ] Deduced a trap composed of 160 places in 60 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/516 variables, 2/537 constraints. Problems are: Problem set: 0 solved, 285 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 516/516 variables, and 537 constraints, problems are : Problem set: 0 solved, 285 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 14/14 constraints]
After SMT, in 38846ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 38848ms
Finished structural reductions in LTL mode , in 1 iterations and 39071 ms. Remains : 230/230 places, 286/286 transitions.
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-11 finished in 138938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(G((F(p1) U p2))))))'
Support contains 4 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 313/313 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 237 transition count 299
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 237 transition count 299
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 228 transition count 290
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 228 transition count 290
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 52 place count 228 transition count 284
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 226 transition count 282
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 226 transition count 282
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 58 place count 226 transition count 280
Applied a total of 58 rules in 9 ms. Remains 226 /251 variables (removed 25) and now considering 280/313 (removed 33) transitions.
// Phase 1: matrix 280 rows 226 cols
[2024-05-31 19:06:30] [INFO ] Computed 8 invariants in 2 ms
[2024-05-31 19:06:30] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-31 19:06:30] [INFO ] Invariant cache hit.
[2024-05-31 19:06:30] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 279 sub problems to find dead transitions.
[2024-05-31 19:06:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (OVERLAPS) 280/506 variables, 226/234 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (OVERLAPS) 0/506 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Real declared 506/506 variables, and 234 constraints, problems are : Problem set: 0 solved, 279 unsolved in 8278 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 279 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/226 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/226 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (OVERLAPS) 280/506 variables, 226/234 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/506 variables, 279/513 constraints. Problems are: Problem set: 0 solved, 279 unsolved
[2024-05-31 19:06:42] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 1 ms to minimize.
[2024-05-31 19:06:42] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 1 ms to minimize.
[2024-05-31 19:06:43] [INFO ] Deduced a trap composed of 63 places in 61 ms of which 2 ms to minimize.
[2024-05-31 19:06:43] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-31 19:06:43] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 1 ms to minimize.
[2024-05-31 19:06:44] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 2 ms to minimize.
[2024-05-31 19:06:44] [INFO ] Deduced a trap composed of 159 places in 64 ms of which 1 ms to minimize.
[2024-05-31 19:06:44] [INFO ] Deduced a trap composed of 159 places in 59 ms of which 1 ms to minimize.
[2024-05-31 19:06:44] [INFO ] Deduced a trap composed of 159 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/506 variables, 9/522 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/506 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 7 (OVERLAPS) 0/506 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 279 unsolved
No progress, stopping.
After SMT solving in domain Int declared 506/506 variables, and 522 constraints, problems are : Problem set: 0 solved, 279 unsolved in 16561 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 9/9 constraints]
After SMT, in 24892ms problems are : Problem set: 0 solved, 279 unsolved
Search for dead transitions found 0 dead transitions in 24896ms
Starting structural reductions in LTL mode, iteration 1 : 226/251 places, 280/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25153 ms. Remains : 226/251 places, 280/313 transitions.
Stuttering acceptance computed with spot in 305 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-12
Stuttering criterion allowed to conclude after 52 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-12 finished in 25481 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G((X(G(p1))&&((p3 U p4)||p2))))))'
Support contains 5 out of 251 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 251/251 places, 313/313 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 239 transition count 301
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 239 transition count 301
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 232 transition count 294
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 232 transition count 294
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 43 place count 232 transition count 289
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 230 transition count 287
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 230 transition count 287
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 49 place count 230 transition count 285
Applied a total of 49 rules in 15 ms. Remains 230 /251 variables (removed 21) and now considering 285/313 (removed 28) transitions.
// Phase 1: matrix 285 rows 230 cols
[2024-05-31 19:06:56] [INFO ] Computed 8 invariants in 3 ms
[2024-05-31 19:06:56] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-31 19:06:56] [INFO ] Invariant cache hit.
[2024-05-31 19:06:56] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-05-31 19:06:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-31 19:06:58] [INFO ] Deduced a trap composed of 160 places in 81 ms of which 2 ms to minimize.
[2024-05-31 19:06:58] [INFO ] Deduced a trap composed of 162 places in 72 ms of which 2 ms to minimize.
[2024-05-31 19:06:59] [INFO ] Deduced a trap composed of 157 places in 62 ms of which 1 ms to minimize.
[2024-05-31 19:06:59] [INFO ] Deduced a trap composed of 62 places in 58 ms of which 1 ms to minimize.
[2024-05-31 19:06:59] [INFO ] Deduced a trap composed of 56 places in 55 ms of which 2 ms to minimize.
[2024-05-31 19:07:00] [INFO ] Deduced a trap composed of 159 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-31 19:07:01] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
[2024-05-31 19:07:01] [INFO ] Deduced a trap composed of 58 places in 41 ms of which 0 ms to minimize.
[2024-05-31 19:07:01] [INFO ] Deduced a trap composed of 57 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (OVERLAPS) 285/515 variables, 230/247 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-31 19:07:05] [INFO ] Deduced a trap composed of 159 places in 61 ms of which 2 ms to minimize.
[2024-05-31 19:07:05] [INFO ] Deduced a trap composed of 159 places in 56 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/515 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (OVERLAPS) 0/515 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Real declared 515/515 variables, and 249 constraints, problems are : Problem set: 0 solved, 284 unsolved in 15047 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 284 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 4 (OVERLAPS) 285/515 variables, 230/249 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 284/533 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-31 19:07:14] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-31 19:07:14] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-31 19:07:14] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 2 ms to minimize.
[2024-05-31 19:07:14] [INFO ] Deduced a trap composed of 64 places in 49 ms of which 2 ms to minimize.
[2024-05-31 19:07:14] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
[2024-05-31 19:07:15] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 1 ms to minimize.
[2024-05-31 19:07:15] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 2 ms to minimize.
[2024-05-31 19:07:16] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 2 ms to minimize.
[2024-05-31 19:07:16] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 1 ms to minimize.
[2024-05-31 19:07:17] [INFO ] Deduced a trap composed of 65 places in 52 ms of which 1 ms to minimize.
[2024-05-31 19:07:17] [INFO ] Deduced a trap composed of 181 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 11/544 constraints. Problems are: Problem set: 0 solved, 284 unsolved
[2024-05-31 19:07:19] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 2 ms to minimize.
[2024-05-31 19:07:19] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/515 variables, 2/546 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 284 unsolved
At refinement iteration 9 (OVERLAPS) 0/515 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 284 unsolved
No progress, stopping.
After SMT solving in domain Int declared 515/515 variables, and 546 constraints, problems are : Problem set: 0 solved, 284 unsolved in 21805 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 284/284 constraints, Known Traps: 24/24 constraints]
After SMT, in 36915ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 36919ms
Starting structural reductions in LTL mode, iteration 1 : 230/251 places, 285/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37151 ms. Remains : 230/251 places, 285/313 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p1))), true, (NOT p1), (NOT p4), (OR (AND p1 (NOT p2) (NOT p4)) (AND (NOT p1) p4) (AND (NOT p1) p2) (AND (NOT p1) p3))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-13 finished in 37433 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) U ((X(p0)&&(p1 U (p2&&F(p1))))||X(G(p0))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(X(p1)))||p0))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U (X(p1)&&(p2 U (p3||G(p2)))))))'
[2024-05-31 19:07:33] [INFO ] Flatten gal took : 14 ms
[2024-05-31 19:07:33] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-05-31 19:07:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 251 places, 313 transitions and 849 arcs took 3 ms.
Total runtime 569751 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA FlexibleBarrier-PT-06b-LTLFireability-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-06b-LTLFireability-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA FlexibleBarrier-PT-06b-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717182620675

--------------------
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 FlexibleBarrier-PT-06b-LTLFireability-05
ltl formula formula --ltl=/tmp/2504/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 251 places, 313 transitions and 849 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.030 real 0.000 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2504/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2504/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2504/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2504/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 11 states
pnml2lts-mc( 0/ 4): There are 252 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 252, there are 406 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~269 levels ~10000 states ~26020 transitions
pnml2lts-mc( 1/ 4): ~108 levels ~20000 states ~40920 transitions
pnml2lts-mc( 1/ 4): ~326 levels ~40000 states ~89600 transitions
pnml2lts-mc( 1/ 4): ~326 levels ~80000 states ~200228 transitions
pnml2lts-mc( 1/ 4): ~326 levels ~160000 states ~425488 transitions
pnml2lts-mc( 1/ 4): ~1778 levels ~320000 states ~1056804 transitions
pnml2lts-mc( 3/ 4): ~1314 levels ~640000 states ~1725128 transitions
pnml2lts-mc( 3/ 4): ~7448 levels ~1280000 states ~3827520 transitions
pnml2lts-mc( 3/ 4): ~7448 levels ~2560000 states ~7770988 transitions
pnml2lts-mc( 3/ 4): ~11627 levels ~5120000 states ~15979700 transitions
pnml2lts-mc( 3/ 4): ~19061 levels ~10240000 states ~34007480 transitions
pnml2lts-mc( 3/ 4): ~110720 levels ~20480000 states ~82859300 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 6846853
pnml2lts-mc( 0/ 4): unique states count: 33511088
pnml2lts-mc( 0/ 4): unique transitions count: 147000071
pnml2lts-mc( 0/ 4): - self-loop count: 466815
pnml2lts-mc( 0/ 4): - claim dead count: 65713972
pnml2lts-mc( 0/ 4): - claim found count: 47238668
pnml2lts-mc( 0/ 4): - claim success count: 33511096
pnml2lts-mc( 0/ 4): - cum. max stack depth: 580006
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33511096 states 147000089 transitions, fanout: 4.387
pnml2lts-mc( 0/ 4): Total exploration time 165.120 sec (165.100 sec minimum, 165.115 sec on average)
pnml2lts-mc( 0/ 4): States per second: 202950, Transitions per second: 890262
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 258.8MB, 8.1 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/4.0%
pnml2lts-mc( 0/ 4): Stored 316 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 258.8MB (~256.0MB paged-in)
ltl formula name FlexibleBarrier-PT-06b-LTLFireability-06
ltl formula formula --ltl=/tmp/2504/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 251 places, 313 transitions and 849 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.030 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2504/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2504/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2504/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2504/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): There are 252 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 252, there are 383 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): ~244 levels ~10000 states ~45504 transitions
pnml2lts-mc( 0/ 4): ~296 levels ~20000 states ~82620 transitions
pnml2lts-mc( 0/ 4): ~325 levels ~40000 states ~172488 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~730!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 28333
pnml2lts-mc( 0/ 4): unique states count: 71677
pnml2lts-mc( 0/ 4): unique transitions count: 324644
pnml2lts-mc( 0/ 4): - self-loop count: 10543
pnml2lts-mc( 0/ 4): - claim dead count: 131879
pnml2lts-mc( 0/ 4): - claim found count: 98669
pnml2lts-mc( 0/ 4): - claim success count: 71686
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2739
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 71686 states 324686 transitions, fanout: 4.529
pnml2lts-mc( 0/ 4): Total exploration time 0.530 sec (0.530 sec minimum, 0.530 sec on average)
pnml2lts-mc( 0/ 4): States per second: 135257, Transitions per second: 612615
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.7MB, 9.4 B/state, compr.: 0.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 316 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.7MB (~256.0MB paged-in)
ltl formula name FlexibleBarrier-PT-06b-LTLFireability-11
ltl formula formula --ltl=/tmp/2504/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 251 places, 313 transitions and 849 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.030 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2504/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2504/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2504/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2504/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 252 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 252, there are 343 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~74!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 3091
pnml2lts-mc( 0/ 4): unique states count: 4518
pnml2lts-mc( 0/ 4): unique transitions count: 9998
pnml2lts-mc( 0/ 4): - self-loop count: 219
pnml2lts-mc( 0/ 4): - claim dead count: 1992
pnml2lts-mc( 0/ 4): - claim found count: 753
pnml2lts-mc( 0/ 4): - claim success count: 4535
pnml2lts-mc( 0/ 4): - cum. max stack depth: 567
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4535 states 10044 transitions, fanout: 2.215
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.040 sec minimum, 0.040 sec on average)
pnml2lts-mc( 0/ 4): States per second: 113375, Transitions per second: 251100
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 13.3 B/state, compr.: 1.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 316 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~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="FlexibleBarrier-PT-06b"
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 FlexibleBarrier-PT-06b, 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 r496-tall-171640602500028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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