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.r180-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 itstools
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 r180-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 1716416110129

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 22:15:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 22:15:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 22:15:11] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-05-22 22:15:11] [INFO ] Transformed 542 places.
[2024-05-22 22:15:11] [INFO ] Transformed 621 transitions.
[2024-05-22 22:15:11] [INFO ] Found NUPN structural information;
[2024-05-22 22:15:11] [INFO ] Parsed PT model containing 542 places and 621 transitions and 1533 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 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 99 ms. Remains 251 /542 variables (removed 291) and now considering 313/621 (removed 308) transitions.
// Phase 1: matrix 313 rows 251 cols
[2024-05-22 22:15:11] [INFO ] Computed 8 invariants in 26 ms
[2024-05-22 22:15:12] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-22 22:15:12] [INFO ] Invariant cache hit.
[2024-05-22 22:15:12] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
Running 312 sub problems to find dead transitions.
[2024-05-22 22:15:12] [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-22 22:15:15] [INFO ] Deduced a trap composed of 171 places in 121 ms of which 20 ms to minimize.
[2024-05-22 22:15:15] [INFO ] Deduced a trap composed of 171 places in 84 ms of which 2 ms to minimize.
[2024-05-22 22:15:16] [INFO ] Deduced a trap composed of 166 places in 86 ms of which 2 ms to minimize.
[2024-05-22 22:15:16] [INFO ] Deduced a trap composed of 88 places in 73 ms of which 2 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-22 22:15:18] [INFO ] Deduced a trap composed of 74 places in 61 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-22 22:15:21] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 3 ms to minimize.
[2024-05-22 22:15:21] [INFO ] Deduced a trap composed of 89 places in 71 ms of which 2 ms to minimize.
[2024-05-22 22:15:21] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 1 ms to minimize.
[2024-05-22 22:15:21] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 1 ms to minimize.
[2024-05-22 22:15:21] [INFO ] Deduced a trap composed of 169 places in 65 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-22 22:15:27] [INFO ] Deduced a trap composed of 169 places in 81 ms of which 2 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-22 22:15:30] [INFO ] Deduced a trap composed of 169 places in 82 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 24709 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-22 22:15:40] [INFO ] Deduced a trap composed of 26 places in 97 ms of which 1 ms to minimize.
[2024-05-22 22:15:41] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-22 22:15:41] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 1 ms to minimize.
[2024-05-22 22:15:41] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 2 ms to minimize.
[2024-05-22 22:15:42] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 1 ms to minimize.
[2024-05-22 22:15:42] [INFO ] Deduced a trap composed of 70 places in 72 ms of which 1 ms to minimize.
[2024-05-22 22:15:43] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 1 ms to minimize.
[2024-05-22 22:15:44] [INFO ] Deduced a trap composed of 68 places in 56 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-22 22:15:47] [INFO ] Deduced a trap composed of 91 places in 77 ms of which 2 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-22 22:15:56] [INFO ] Deduced a trap composed of 191 places in 87 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 30019 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 54858ms problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 54872ms
Starting structural reductions in LTL mode, iteration 1 : 251/542 places, 313/621 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55502 ms. Remains : 251/542 places, 313/621 transitions.
Support contains 31 out of 251 places after structural reductions.
[2024-05-22 22:16:07] [INFO ] Flatten gal took : 45 ms
[2024-05-22 22:16:07] [INFO ] Flatten gal took : 18 ms
[2024-05-22 22:16:07] [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 (742 resets) in 1795 ms. (22 steps per ms) remains 3/29 properties
BEST_FIRST walk for 40002 steps (104 resets) in 93 ms. (425 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (106 resets) in 75 ms. (526 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (110 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
[2024-05-22 22:16:08] [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 248 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 217 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 478ms 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 3 ms. (steps per millisecond=29 )
Parikh walk visited 3 properties in 14 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 4 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 1 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 105 ms. Remains 102 /251 variables (removed 149) and now considering 150/313 (removed 163) transitions.
[2024-05-22 22:16:09] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
// Phase 1: matrix 139 rows 102 cols
[2024-05-22 22:16:09] [INFO ] Computed 8 invariants in 1 ms
[2024-05-22 22:16:09] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-22 22:16:09] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
[2024-05-22 22:16:09] [INFO ] Invariant cache hit.
[2024-05-22 22:16:09] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2024-05-22 22:16:09] [INFO ] Redundant transitions in 4 ms returned []
Running 81 sub problems to find dead transitions.
[2024-05-22 22:16:09] [INFO ] Flow matrix only has 139 transitions (discarded 11 similar events)
[2024-05-22 22:16:09] [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 1385 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 1496 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 2917ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 2919ms
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 3190 ms. Remains : 102/251 places, 150/313 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-00
Stuttering criterion allowed to conclude after 1838 steps with 146 reset in 25 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-00 finished in 3490 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 0 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 46 ms. Remains 106 /251 variables (removed 145) and now considering 155/313 (removed 158) transitions.
[2024-05-22 22:16:12] [INFO ] Flow matrix only has 144 transitions (discarded 11 similar events)
// Phase 1: matrix 144 rows 106 cols
[2024-05-22 22:16:12] [INFO ] Computed 8 invariants in 1 ms
[2024-05-22 22:16:12] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-22 22:16:12] [INFO ] Flow matrix only has 144 transitions (discarded 11 similar events)
[2024-05-22 22:16:12] [INFO ] Invariant cache hit.
[2024-05-22 22:16:12] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-05-22 22:16:12] [INFO ] Redundant transitions in 4 ms returned []
Running 85 sub problems to find dead transitions.
[2024-05-22 22:16:12] [INFO ] Flow matrix only has 144 transitions (discarded 11 similar events)
[2024-05-22 22:16:12] [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 1488 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-22 22:16:15] [INFO ] Deduced a trap composed of 37 places in 44 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 2321 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 3841ms 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 4053 ms. Remains : 106/251 places, 155/313 transitions.
Stuttering acceptance computed with spot in 154 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 1 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-03 finished in 4222 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 25 ms. Remains 229 /251 variables (removed 22) and now considering 285/313 (removed 28) transitions.
// Phase 1: matrix 285 rows 229 cols
[2024-05-22 22:16:16] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 22:16:16] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-22 22:16:16] [INFO ] Invariant cache hit.
[2024-05-22 22:16:17] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-05-22 22:16:17] [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 8800 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-22 22:16:29] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 2 ms to minimize.
[2024-05-22 22:16:29] [INFO ] Deduced a trap composed of 62 places in 62 ms of which 2 ms to minimize.
[2024-05-22 22:16:29] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-22 22:16:30] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2024-05-22 22:16:30] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2024-05-22 22:16:31] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2024-05-22 22:16:31] [INFO ] Deduced a trap composed of 57 places in 54 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 17023 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 25893ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 25895ms
Starting structural reductions in LTL mode, iteration 1 : 229/251 places, 285/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26125 ms. Remains : 229/251 places, 285/313 transitions.
Stuttering acceptance computed with spot in 244 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 92 steps with 1 reset in 2 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-04 finished in 26400 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-22 22:16:43] [INFO ] Computed 8 invariants in 3 ms
[2024-05-22 22:16:43] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-22 22:16:43] [INFO ] Invariant cache hit.
[2024-05-22 22:16:43] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2024-05-22 22:16:43] [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 8635 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-22 22:16:55] [INFO ] Deduced a trap composed of 120 places in 79 ms of which 2 ms to minimize.
[2024-05-22 22:16:55] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 1 ms to minimize.
[2024-05-22 22:16:55] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 2 ms to minimize.
[2024-05-22 22:16:56] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 2 ms to minimize.
[2024-05-22 22:16:56] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 5 ms to minimize.
[2024-05-22 22:16:56] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 1 ms to minimize.
[2024-05-22 22:16:57] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 1 ms to minimize.
[2024-05-22 22:16:57] [INFO ] Deduced a trap composed of 160 places in 67 ms of which 2 ms to minimize.
[2024-05-22 22:16:57] [INFO ] Deduced a trap composed of 160 places in 71 ms of which 2 ms to minimize.
[2024-05-22 22:16:58] [INFO ] Deduced a trap composed of 160 places in 95 ms of which 2 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-22 22:17:02] [INFO ] Deduced a trap composed of 160 places in 73 ms of which 2 ms to minimize.
[2024-05-22 22:17:02] [INFO ] Deduced a trap composed of 163 places in 69 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 22241 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 30935ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 30937ms
Starting structural reductions in LTL mode, iteration 1 : 229/251 places, 284/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31198 ms. Remains : 229/251 places, 284/313 transitions.
Stuttering acceptance computed with spot in 435 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 24972 reset in 210 ms.
Product exploration explored 100000 steps with 24968 reset in 155 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 125 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 418 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 (728 resets) in 389 ms. (102 steps per ms) remains 5/13 properties
BEST_FIRST walk for 40003 steps (111 resets) in 162 ms. (245 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (109 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (114 resets) in 79 ms. (500 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (117 resets) in 73 ms. (540 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (113 resets) in 75 ms. (526 steps per ms) remains 5/5 properties
[2024-05-22 22:17:16] [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, 5 unsolved
At refinement iteration 1 (OVERLAPS) 100/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 126/229 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 284/513 variables, 229/237 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/513 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 513/513 variables, and 237 constraints, problems are : Problem set: 0 solved, 5 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 100/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 126/229 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 284/513 variables, 229/237 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 5/242 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/513 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 513/513 variables, and 242 constraints, problems are : Problem set: 0 solved, 5 unsolved in 258 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 461ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 1317 steps, including 15 resets, run visited all 5 properties in 9 ms. (steps per millisecond=146 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 9 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 527 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 391 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 434 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 9 ms. Remains 229 /229 variables (removed 0) and now considering 284/284 (removed 0) transitions.
[2024-05-22 22:17:17] [INFO ] Invariant cache hit.
[2024-05-22 22:17:17] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-22 22:17:17] [INFO ] Invariant cache hit.
[2024-05-22 22:17:18] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 283 sub problems to find dead transitions.
[2024-05-22 22:17:18] [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 8496 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-22 22:17:29] [INFO ] Deduced a trap composed of 120 places in 76 ms of which 1 ms to minimize.
[2024-05-22 22:17:29] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 2 ms to minimize.
[2024-05-22 22:17:30] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 1 ms to minimize.
[2024-05-22 22:17:30] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 2 ms to minimize.
[2024-05-22 22:17:31] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 2 ms to minimize.
[2024-05-22 22:17:31] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2024-05-22 22:17:31] [INFO ] Deduced a trap composed of 65 places in 53 ms of which 2 ms to minimize.
[2024-05-22 22:17:32] [INFO ] Deduced a trap composed of 160 places in 70 ms of which 1 ms to minimize.
[2024-05-22 22:17:32] [INFO ] Deduced a trap composed of 160 places in 69 ms of which 2 ms to minimize.
[2024-05-22 22:17:32] [INFO ] Deduced a trap composed of 160 places in 71 ms of which 2 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-22 22:17:36] [INFO ] Deduced a trap composed of 160 places in 74 ms of which 2 ms to minimize.
[2024-05-22 22:17:36] [INFO ] Deduced a trap composed of 163 places in 72 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 21687 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 30238ms problems are : Problem set: 0 solved, 283 unsolved
Search for dead transitions found 0 dead transitions in 30240ms
Finished structural reductions in LTL mode , in 1 iterations and 30475 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 122 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 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))]
RANDOM walk for 40000 steps (735 resets) in 182 ms. (218 steps per ms) remains 2/13 properties
BEST_FIRST walk for 40004 steps (118 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (111 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
[2024-05-22 22:17:49] [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 133 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-22 22:17:49] [INFO ] Deduced a trap composed of 29 places in 63 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 235 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 374ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 481 steps, including 6 resets, run visited all 2 properties in 5 ms. (steps per millisecond=96 )
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 4 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 610 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 420 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 443 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 445 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 25023 reset in 107 ms.
Product exploration explored 100000 steps with 24946 reset in 119 ms.
Applying partial POR strategy [false, false, true, false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 399 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 0 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 1 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 0 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 1 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 44 ms. Remains 155 /229 variables (removed 74) and now considering 219/284 (removed 65) transitions.
[2024-05-22 22:17:52] [INFO ] Redundant transitions in 7 ms returned []
Running 218 sub problems to find dead transitions.
[2024-05-22 22:17:52] [INFO ] Flow matrix only has 208 transitions (discarded 11 similar events)
// Phase 1: matrix 208 rows 155 cols
[2024-05-22 22:17:52] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 22:17:52] [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-22 22:17:53] [INFO ] Deduced a trap composed of 13 places in 20 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 TDEAD32 is UNSAT
[2024-05-22 22:17:53] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 5 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-22 22:17:53] [INFO ] Deduced a trap composed of 16 places in 36 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-22 22:17:53] [INFO ] Deduced a trap composed of 15 places in 30 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-22 22:17:53] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 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-22 22:17:53] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 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-22 22:17:53] [INFO ] Deduced a trap composed of 27 places in 27 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-22 22:17:54] [INFO ] Deduced a trap composed of 3 places in 59 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 6770 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 6850 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 13685ms problems are : Problem set: 64 solved, 154 unsolved
Search for dead transitions found 64 dead transitions in 13690ms
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 14 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 13760 ms. Remains : 107/229 places, 155/284 transitions.
Built C files in :
/tmp/ltsmin13869401944012564562
[2024-05-22 22:18:05] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13869401944012564562
Running compilation step : cd /tmp/ltsmin13869401944012564562;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 608 ms.
Running link step : cd /tmp/ltsmin13869401944012564562;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin13869401944012564562;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4154100502332810229.hoa' '--buchi-type=spotba'
LTSmin run took 1244 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-05 finished in 84729 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 14 ms. Remains 225 /251 variables (removed 26) and now considering 279/313 (removed 34) transitions.
// Phase 1: matrix 279 rows 225 cols
[2024-05-22 22:18:07] [INFO ] Computed 8 invariants in 4 ms
[2024-05-22 22:18:08] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-22 22:18:08] [INFO ] Invariant cache hit.
[2024-05-22 22:18:08] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2024-05-22 22:18:08] [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 8457 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-22 22:18:19] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 2 ms to minimize.
[2024-05-22 22:18:20] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 1 ms to minimize.
[2024-05-22 22:18:20] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 2 ms to minimize.
[2024-05-22 22:18:20] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 1 ms to minimize.
[2024-05-22 22:18:21] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 1 ms to minimize.
[2024-05-22 22:18:21] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 1 ms to minimize.
[2024-05-22 22:18:22] [INFO ] Deduced a trap composed of 158 places in 68 ms of which 1 ms to minimize.
[2024-05-22 22:18:22] [INFO ] Deduced a trap composed of 158 places in 70 ms of which 2 ms to minimize.
[2024-05-22 22:18:22] [INFO ] Deduced a trap composed of 158 places in 69 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-22 22:18:30] [INFO ] Deduced a trap composed of 161 places in 75 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 25183 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 33690ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 33695ms
Starting structural reductions in LTL mode, iteration 1 : 225/251 places, 279/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33921 ms. Remains : 225/251 places, 279/313 transitions.
Stuttering acceptance computed with spot in 188 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 1836 reset in 160 ms.
Product exploration explored 100000 steps with 1833 reset in 220 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 90 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 158 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 (733 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (107 resets) in 23 ms. (1666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (107 resets) in 24 ms. (1600 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 812598 steps, run timeout after 3001 ms. (steps per millisecond=270 ) properties seen :0 out of 2
Probabilistic random walk after 812598 steps, saw 227965 distinct states, run finished after 3007 ms. (steps per millisecond=270 ) properties seen :0
[2024-05-22 22:18:45] [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 163 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 162 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 330ms 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 145 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 182 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 168 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 7 ms. Remains 225 /225 variables (removed 0) and now considering 279/279 (removed 0) transitions.
[2024-05-22 22:18:46] [INFO ] Invariant cache hit.
[2024-05-22 22:18:46] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-22 22:18:46] [INFO ] Invariant cache hit.
[2024-05-22 22:18:46] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2024-05-22 22:18: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 8419 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-22 22:18:58] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 1 ms to minimize.
[2024-05-22 22:18:58] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 1 ms to minimize.
[2024-05-22 22:18:59] [INFO ] Deduced a trap composed of 63 places in 71 ms of which 2 ms to minimize.
[2024-05-22 22:18:59] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 2 ms to minimize.
[2024-05-22 22:18:59] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 1 ms to minimize.
[2024-05-22 22:19:00] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 6 ms to minimize.
[2024-05-22 22:19:00] [INFO ] Deduced a trap composed of 158 places in 69 ms of which 2 ms to minimize.
[2024-05-22 22:19:00] [INFO ] Deduced a trap composed of 158 places in 68 ms of which 1 ms to minimize.
[2024-05-22 22:19:00] [INFO ] Deduced a trap composed of 158 places in 74 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-22 22:19:08] [INFO ] Deduced a trap composed of 161 places in 67 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 25246 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 33730ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 33732ms
Finished structural reductions in LTL mode , in 1 iterations and 33961 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 81 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 145 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 (725 resets) in 186 ms. (213 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (110 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (105 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 840509 steps, run timeout after 3002 ms. (steps per millisecond=279 ) properties seen :0 out of 2
Probabilistic random walk after 840509 steps, saw 237046 distinct states, run finished after 3003 ms. (steps per millisecond=279 ) properties seen :0
[2024-05-22 22:19:23] [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 162 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 156 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 325ms 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 2 ms.
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 107 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 173 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 141 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 141 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 1815 reset in 113 ms.
Product exploration explored 100000 steps with 1834 reset in 117 ms.
Built C files in :
/tmp/ltsmin13389616804219741025
[2024-05-22 22:19:25] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13389616804219741025
Running compilation step : cd /tmp/ltsmin13389616804219741025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 488 ms.
Running link step : cd /tmp/ltsmin13389616804219741025;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin13389616804219741025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10513068557429016852.hoa' '--buchi-type=spotba'
LTSmin run took 5900 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-06 finished in 83679 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 14 ms. Remains 229 /251 variables (removed 22) and now considering 285/313 (removed 28) transitions.
// Phase 1: matrix 285 rows 229 cols
[2024-05-22 22:19:31] [INFO ] Computed 8 invariants in 1 ms
[2024-05-22 22:19:31] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-22 22:19:31] [INFO ] Invariant cache hit.
[2024-05-22 22:19:31] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-05-22 22:19:31] [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 8595 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-22 22:19:43] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 1 ms to minimize.
[2024-05-22 22:19:44] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 2 ms to minimize.
[2024-05-22 22:19:44] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 2 ms to minimize.
[2024-05-22 22:19:44] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 2 ms to minimize.
[2024-05-22 22:19:45] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 2 ms to minimize.
[2024-05-22 22:19:45] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 1 ms to minimize.
[2024-05-22 22:19:46] [INFO ] Deduced a trap composed of 159 places in 71 ms of which 1 ms to minimize.
[2024-05-22 22:19:46] [INFO ] Deduced a trap composed of 160 places in 74 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-22 22:19:50] [INFO ] Deduced a trap composed of 183 places in 75 ms of which 2 ms to minimize.
[2024-05-22 22:19:50] [INFO ] Deduced a trap composed of 161 places in 68 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-22 22:19:54] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 1 ms to minimize.
[2024-05-22 22:19:55] [INFO ] Deduced a trap composed of 160 places in 74 ms of which 1 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-22 22:20:00] [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 30028 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 38680ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 38683ms
Starting structural reductions in LTL mode, iteration 1 : 229/251 places, 285/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38919 ms. Remains : 229/251 places, 285/313 transitions.
Stuttering acceptance computed with spot in 284 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 92 ms.
Product exploration explored 100000 steps with 50000 reset in 109 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 20 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 39462 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 0 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 29 ms. Remains 101 /251 variables (removed 150) and now considering 154/313 (removed 159) transitions.
[2024-05-22 22:20:11] [INFO ] Flow matrix only has 138 transitions (discarded 16 similar events)
// Phase 1: matrix 138 rows 101 cols
[2024-05-22 22:20:11] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 22:20:11] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-22 22:20:11] [INFO ] Flow matrix only has 138 transitions (discarded 16 similar events)
[2024-05-22 22:20:11] [INFO ] Invariant cache hit.
[2024-05-22 22:20:11] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-05-22 22:20:11] [INFO ] Redundant transitions in 1 ms returned []
Running 110 sub problems to find dead transitions.
[2024-05-22 22:20:11] [INFO ] Flow matrix only has 138 transitions (discarded 16 similar events)
[2024-05-22 22:20:11] [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 1888 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 2289 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 4214ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 4215ms
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 4404 ms. Remains : 101/251 places, 154/313 transitions.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-06b-LTLFireability-08
Product exploration explored 100000 steps with 7081 reset in 242 ms.
Stack based approach found an accepted trace after 2122 steps with 150 reset with depth 7 and stack size 7 in 5 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-08 finished in 4732 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 37 ms. Remains 104 /251 variables (removed 147) and now considering 159/313 (removed 154) transitions.
[2024-05-22 22:20:15] [INFO ] Flow matrix only has 149 transitions (discarded 10 similar events)
// Phase 1: matrix 149 rows 104 cols
[2024-05-22 22:20:15] [INFO ] Computed 8 invariants in 3 ms
[2024-05-22 22:20:15] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-22 22:20:15] [INFO ] Flow matrix only has 149 transitions (discarded 10 similar events)
[2024-05-22 22:20:15] [INFO ] Invariant cache hit.
[2024-05-22 22:20:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 22:20:15] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2024-05-22 22:20:16] [INFO ] Redundant transitions in 1 ms returned []
Running 131 sub problems to find dead transitions.
[2024-05-22 22:20:16] [INFO ] Flow matrix only has 149 transitions (discarded 10 similar events)
[2024-05-22 22:20:16] [INFO ] Invariant cache hit.
[2024-05-22 22:20:16] [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 2913 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 3988 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 6942ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 6943ms
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 7153 ms. Remains : 104/251 places, 159/313 transitions.
Stuttering acceptance computed with spot in 49 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 7226 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 14 ms. Remains 230 /251 variables (removed 21) and now considering 286/313 (removed 27) transitions.
// Phase 1: matrix 286 rows 230 cols
[2024-05-22 22:20:23] [INFO ] Computed 8 invariants in 3 ms
[2024-05-22 22:20:23] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-22 22:20:23] [INFO ] Invariant cache hit.
[2024-05-22 22:20:23] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 285 sub problems to find dead transitions.
[2024-05-22 22:20:23] [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 8847 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-22 22:20:35] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-22 22:20:35] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 2 ms to minimize.
[2024-05-22 22:20:35] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 1 ms to minimize.
[2024-05-22 22:20:36] [INFO ] Deduced a trap composed of 63 places in 72 ms of which 1 ms to minimize.
[2024-05-22 22:20:36] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 2 ms to minimize.
[2024-05-22 22:20:36] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 1 ms to minimize.
[2024-05-22 22:20:37] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 1 ms to minimize.
[2024-05-22 22:20:37] [INFO ] Deduced a trap composed of 160 places in 69 ms of which 1 ms to minimize.
[2024-05-22 22:20:37] [INFO ] Deduced a trap composed of 161 places in 64 ms of which 1 ms to minimize.
[2024-05-22 22:20:38] [INFO ] Deduced a trap composed of 160 places in 60 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-22 22:20:44] [INFO ] Deduced a trap composed of 58 places in 74 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-22 22:20:55] [INFO ] Deduced a trap composed of 163 places in 91 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-22 22:20:57] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 2 ms to minimize.
[2024-05-22 22:20:59] [INFO ] Deduced a trap composed of 160 places in 72 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 30009 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 38904ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 38906ms
Starting structural reductions in LTL mode, iteration 1 : 230/251 places, 286/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39144 ms. Remains : 230/251 places, 286/313 transitions.
Stuttering acceptance computed with spot in 284 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 33181 reset in 146 ms.
Product exploration explored 100000 steps with 33443 reset in 169 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 246 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 241 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 (726 resets) in 258 ms. (154 steps per ms) remains 3/12 properties
BEST_FIRST walk for 40002 steps (102 resets) in 242 ms. (164 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (70 resets) in 36 ms. (1081 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (109 resets) in 313 ms. (127 steps per ms) remains 3/3 properties
[2024-05-22 22:21:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 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, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/230 variables, 5/8 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 286/516 variables, 230/238 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/238 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/516 variables, 0/238 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 516/516 variables, and 238 constraints, problems are : Problem set: 2 solved, 1 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/101 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/230 variables, 5/8 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 286/516 variables, 230/238 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 1/239 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 0/239 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/516 variables, 0/239 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 516/516 variables, and 239 constraints, problems are : Problem set: 2 solved, 1 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 269ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 86 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=86 )
Parikh walk visited 1 properties in 0 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 505 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 213 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 184 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 2 ms. Remains 230 /230 variables (removed 0) and now considering 286/286 (removed 0) transitions.
[2024-05-22 22:21:04] [INFO ] Invariant cache hit.
[2024-05-22 22:21:04] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-22 22:21:04] [INFO ] Invariant cache hit.
[2024-05-22 22:21:05] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Running 285 sub problems to find dead transitions.
[2024-05-22 22:21:05] [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 8676 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-22 22:21:16] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-22 22:21:17] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 2 ms to minimize.
[2024-05-22 22:21:17] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 2 ms to minimize.
[2024-05-22 22:21:17] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 2 ms to minimize.
[2024-05-22 22:21:18] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 1 ms to minimize.
[2024-05-22 22:21:18] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 1 ms to minimize.
[2024-05-22 22:21:18] [INFO ] Deduced a trap composed of 66 places in 47 ms of which 0 ms to minimize.
[2024-05-22 22:21:19] [INFO ] Deduced a trap composed of 160 places in 72 ms of which 1 ms to minimize.
[2024-05-22 22:21:19] [INFO ] Deduced a trap composed of 161 places in 70 ms of which 2 ms to minimize.
[2024-05-22 22:21:19] [INFO ] Deduced a trap composed of 160 places in 69 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-22 22:21:25] [INFO ] Deduced a trap composed of 58 places in 78 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-22 22:21:36] [INFO ] Deduced a trap composed of 163 places in 88 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-22 22:21:39] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
[2024-05-22 22:21:41] [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 30016 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 38742ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 38744ms
Finished structural reductions in LTL mode , in 1 iterations and 39091 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 193 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 197 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 (725 resets) in 436 ms. (91 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40004 steps (114 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
[2024-05-22 22:21:44] [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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/101 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/230 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 286/516 variables, 230/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/516 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 516/516 variables, and 238 constraints, problems are : Problem set: 0 solved, 1 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/101 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 129/230 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 286/516 variables, 230/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/516 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/516 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 516/516 variables, and 239 constraints, problems are : Problem set: 0 solved, 1 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 281ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 86 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=86 )
Parikh walk visited 1 properties in 1 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 529 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 202 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 192 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 210 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 33535 reset in 107 ms.
Product exploration explored 100000 steps with 33423 reset in 109 ms.
Applying partial POR strategy [false, true, false, false, false]
Stuttering acceptance computed with spot in 202 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 31 ms. Remains 162 /230 variables (removed 68) and now considering 247/286 (removed 39) transitions.
[2024-05-22 22:21:46] [INFO ] Redundant transitions in 1 ms returned []
Running 245 sub problems to find dead transitions.
[2024-05-22 22:21:46] [INFO ] Flow matrix only has 238 transitions (discarded 9 similar events)
// Phase 1: matrix 238 rows 162 cols
[2024-05-22 22:21:46] [INFO ] Computed 8 invariants in 1 ms
[2024-05-22 22:21:46] [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-22 22:21:48] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 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-22 22:21:48] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 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-22 22:21:48] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 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-22 22:21:48] [INFO ] Deduced a trap composed of 15 places in 28 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-22 22:21:48] [INFO ] Deduced a trap composed of 16 places in 24 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-22 22:21:48] [INFO ] Deduced a trap composed of 14 places in 33 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-22 22:21:48] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 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-22 22:21:48] [INFO ] Deduced a trap composed of 3 places in 61 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 8048 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 7745 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 15881ms problems are : Problem set: 82 solved, 163 unsolved
Search for dead transitions found 82 dead transitions in 15884ms
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.6 ms
Discarding 54 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 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 15944 ms. Remains : 108/230 places, 165/286 transitions.
Built C files in :
/tmp/ltsmin2178192606939287870
[2024-05-22 22:22:02] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2178192606939287870
Running compilation step : cd /tmp/ltsmin2178192606939287870;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 454 ms.
Running link step : cd /tmp/ltsmin2178192606939287870;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin2178192606939287870;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10991624297741052401.hoa' '--buchi-type=spotba'
LTSmin run took 476 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-11 finished in 100381 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-22 22:22:03] [INFO ] Computed 8 invariants in 1 ms
[2024-05-22 22:22:03] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-22 22:22:03] [INFO ] Invariant cache hit.
[2024-05-22 22:22:03] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Running 279 sub problems to find dead transitions.
[2024-05-22 22:22:03] [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 8398 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-22 22:22:15] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 2 ms to minimize.
[2024-05-22 22:22:15] [INFO ] Deduced a trap composed of 62 places in 91 ms of which 2 ms to minimize.
[2024-05-22 22:22:16] [INFO ] Deduced a trap composed of 63 places in 92 ms of which 1 ms to minimize.
[2024-05-22 22:22:16] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-05-22 22:22:16] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 2 ms to minimize.
[2024-05-22 22:22:17] [INFO ] Deduced a trap composed of 66 places in 60 ms of which 1 ms to minimize.
[2024-05-22 22:22:17] [INFO ] Deduced a trap composed of 159 places in 71 ms of which 1 ms to minimize.
[2024-05-22 22:22:17] [INFO ] Deduced a trap composed of 159 places in 78 ms of which 2 ms to minimize.
[2024-05-22 22:22:18] [INFO ] Deduced a trap composed of 159 places in 77 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 17376 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 25827ms problems are : Problem set: 0 solved, 279 unsolved
Search for dead transitions found 0 dead transitions in 25830ms
Starting structural reductions in LTL mode, iteration 1 : 226/251 places, 280/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26101 ms. Remains : 226/251 places, 280/313 transitions.
Stuttering acceptance computed with spot in 270 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 50 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-12 finished in 26391 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 9 ms. Remains 230 /251 variables (removed 21) and now considering 285/313 (removed 28) transitions.
// Phase 1: matrix 285 rows 230 cols
[2024-05-22 22:22:29] [INFO ] Computed 8 invariants in 3 ms
[2024-05-22 22:22:29] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-22 22:22:29] [INFO ] Invariant cache hit.
[2024-05-22 22:22:30] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 284 sub problems to find dead transitions.
[2024-05-22 22:22:30] [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-22 22:22:32] [INFO ] Deduced a trap composed of 160 places in 97 ms of which 2 ms to minimize.
[2024-05-22 22:22:32] [INFO ] Deduced a trap composed of 162 places in 77 ms of which 3 ms to minimize.
[2024-05-22 22:22:33] [INFO ] Deduced a trap composed of 157 places in 83 ms of which 1 ms to minimize.
[2024-05-22 22:22:33] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 1 ms to minimize.
[2024-05-22 22:22:33] [INFO ] Deduced a trap composed of 56 places in 75 ms of which 1 ms to minimize.
[2024-05-22 22:22:33] [INFO ] Deduced a trap composed of 159 places in 77 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-22 22:22:35] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 1 ms to minimize.
[2024-05-22 22:22:35] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 1 ms to minimize.
[2024-05-22 22:22:35] [INFO ] Deduced a trap composed of 57 places in 50 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-22 22:22:39] [INFO ] Deduced a trap composed of 159 places in 80 ms of which 1 ms to minimize.
[2024-05-22 22:22:39] [INFO ] Deduced a trap composed of 159 places in 77 ms of which 1 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 15280 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-22 22:22:48] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-22 22:22:48] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-05-22 22:22:48] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-05-22 22:22:48] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 1 ms to minimize.
[2024-05-22 22:22:48] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 2 ms to minimize.
[2024-05-22 22:22:49] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 1 ms to minimize.
[2024-05-22 22:22:49] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 1 ms to minimize.
[2024-05-22 22:22:50] [INFO ] Deduced a trap composed of 63 places in 79 ms of which 1 ms to minimize.
[2024-05-22 22:22:50] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 2 ms to minimize.
[2024-05-22 22:22:51] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 1 ms to minimize.
[2024-05-22 22:22:51] [INFO ] Deduced a trap composed of 181 places in 83 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-22 22:22:53] [INFO ] Deduced a trap composed of 51 places in 60 ms of which 1 ms to minimize.
[2024-05-22 22:22:54] [INFO ] Deduced a trap composed of 54 places in 82 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 22516 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 37843ms problems are : Problem set: 0 solved, 284 unsolved
Search for dead transitions found 0 dead transitions in 37845ms
Starting structural reductions in LTL mode, iteration 1 : 230/251 places, 285/313 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38115 ms. Remains : 230/251 places, 285/313 transitions.
Stuttering acceptance computed with spot in 210 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 0 ms.
FORMULA FlexibleBarrier-PT-06b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-06b-LTLFireability-13 finished in 38342 ms.
All properties solved by simple procedures.
Total runtime 476834 ms.

BK_STOP 1716416588172

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r180-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 ;