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.r179-tall-171640600700044.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 greatspnxred
Input is FlexibleBarrier-PT-08b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640600700044
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.7K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 13 08:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 13 08:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 08:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 13 08:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 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 241K 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-08b-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-08b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716417193122

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-08b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 22:33:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 22:33:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 22:33:14] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2024-05-22 22:33:14] [INFO ] Transformed 920 places.
[2024-05-22 22:33:14] [INFO ] Transformed 1057 transitions.
[2024-05-22 22:33:14] [INFO ] Found NUPN structural information;
[2024-05-22 22:33:14] [INFO ] Parsed PT model containing 920 places and 1057 transitions and 2627 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-08b-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 920/920 places, 1057/1057 transitions.
Discarding 332 places :
Symmetric choice reduction at 0 with 332 rule applications. Total rules 332 place count 588 transition count 725
Iterating global reduction 0 with 332 rules applied. Total rules applied 664 place count 588 transition count 725
Discarding 146 places :
Symmetric choice reduction at 0 with 146 rule applications. Total rules 810 place count 442 transition count 579
Iterating global reduction 0 with 146 rules applied. Total rules applied 956 place count 442 transition count 579
Discarding 82 places :
Symmetric choice reduction at 0 with 82 rule applications. Total rules 1038 place count 360 transition count 497
Iterating global reduction 0 with 82 rules applied. Total rules applied 1120 place count 360 transition count 497
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 0 with 34 rules applied. Total rules applied 1154 place count 360 transition count 463
Applied a total of 1154 rules in 153 ms. Remains 360 /920 variables (removed 560) and now considering 463/1057 (removed 594) transitions.
// Phase 1: matrix 463 rows 360 cols
[2024-05-22 22:33:14] [INFO ] Computed 10 invariants in 25 ms
[2024-05-22 22:33:15] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-22 22:33:15] [INFO ] Invariant cache hit.
[2024-05-22 22:33:15] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2024-05-22 22:33:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/360 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-22 22:33:21] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 22 ms to minimize.
[2024-05-22 22:33:21] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 2 ms to minimize.
[2024-05-22 22:33:21] [INFO ] Deduced a trap composed of 86 places in 59 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (OVERLAPS) 463/823 variables, 360/373 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/823 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (OVERLAPS) 0/823 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 462 unsolved
No progress, stopping.
After SMT solving in domain Real declared 823/823 variables, and 373 constraints, problems are : Problem set: 0 solved, 462 unsolved in 29501 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/360 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (OVERLAPS) 463/823 variables, 360/373 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/823 variables, 462/835 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-22 22:33:53] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 2 ms to minimize.
[2024-05-22 22:33:53] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 3 ms to minimize.
[2024-05-22 22:33:54] [INFO ] Deduced a trap composed of 80 places in 123 ms of which 5 ms to minimize.
[2024-05-22 22:33:55] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 3 ms to minimize.
[2024-05-22 22:33:55] [INFO ] Deduced a trap composed of 80 places in 119 ms of which 2 ms to minimize.
[2024-05-22 22:33:56] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 3 ms to minimize.
[2024-05-22 22:33:57] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 2 ms to minimize.
[2024-05-22 22:33:57] [INFO ] Deduced a trap composed of 80 places in 72 ms of which 1 ms to minimize.
[2024-05-22 22:33:59] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 2 ms to minimize.
[2024-05-22 22:34:00] [INFO ] Deduced a trap composed of 263 places in 132 ms of which 2 ms to minimize.
[2024-05-22 22:34:00] [INFO ] Deduced a trap composed of 264 places in 97 ms of which 2 ms to minimize.
[2024-05-22 22:34:00] [INFO ] Deduced a trap composed of 262 places in 105 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 12/847 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-22 22:34:07] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 2 ms to minimize.
[2024-05-22 22:34:07] [INFO ] Deduced a trap composed of 74 places in 114 ms of which 3 ms to minimize.
[2024-05-22 22:34:13] [INFO ] Deduced a trap composed of 262 places in 108 ms of which 3 ms to minimize.
[2024-05-22 22:34:13] [INFO ] Deduced a trap composed of 266 places in 127 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 823/823 variables, and 851 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 19/19 constraints]
After SMT, in 59774ms problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 59793ms
Starting structural reductions in LTL mode, iteration 1 : 360/920 places, 463/1057 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60608 ms. Remains : 360/920 places, 463/1057 transitions.
Support contains 38 out of 360 places after structural reductions.
[2024-05-22 22:34:15] [INFO ] Flatten gal took : 55 ms
[2024-05-22 22:34:15] [INFO ] Flatten gal took : 24 ms
[2024-05-22 22:34:15] [INFO ] Input system was already deterministic with 463 transitions.
RANDOM walk for 40000 steps (617 resets) in 1830 ms. (21 steps per ms) remains 13/23 properties
BEST_FIRST walk for 40004 steps (78 resets) in 133 ms. (298 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40001 steps (79 resets) in 87 ms. (454 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (80 resets) in 74 ms. (533 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (66 resets) in 101 ms. (392 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (83 resets) in 85 ms. (465 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (82 resets) in 86 ms. (459 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (78 resets) in 72 ms. (548 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (79 resets) in 45 ms. (869 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (84 resets) in 94 ms. (421 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (76 resets) in 56 ms. (701 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (76 resets) in 39 ms. (1000 steps per ms) remains 10/10 properties
[2024-05-22 22:34:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 240/257 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 103/360 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 463/823 variables, 360/370 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/823 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/823 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 823/823 variables, and 370 constraints, problems are : Problem set: 0 solved, 10 unsolved in 474 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 240/257 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 22:34:17] [INFO ] Deduced a trap composed of 88 places in 87 ms of which 2 ms to minimize.
[2024-05-22 22:34:17] [INFO ] Deduced a trap composed of 95 places in 73 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 103/360 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 463/823 variables, 360/372 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/823 variables, 10/382 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 22:34:17] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/823 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/823 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 22:34:18] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 3 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/823 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/823 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/823 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 823/823 variables, and 384 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1628 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 4/4 constraints]
After SMT, in 2119ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 9 properties in 2220 ms.
Support contains 1 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 463/463 transitions.
Graph (trivial) has 332 edges and 360 vertex of which 49 / 360 are part of one of the 8 SCC in 8 ms
Free SCC test removed 41 places
Drop transitions (Empty/Sink Transition effects.) removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 319 transition count 371
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 277 transition count 371
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 85 place count 277 transition count 353
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 121 place count 259 transition count 353
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 153 place count 227 transition count 321
Iterating global reduction 2 with 32 rules applied. Total rules applied 185 place count 227 transition count 321
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 191 place count 227 transition count 315
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 197 place count 221 transition count 309
Iterating global reduction 3 with 6 rules applied. Total rules applied 203 place count 221 transition count 309
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 209 place count 221 transition count 303
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 311 place count 170 transition count 252
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 327 place count 170 transition count 236
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 338 place count 159 transition count 225
Iterating global reduction 5 with 11 rules applied. Total rules applied 349 place count 159 transition count 225
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 352 place count 159 transition count 222
Free-agglomeration rule applied 114 times.
Iterating global reduction 6 with 114 rules applied. Total rules applied 466 place count 159 transition count 108
Reduce places removed 114 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (complete) has 119 edges and 45 vertex of which 15 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 163 rules applied. Total rules applied 629 place count 15 transition count 60
Drop transitions (Empty/Sink Transition effects.) removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 7 with 42 rules applied. Total rules applied 671 place count 15 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 672 place count 14 transition count 17
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 10 edges and 13 vertex of which 4 / 13 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 8 with 2 rules applied. Total rules applied 674 place count 11 transition count 17
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 678 place count 11 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 678 place count 11 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 682 place count 9 transition count 11
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 684 place count 9 transition count 9
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 688 place count 7 transition count 7
Free-agglomeration rule applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 690 place count 7 transition count 5
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 696 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 696 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 698 place count 2 transition count 2
Applied a total of 698 rules in 104 ms. Remains 2 /360 variables (removed 358) and now considering 2/463 (removed 461) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 2/360 places, 2/463 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Computed a total of 11 stabilizing places and 11 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' '!(F((X(G(p0))&&G(p1))))'
Support contains 5 out of 360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 360/360 places, 463/463 transitions.
Graph (trivial) has 328 edges and 360 vertex of which 49 / 360 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 318 transition count 377
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 275 transition count 377
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 87 place count 275 transition count 359
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 123 place count 257 transition count 359
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 154 place count 226 transition count 328
Iterating global reduction 2 with 31 rules applied. Total rules applied 185 place count 226 transition count 328
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 190 place count 226 transition count 323
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 196 place count 220 transition count 317
Iterating global reduction 3 with 6 rules applied. Total rules applied 202 place count 220 transition count 317
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 208 place count 220 transition count 311
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 304 place count 172 transition count 263
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 306 place count 170 transition count 261
Iterating global reduction 4 with 2 rules applied. Total rules applied 308 place count 170 transition count 261
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 310 place count 170 transition count 259
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 318 place count 170 transition count 251
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 320 place count 168 transition count 249
Applied a total of 320 rules in 102 ms. Remains 168 /360 variables (removed 192) and now considering 249/463 (removed 214) transitions.
[2024-05-22 22:34:21] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
// Phase 1: matrix 234 rows 168 cols
[2024-05-22 22:34:21] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 22:34:21] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-22 22:34:21] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
[2024-05-22 22:34:21] [INFO ] Invariant cache hit.
[2024-05-22 22:34:21] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2024-05-22 22:34:21] [INFO ] Redundant transitions in 10 ms returned []
Running 125 sub problems to find dead transitions.
[2024-05-22 22:34:21] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
[2024-05-22 22:34:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 8/168 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 233/401 variables, 168/178 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 0/401 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/402 variables, and 178 constraints, problems are : Problem set: 0 solved, 125 unsolved in 3184 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 8/168 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 233/401 variables, 168/178 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 125/303 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 0/401 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/402 variables, and 303 constraints, problems are : Problem set: 0 solved, 125 unsolved in 3726 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints]
After SMT, in 6989ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 6991ms
Starting structural reductions in SI_LTL mode, iteration 1 : 168/360 places, 249/463 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7355 ms. Remains : 168/360 places, 249/463 transitions.
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-00
Stuttering criterion allowed to conclude after 702 steps with 45 reset in 21 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-00 finished in 7704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(p0)&&G((X(p1)&&(p1||G(p2)))))||G(p0))))'
Support contains 5 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 463/463 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 343 transition count 446
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 343 transition count 446
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 39 place count 343 transition count 441
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 48 place count 334 transition count 432
Iterating global reduction 1 with 9 rules applied. Total rules applied 57 place count 334 transition count 432
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 65 place count 334 transition count 424
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 333 transition count 423
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 333 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 333 transition count 422
Applied a total of 68 rules in 29 ms. Remains 333 /360 variables (removed 27) and now considering 422/463 (removed 41) transitions.
// Phase 1: matrix 422 rows 333 cols
[2024-05-22 22:34:29] [INFO ] Computed 10 invariants in 19 ms
[2024-05-22 22:34:29] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-22 22:34:29] [INFO ] Invariant cache hit.
[2024-05-22 22:34:29] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
Running 421 sub problems to find dead transitions.
[2024-05-22 22:34:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/332 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (OVERLAPS) 1/333 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 422/755 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/755 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (OVERLAPS) 0/755 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 421 unsolved
No progress, stopping.
After SMT solving in domain Real declared 755/755 variables, and 343 constraints, problems are : Problem set: 0 solved, 421 unsolved in 19251 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 333/333 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 421 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/332 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (OVERLAPS) 1/333 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 422/755 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/755 variables, 421/764 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-22 22:34:56] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 3 ms to minimize.
[2024-05-22 22:34:56] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 2 ms to minimize.
[2024-05-22 22:34:57] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 3 ms to minimize.
[2024-05-22 22:34:57] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 2 ms to minimize.
[2024-05-22 22:34:57] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
[2024-05-22 22:34:58] [INFO ] Deduced a trap composed of 78 places in 77 ms of which 2 ms to minimize.
[2024-05-22 22:34:59] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 2 ms to minimize.
[2024-05-22 22:34:59] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 2 ms to minimize.
[2024-05-22 22:35:00] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 2 ms to minimize.
[2024-05-22 22:35:01] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 2 ms to minimize.
[2024-05-22 22:35:02] [INFO ] Deduced a trap composed of 249 places in 104 ms of which 2 ms to minimize.
[2024-05-22 22:35:02] [INFO ] Deduced a trap composed of 249 places in 98 ms of which 2 ms to minimize.
[2024-05-22 22:35:02] [INFO ] Deduced a trap composed of 249 places in 104 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/755 variables, 13/777 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-22 22:35:07] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 2 ms to minimize.
[2024-05-22 22:35:12] [INFO ] Deduced a trap composed of 249 places in 102 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/755 variables, 2/779 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-22 22:35:18] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 755/755 variables, and 780 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 333/333 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 16/16 constraints]
After SMT, in 49410ms problems are : Problem set: 0 solved, 421 unsolved
Search for dead transitions found 0 dead transitions in 49416ms
Starting structural reductions in LTL mode, iteration 1 : 333/360 places, 422/463 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50036 ms. Remains : 333/360 places, 422/463 transitions.
Stuttering acceptance computed with spot in 406 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false, (AND p1 (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), false]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-01
Product exploration explored 100000 steps with 37427 reset in 274 ms.
Product exploration explored 100000 steps with 37396 reset in 239 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (OR (AND p1 p0) (AND p2 p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X p0), (X (AND p1 (NOT p2) p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (OR (AND p1 p0) (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X p0)), (X (X (AND p1 (NOT p2) p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 190 ms. Reduced automaton from 8 states, 61 edges and 3 AP (stutter sensitive) to 8 states, 61 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 386 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false, (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) (NOT p1)), false]
RANDOM walk for 40000 steps (607 resets) in 639 ms. (62 steps per ms) remains 6/15 properties
BEST_FIRST walk for 40003 steps (66 resets) in 190 ms. (209 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (66 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (78 resets) in 359 ms. (111 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (83 resets) in 223 ms. (178 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (66 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (82 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
[2024-05-22 22:35:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf2 is UNSAT
Problem apf11 is UNSAT
At refinement iteration 1 (OVERLAPS) 158/163 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 170/333 variables, 6/10 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 422/755 variables, 333/343 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/755 variables, 0/343 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/755 variables, 0/343 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 755/755 variables, and 343 constraints, problems are : Problem set: 2 solved, 4 unsolved in 334 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 333/333 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 158/163 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 170/333 variables, 6/10 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 422/755 variables, 333/343 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/755 variables, 4/347 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/755 variables, 0/347 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/755 variables, 0/347 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 755/755 variables, and 347 constraints, problems are : Problem set: 2 solved, 4 unsolved in 333 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 333/333 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 677ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 273 ms.
Support contains 5 out of 333 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 333/333 places, 422/422 transitions.
Graph (trivial) has 300 edges and 333 vertex of which 49 / 333 are part of one of the 8 SCC in 0 ms
Free SCC test removed 41 places
Drop transitions (Empty/Sink Transition effects.) removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 292 transition count 333
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 253 transition count 333
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 79 place count 253 transition count 316
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 113 place count 236 transition count 316
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 128 place count 221 transition count 301
Iterating global reduction 2 with 15 rules applied. Total rules applied 143 place count 221 transition count 301
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 245 place count 170 transition count 250
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 261 place count 170 transition count 234
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 269 place count 162 transition count 226
Iterating global reduction 3 with 8 rules applied. Total rules applied 277 place count 162 transition count 226
Free-agglomeration rule applied 113 times.
Iterating global reduction 3 with 113 rules applied. Total rules applied 390 place count 162 transition count 113
Reduce places removed 113 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 3 with 154 rules applied. Total rules applied 544 place count 49 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 545 place count 48 transition count 71
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 40 edges and 47 vertex of which 16 / 47 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 547 place count 39 transition count 71
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 563 place count 39 transition count 55
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 8 Pre rules applied. Total rules applied 563 place count 39 transition count 47
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 579 place count 31 transition count 47
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 586 place count 31 transition count 40
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 600 place count 24 transition count 33
Free-agglomeration rule applied 7 times.
Iterating global reduction 7 with 7 rules applied. Total rules applied 607 place count 24 transition count 26
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 7 with 23 rules applied. Total rules applied 630 place count 12 transition count 15
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 631 place count 12 transition count 14
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 633 place count 11 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 634 place count 11 transition count 12
Applied a total of 634 rules in 43 ms. Remains 11 /333 variables (removed 322) and now considering 12/422 (removed 410) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 11/333 places, 12/422 transitions.
RANDOM walk for 231 steps (0 resets) in 4 ms. (46 steps per ms) remains 0/2 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (OR (AND p1 p0) (AND p2 p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X p0), (X (AND p1 (NOT p2) p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (OR (AND p1 p0) (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X p0)), (X (X (AND p1 (NOT p2) p0))), (X (X p1)), (G (OR p0 (NOT p2) p1)), (G (OR p0 (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p2 p1))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (AND p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT (AND (OR p0 (NOT p2)) (OR p0 (NOT p1))))), (F (NOT (OR (NOT p0) p2 p1))), (F p2), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (AND p0 p2) (AND p0 p1))))]
Knowledge based reduction with 33 factoid took 647 ms. Reduced automaton from 8 states, 61 edges and 3 AP (stutter sensitive) to 4 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false]
Support contains 2 out of 333 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 422/422 transitions.
Applied a total of 0 rules in 6 ms. Remains 333 /333 variables (removed 0) and now considering 422/422 (removed 0) transitions.
[2024-05-22 22:35:23] [INFO ] Invariant cache hit.
[2024-05-22 22:35:23] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-22 22:35:23] [INFO ] Invariant cache hit.
[2024-05-22 22:35:23] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Running 421 sub problems to find dead transitions.
[2024-05-22 22:35:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/332 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (OVERLAPS) 1/333 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 422/755 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/755 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (OVERLAPS) 0/755 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 421 unsolved
No progress, stopping.
After SMT solving in domain Real declared 755/755 variables, and 343 constraints, problems are : Problem set: 0 solved, 421 unsolved in 18991 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 333/333 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 421 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/332 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (OVERLAPS) 1/333 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/333 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 422/755 variables, 333/343 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/755 variables, 421/764 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-22 22:35:49] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 3 ms to minimize.
[2024-05-22 22:35:49] [INFO ] Deduced a trap composed of 74 places in 107 ms of which 2 ms to minimize.
[2024-05-22 22:35:50] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 2 ms to minimize.
[2024-05-22 22:35:51] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-05-22 22:35:51] [INFO ] Deduced a trap composed of 77 places in 99 ms of which 3 ms to minimize.
[2024-05-22 22:35:51] [INFO ] Deduced a trap composed of 78 places in 73 ms of which 2 ms to minimize.
[2024-05-22 22:35:52] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 2 ms to minimize.
[2024-05-22 22:35:53] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 2 ms to minimize.
[2024-05-22 22:35:53] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 2 ms to minimize.
[2024-05-22 22:35:54] [INFO ] Deduced a trap composed of 81 places in 94 ms of which 2 ms to minimize.
[2024-05-22 22:35:55] [INFO ] Deduced a trap composed of 249 places in 101 ms of which 1 ms to minimize.
[2024-05-22 22:35:55] [INFO ] Deduced a trap composed of 249 places in 104 ms of which 3 ms to minimize.
[2024-05-22 22:35:55] [INFO ] Deduced a trap composed of 249 places in 97 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/755 variables, 13/777 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-22 22:36:00] [INFO ] Deduced a trap composed of 79 places in 102 ms of which 2 ms to minimize.
[2024-05-22 22:36:06] [INFO ] Deduced a trap composed of 249 places in 99 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/755 variables, 2/779 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-22 22:36:11] [INFO ] Deduced a trap composed of 82 places in 98 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 755/755 variables, and 780 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 333/333 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 16/16 constraints]
After SMT, in 49149ms problems are : Problem set: 0 solved, 421 unsolved
Search for dead transitions found 0 dead transitions in 49153ms
Finished structural reductions in LTL mode , in 1 iterations and 49466 ms. Remains : 333/333 places, 422/422 transitions.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 128 ms. Reduced automaton from 4 states, 17 edges and 2 AP (stutter sensitive) to 4 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false]
RANDOM walk for 40000 steps (605 resets) in 142 ms. (279 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (80 resets) in 28 ms. (1379 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (77 resets) in 28 ms. (1379 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (85 resets) in 30 ms. (1290 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (79 resets) in 27 ms. (1428 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (80 resets) in 26 ms. (1481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (83 resets) in 35 ms. (1111 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 491476 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :0 out of 6
Probabilistic random walk after 491476 steps, saw 130990 distinct states, run finished after 3005 ms. (steps per millisecond=163 ) properties seen :0
[2024-05-22 22:36:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 96/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 235/333 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 22:36:16] [INFO ] Deduced a trap composed of 83 places in 81 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 422/755 variables, 333/344 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/755 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/755 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 755/755 variables, and 344 constraints, problems are : Problem set: 0 solved, 6 unsolved in 551 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 333/333 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 96/98 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 235/333 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 22:36:17] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 422/755 variables, 333/345 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/755 variables, 6/351 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/755 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/755 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 755/755 variables, and 351 constraints, problems are : Problem set: 0 solved, 6 unsolved in 561 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 333/333 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
After SMT, in 1119ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 312 ms.
Support contains 2 out of 333 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 333/333 places, 422/422 transitions.
Graph (trivial) has 303 edges and 333 vertex of which 49 / 333 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Drop transitions (Empty/Sink Transition effects.) removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 292 transition count 333
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 1 with 39 rules applied. Total rules applied 79 place count 253 transition count 333
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 79 place count 253 transition count 316
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 113 place count 236 transition count 316
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 129 place count 220 transition count 300
Iterating global reduction 2 with 16 rules applied. Total rules applied 145 place count 220 transition count 300
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 146 place count 220 transition count 299
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 248 place count 169 transition count 248
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 264 place count 169 transition count 232
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 272 place count 161 transition count 224
Iterating global reduction 4 with 8 rules applied. Total rules applied 280 place count 161 transition count 224
Free-agglomeration rule applied 115 times.
Iterating global reduction 4 with 115 rules applied. Total rules applied 395 place count 161 transition count 109
Reduce places removed 115 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (complete) has 119 edges and 46 vertex of which 21 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 164 rules applied. Total rules applied 559 place count 21 transition count 61
Drop transitions (Empty/Sink Transition effects.) removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 5 with 35 rules applied. Total rules applied 594 place count 21 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 595 place count 20 transition count 25
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 15 edges and 19 vertex of which 6 / 19 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 6 with 2 rules applied. Total rules applied 597 place count 16 transition count 25
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 603 place count 16 transition count 19
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 603 place count 16 transition count 16
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 609 place count 13 transition count 16
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 611 place count 13 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 615 place count 11 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 617 place count 10 transition count 11
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 618 place count 10 transition count 10
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 620 place count 10 transition count 8
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 626 place count 6 transition count 6
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 627 place count 6 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 628 place count 5 transition count 5
Applied a total of 628 rules in 63 ms. Remains 5 /333 variables (removed 328) and now considering 5/422 (removed 417) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 5/333 places, 5/422 transitions.
RANDOM walk for 48 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 13 factoid took 358 ms. Reduced automaton from 4 states, 17 edges and 2 AP (stutter sensitive) to 4 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false]
Product exploration explored 100000 steps with 37477 reset in 140 ms.
Product exploration explored 100000 steps with 37604 reset in 147 ms.
Support contains 2 out of 333 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 333/333 places, 422/422 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 332 transition count 421
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 332 transition count 421
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 332 transition count 420
Applied a total of 3 rules in 7 ms. Remains 332 /333 variables (removed 1) and now considering 420/422 (removed 2) transitions.
// Phase 1: matrix 420 rows 332 cols
[2024-05-22 22:36:19] [INFO ] Computed 10 invariants in 7 ms
[2024-05-22 22:36:19] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-22 22:36:19] [INFO ] Invariant cache hit.
[2024-05-22 22:36:19] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 419 sub problems to find dead transitions.
[2024-05-22 22:36:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (OVERLAPS) 1/332 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (OVERLAPS) 420/752 variables, 332/342 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/752 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (OVERLAPS) 0/752 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 419 unsolved
No progress, stopping.
After SMT solving in domain Real declared 752/752 variables, and 342 constraints, problems are : Problem set: 0 solved, 419 unsolved in 18668 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 332/332 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 419 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (OVERLAPS) 1/332 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (OVERLAPS) 420/752 variables, 332/342 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/752 variables, 419/761 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-05-22 22:36:45] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 3 ms to minimize.
[2024-05-22 22:36:45] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 2 ms to minimize.
[2024-05-22 22:36:46] [INFO ] Deduced a trap composed of 80 places in 101 ms of which 3 ms to minimize.
[2024-05-22 22:36:46] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 2 ms to minimize.
[2024-05-22 22:36:47] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 2 ms to minimize.
[2024-05-22 22:36:50] [INFO ] Deduced a trap composed of 248 places in 98 ms of which 2 ms to minimize.
[2024-05-22 22:36:50] [INFO ] Deduced a trap composed of 248 places in 98 ms of which 2 ms to minimize.
[2024-05-22 22:36:50] [INFO ] Deduced a trap composed of 248 places in 98 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/752 variables, 8/769 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-05-22 22:36:57] [INFO ] Deduced a trap composed of 79 places in 104 ms of which 3 ms to minimize.
[2024-05-22 22:36:58] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 2 ms to minimize.
[2024-05-22 22:36:59] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 3 ms to minimize.
[2024-05-22 22:36:59] [INFO ] Deduced a trap composed of 81 places in 80 ms of which 2 ms to minimize.
[2024-05-22 22:37:00] [INFO ] Deduced a trap composed of 248 places in 86 ms of which 2 ms to minimize.
[2024-05-22 22:37:01] [INFO ] Deduced a trap composed of 248 places in 103 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/752 variables, 6/775 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 752/752 variables, and 775 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 332/332 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 14/14 constraints]
After SMT, in 48815ms problems are : Problem set: 0 solved, 419 unsolved
Search for dead transitions found 0 dead transitions in 48819ms
Starting structural reductions in LTL mode, iteration 1 : 332/333 places, 420/422 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49161 ms. Remains : 332/333 places, 420/422 transitions.
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-01 finished in 159288 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((!p0||X(!p0)) U G(p0))||X(p1)))'
Support contains 2 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 463/463 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 341 transition count 444
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 341 transition count 444
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 341 transition count 438
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 53 place count 332 transition count 429
Iterating global reduction 1 with 9 rules applied. Total rules applied 62 place count 332 transition count 429
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 69 place count 332 transition count 422
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 331 transition count 421
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 331 transition count 421
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 331 transition count 420
Applied a total of 72 rules in 20 ms. Remains 331 /360 variables (removed 29) and now considering 420/463 (removed 43) transitions.
// Phase 1: matrix 420 rows 331 cols
[2024-05-22 22:37:08] [INFO ] Computed 10 invariants in 3 ms
[2024-05-22 22:37:08] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-22 22:37:08] [INFO ] Invariant cache hit.
[2024-05-22 22:37:08] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Running 419 sub problems to find dead transitions.
[2024-05-22 22:37:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (OVERLAPS) 1/331 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (OVERLAPS) 420/751 variables, 331/341 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/751 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (OVERLAPS) 0/751 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 419 unsolved
No progress, stopping.
After SMT solving in domain Real declared 751/751 variables, and 341 constraints, problems are : Problem set: 0 solved, 419 unsolved in 18454 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 331/331 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 419 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (OVERLAPS) 1/331 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (OVERLAPS) 420/751 variables, 331/341 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/751 variables, 419/760 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-05-22 22:37:34] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 3 ms to minimize.
[2024-05-22 22:37:34] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
[2024-05-22 22:37:34] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 2 ms to minimize.
[2024-05-22 22:37:35] [INFO ] Deduced a trap composed of 76 places in 125 ms of which 2 ms to minimize.
[2024-05-22 22:37:35] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 2 ms to minimize.
[2024-05-22 22:37:36] [INFO ] Deduced a trap composed of 81 places in 83 ms of which 1 ms to minimize.
[2024-05-22 22:37:36] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 2 ms to minimize.
[2024-05-22 22:37:37] [INFO ] Deduced a trap composed of 80 places in 82 ms of which 1 ms to minimize.
[2024-05-22 22:37:37] [INFO ] Deduced a trap composed of 82 places in 69 ms of which 1 ms to minimize.
[2024-05-22 22:37:38] [INFO ] Deduced a trap composed of 81 places in 59 ms of which 1 ms to minimize.
[2024-05-22 22:37:39] [INFO ] Deduced a trap composed of 249 places in 88 ms of which 2 ms to minimize.
[2024-05-22 22:37:39] [INFO ] Deduced a trap composed of 252 places in 95 ms of which 2 ms to minimize.
[2024-05-22 22:37:39] [INFO ] Deduced a trap composed of 249 places in 95 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/751 variables, 13/773 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-05-22 22:37:46] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/751 variables, 1/774 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 751/751 variables, and 774 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 331/331 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 14/14 constraints]
After SMT, in 48583ms problems are : Problem set: 0 solved, 419 unsolved
Search for dead transitions found 0 dead transitions in 48587ms
Starting structural reductions in LTL mode, iteration 1 : 331/360 places, 420/463 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48944 ms. Remains : 331/360 places, 420/463 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 120 ms.
Product exploration explored 100000 steps with 50000 reset in 119 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 27 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-08b-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-02 finished in 49502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 360/360 places, 463/463 transitions.
Graph (trivial) has 284 edges and 360 vertex of which 49 / 360 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 318 transition count 377
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 275 transition count 377
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 87 place count 275 transition count 360
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 121 place count 258 transition count 360
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 154 place count 225 transition count 327
Iterating global reduction 2 with 33 rules applied. Total rules applied 187 place count 225 transition count 327
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 193 place count 225 transition count 321
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 199 place count 219 transition count 315
Iterating global reduction 3 with 6 rules applied. Total rules applied 205 place count 219 transition count 315
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 211 place count 219 transition count 309
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 309 place count 170 transition count 260
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 312 place count 167 transition count 257
Iterating global reduction 4 with 3 rules applied. Total rules applied 315 place count 167 transition count 257
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 318 place count 167 transition count 254
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 320 place count 165 transition count 252
Applied a total of 320 rules in 81 ms. Remains 165 /360 variables (removed 195) and now considering 252/463 (removed 211) transitions.
[2024-05-22 22:37:58] [INFO ] Flow matrix only has 230 transitions (discarded 22 similar events)
// Phase 1: matrix 230 rows 165 cols
[2024-05-22 22:37:58] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 22:37:58] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-22 22:37:58] [INFO ] Flow matrix only has 230 transitions (discarded 22 similar events)
[2024-05-22 22:37:58] [INFO ] Invariant cache hit.
[2024-05-22 22:37:58] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-05-22 22:37:58] [INFO ] Redundant transitions in 2 ms returned []
Running 178 sub problems to find dead transitions.
[2024-05-22 22:37:58] [INFO ] Flow matrix only has 230 transitions (discarded 22 similar events)
[2024-05-22 22:37:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/165 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 229/394 variables, 165/175 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (OVERLAPS) 0/394 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/395 variables, and 175 constraints, problems are : Problem set: 0 solved, 178 unsolved in 4588 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/165 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 229/394 variables, 165/175 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 178/353 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/394 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/395 variables, and 353 constraints, problems are : Problem set: 0 solved, 178 unsolved in 6128 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 0/0 constraints]
After SMT, in 10854ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 10865ms
Starting structural reductions in SI_LTL mode, iteration 1 : 165/360 places, 252/463 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11275 ms. Remains : 165/360 places, 252/463 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-04 finished in 11328 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0 U X((p1 U (p2||G(p1)))))))))'
Support contains 7 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 463/463 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 343 transition count 446
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 343 transition count 446
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 39 place count 343 transition count 441
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 47 place count 335 transition count 433
Iterating global reduction 1 with 8 rules applied. Total rules applied 55 place count 335 transition count 433
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 62 place count 335 transition count 426
Applied a total of 62 rules in 16 ms. Remains 335 /360 variables (removed 25) and now considering 426/463 (removed 37) transitions.
// Phase 1: matrix 426 rows 335 cols
[2024-05-22 22:38:09] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 22:38:09] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-22 22:38:09] [INFO ] Invariant cache hit.
[2024-05-22 22:38:09] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2024-05-22 22:38:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (OVERLAPS) 426/761 variables, 335/345 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/761 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (OVERLAPS) 0/761 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 425 unsolved
No progress, stopping.
After SMT solving in domain Real declared 761/761 variables, and 345 constraints, problems are : Problem set: 0 solved, 425 unsolved in 19525 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (OVERLAPS) 426/761 variables, 335/345 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/761 variables, 425/770 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-22 22:38:36] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 3 ms to minimize.
[2024-05-22 22:38:37] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 3 ms to minimize.
[2024-05-22 22:38:37] [INFO ] Deduced a trap composed of 77 places in 87 ms of which 2 ms to minimize.
[2024-05-22 22:38:38] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 2 ms to minimize.
[2024-05-22 22:38:39] [INFO ] Deduced a trap composed of 80 places in 88 ms of which 2 ms to minimize.
[2024-05-22 22:38:40] [INFO ] Deduced a trap composed of 104 places in 86 ms of which 2 ms to minimize.
[2024-05-22 22:38:40] [INFO ] Deduced a trap composed of 81 places in 59 ms of which 1 ms to minimize.
[2024-05-22 22:38:41] [INFO ] Deduced a trap composed of 252 places in 104 ms of which 2 ms to minimize.
[2024-05-22 22:38:41] [INFO ] Deduced a trap composed of 249 places in 102 ms of which 2 ms to minimize.
[2024-05-22 22:38:42] [INFO ] Deduced a trap composed of 251 places in 98 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/761 variables, 10/780 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-22 22:38:49] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 2 ms to minimize.
[2024-05-22 22:38:52] [INFO ] Deduced a trap composed of 251 places in 101 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/761 variables, 2/782 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 761/761 variables, and 782 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 12/12 constraints]
After SMT, in 49674ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 49678ms
Starting structural reductions in LTL mode, iteration 1 : 335/360 places, 426/463 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50097 ms. Remains : 335/360 places, 426/463 transitions.
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-06
Product exploration explored 100000 steps with 1524 reset in 197 ms.
Product exploration explored 100000 steps with 1542 reset in 213 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 376 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (607 resets) in 159 ms. (250 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40003 steps (83 resets) in 270 ms. (147 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (76 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
[2024-05-22 22:39:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 1 (OVERLAPS) 126/131 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 204/335 variables, 7/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 426/761 variables, 335/345 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/761 variables, 0/345 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/761 variables, 0/345 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 761/761 variables, and 345 constraints, problems are : Problem set: 1 solved, 1 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/44 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 291/335 variables, 9/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-22 22:39:01] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 426/761 variables, 335/346 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/761 variables, 1/347 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/761 variables, 0/347 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/761 variables, 0/347 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 761/761 variables, and 347 constraints, problems are : Problem set: 1 solved, 1 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 559ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 50 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=50 )
Parikh walk visited 1 properties in 5 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (X (NOT p0))), (G (OR p1 (NOT p0) p2))]
False Knowledge obtained : [(F (NOT (OR (NOT p1) (NOT p0) p2))), (F p0), (F (NOT (OR p1 p2))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F (NOT (AND p1 (NOT p2)))), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 268 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 190 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 7 out of 335 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 335/335 places, 426/426 transitions.
Applied a total of 0 rules in 6 ms. Remains 335 /335 variables (removed 0) and now considering 426/426 (removed 0) transitions.
[2024-05-22 22:39:01] [INFO ] Invariant cache hit.
[2024-05-22 22:39:01] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-22 22:39:01] [INFO ] Invariant cache hit.
[2024-05-22 22:39:02] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2024-05-22 22:39:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (OVERLAPS) 426/761 variables, 335/345 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/761 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (OVERLAPS) 0/761 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 425 unsolved
No progress, stopping.
After SMT solving in domain Real declared 761/761 variables, and 345 constraints, problems are : Problem set: 0 solved, 425 unsolved in 19446 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/334 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/335 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/335 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (OVERLAPS) 426/761 variables, 335/345 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/761 variables, 425/770 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-22 22:39:28] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 3 ms to minimize.
[2024-05-22 22:39:29] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 2 ms to minimize.
[2024-05-22 22:39:30] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 2 ms to minimize.
[2024-05-22 22:39:30] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 2 ms to minimize.
[2024-05-22 22:39:32] [INFO ] Deduced a trap composed of 80 places in 92 ms of which 2 ms to minimize.
[2024-05-22 22:39:32] [INFO ] Deduced a trap composed of 104 places in 87 ms of which 2 ms to minimize.
[2024-05-22 22:39:33] [INFO ] Deduced a trap composed of 81 places in 63 ms of which 1 ms to minimize.
[2024-05-22 22:39:34] [INFO ] Deduced a trap composed of 252 places in 105 ms of which 2 ms to minimize.
[2024-05-22 22:39:34] [INFO ] Deduced a trap composed of 249 places in 96 ms of which 2 ms to minimize.
[2024-05-22 22:39:34] [INFO ] Deduced a trap composed of 251 places in 94 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/761 variables, 10/780 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-22 22:39:42] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-05-22 22:39:45] [INFO ] Deduced a trap composed of 251 places in 100 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/761 variables, 2/782 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 761/761 variables, and 782 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 12/12 constraints]
After SMT, in 49594ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 49598ms
Finished structural reductions in LTL mode , in 1 iterations and 49932 ms. Remains : 335/335 places, 426/426 transitions.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (613 resets) in 166 ms. (239 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (82 resets) in 34 ms. (1142 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (75 resets) in 29 ms. (1333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (80 resets) in 22 ms. (1739 steps per ms) remains 3/3 properties
[2024-05-22 22:39:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf2 is UNSAT
At refinement iteration 1 (OVERLAPS) 129/136 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 199/335 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 426/761 variables, 335/345 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/761 variables, 0/345 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/761 variables, 0/345 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 761/761 variables, and 345 constraints, problems are : Problem set: 1 solved, 2 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 129/136 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 199/335 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/335 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 426/761 variables, 335/345 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/761 variables, 2/347 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/761 variables, 0/347 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/761 variables, 0/347 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 761/761 variables, and 347 constraints, problems are : Problem set: 1 solved, 2 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 335/335 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 471ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 233 steps, including 3 resets, run visited all 2 properties in 4 ms. (steps per millisecond=58 )
Parikh walk visited 2 properties in 3 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) (NOT p0)), (X (X (NOT p0))), (G (OR (NOT p0) (NOT p2)))]
False Knowledge obtained : [(F p0), (F (NOT (OR p1 p2))), (F (NOT p1)), (F p2), (F (NOT (OR (AND p1 (NOT p2)) (AND (NOT p0) p2))))]
Knowledge based reduction with 3 factoid took 254 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 199 ms :[true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 165 ms :[true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 1533 reset in 165 ms.
Entered a terminal (fully accepting) state of product in 95765 steps with 1466 reset in 165 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-06 finished in 104593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 463/463 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 341 transition count 444
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 341 transition count 444
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 341 transition count 438
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 53 place count 332 transition count 429
Iterating global reduction 1 with 9 rules applied. Total rules applied 62 place count 332 transition count 429
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 69 place count 332 transition count 422
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 331 transition count 421
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 331 transition count 421
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 331 transition count 420
Applied a total of 72 rules in 22 ms. Remains 331 /360 variables (removed 29) and now considering 420/463 (removed 43) transitions.
// Phase 1: matrix 420 rows 331 cols
[2024-05-22 22:39:53] [INFO ] Computed 10 invariants in 3 ms
[2024-05-22 22:39:53] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-22 22:39:53] [INFO ] Invariant cache hit.
[2024-05-22 22:39:54] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 419 sub problems to find dead transitions.
[2024-05-22 22:39:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (OVERLAPS) 1/331 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (OVERLAPS) 420/751 variables, 331/341 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/751 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (OVERLAPS) 0/751 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 419 unsolved
No progress, stopping.
After SMT solving in domain Real declared 751/751 variables, and 341 constraints, problems are : Problem set: 0 solved, 419 unsolved in 18844 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 331/331 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 419 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (OVERLAPS) 1/331 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/331 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (OVERLAPS) 420/751 variables, 331/341 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/751 variables, 419/760 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-05-22 22:40:20] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 2 ms to minimize.
[2024-05-22 22:40:20] [INFO ] Deduced a trap composed of 73 places in 111 ms of which 2 ms to minimize.
[2024-05-22 22:40:20] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 1 ms to minimize.
[2024-05-22 22:40:21] [INFO ] Deduced a trap composed of 77 places in 94 ms of which 2 ms to minimize.
[2024-05-22 22:40:22] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 2 ms to minimize.
[2024-05-22 22:40:22] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 2 ms to minimize.
[2024-05-22 22:40:24] [INFO ] Deduced a trap composed of 81 places in 67 ms of which 2 ms to minimize.
[2024-05-22 22:40:24] [INFO ] Deduced a trap composed of 81 places in 69 ms of which 1 ms to minimize.
[2024-05-22 22:40:25] [INFO ] Deduced a trap composed of 249 places in 104 ms of which 1 ms to minimize.
[2024-05-22 22:40:25] [INFO ] Deduced a trap composed of 252 places in 101 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/751 variables, 10/770 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-05-22 22:40:31] [INFO ] Deduced a trap composed of 80 places in 111 ms of which 3 ms to minimize.
[2024-05-22 22:40:34] [INFO ] Deduced a trap composed of 80 places in 98 ms of which 3 ms to minimize.
[2024-05-22 22:40:36] [INFO ] Deduced a trap composed of 249 places in 101 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/751 variables, 3/773 constraints. Problems are: Problem set: 0 solved, 419 unsolved
[2024-05-22 22:40:42] [INFO ] Deduced a trap composed of 126 places in 95 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 751/751 variables, and 774 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 331/331 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 14/14 constraints]
After SMT, in 48975ms problems are : Problem set: 0 solved, 419 unsolved
Search for dead transitions found 0 dead transitions in 48979ms
Starting structural reductions in LTL mode, iteration 1 : 331/360 places, 420/463 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49345 ms. Remains : 331/360 places, 420/463 transitions.
Stuttering acceptance computed with spot in 188 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-07
Entered a terminal (fully accepting) state of product in 18248 steps with 278 reset in 41 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-07 finished in 49597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 463/463 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 340 transition count 443
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 340 transition count 443
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 46 place count 340 transition count 437
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 56 place count 330 transition count 427
Iterating global reduction 1 with 10 rules applied. Total rules applied 66 place count 330 transition count 427
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 74 place count 330 transition count 419
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 329 transition count 418
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 329 transition count 418
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 329 transition count 417
Applied a total of 77 rules in 18 ms. Remains 329 /360 variables (removed 31) and now considering 417/463 (removed 46) transitions.
// Phase 1: matrix 417 rows 329 cols
[2024-05-22 22:40:43] [INFO ] Computed 10 invariants in 5 ms
[2024-05-22 22:40:43] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-22 22:40:43] [INFO ] Invariant cache hit.
[2024-05-22 22:40:43] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Running 416 sub problems to find dead transitions.
[2024-05-22 22:40:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/328 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (OVERLAPS) 1/329 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (OVERLAPS) 417/746 variables, 329/339 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/746 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 5 (OVERLAPS) 0/746 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 416 unsolved
No progress, stopping.
After SMT solving in domain Real declared 746/746 variables, and 339 constraints, problems are : Problem set: 0 solved, 416 unsolved in 18820 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 329/329 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/328 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 1 (OVERLAPS) 1/329 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 3 (OVERLAPS) 417/746 variables, 329/339 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/746 variables, 416/755 constraints. Problems are: Problem set: 0 solved, 416 unsolved
[2024-05-22 22:41:09] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 2 ms to minimize.
[2024-05-22 22:41:10] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 2 ms to minimize.
[2024-05-22 22:41:10] [INFO ] Deduced a trap composed of 77 places in 99 ms of which 3 ms to minimize.
[2024-05-22 22:41:11] [INFO ] Deduced a trap composed of 78 places in 85 ms of which 2 ms to minimize.
[2024-05-22 22:41:12] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 2 ms to minimize.
[2024-05-22 22:41:12] [INFO ] Deduced a trap composed of 80 places in 65 ms of which 1 ms to minimize.
[2024-05-22 22:41:13] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 2 ms to minimize.
[2024-05-22 22:41:13] [INFO ] Deduced a trap composed of 81 places in 68 ms of which 1 ms to minimize.
[2024-05-22 22:41:14] [INFO ] Deduced a trap composed of 248 places in 99 ms of which 2 ms to minimize.
[2024-05-22 22:41:14] [INFO ] Deduced a trap composed of 248 places in 97 ms of which 3 ms to minimize.
[2024-05-22 22:41:15] [INFO ] Deduced a trap composed of 248 places in 103 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/746 variables, 11/766 constraints. Problems are: Problem set: 0 solved, 416 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/746 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 416 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 746/746 variables, and 766 constraints, problems are : Problem set: 0 solved, 416 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 329/329 constraints, PredecessorRefiner: 416/416 constraints, Known Traps: 11/11 constraints]
After SMT, in 48964ms problems are : Problem set: 0 solved, 416 unsolved
Search for dead transitions found 0 dead transitions in 48967ms
Starting structural reductions in LTL mode, iteration 1 : 329/360 places, 417/463 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49304 ms. Remains : 329/360 places, 417/463 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-08
Stuttering criterion allowed to conclude after 63 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-08 finished in 49404 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&&X(p1)))))'
Support contains 4 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 463/463 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 342 transition count 445
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 342 transition count 445
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 41 place count 342 transition count 440
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 50 place count 333 transition count 431
Iterating global reduction 1 with 9 rules applied. Total rules applied 59 place count 333 transition count 431
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 66 place count 333 transition count 424
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 332 transition count 423
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 332 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 332 transition count 422
Applied a total of 69 rules in 18 ms. Remains 332 /360 variables (removed 28) and now considering 422/463 (removed 41) transitions.
// Phase 1: matrix 422 rows 332 cols
[2024-05-22 22:41:32] [INFO ] Computed 10 invariants in 3 ms
[2024-05-22 22:41:32] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-22 22:41:32] [INFO ] Invariant cache hit.
[2024-05-22 22:41:33] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 421 sub problems to find dead transitions.
[2024-05-22 22:41:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (OVERLAPS) 1/332 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 422/754 variables, 332/342 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/754 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (OVERLAPS) 0/754 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 421 unsolved
No progress, stopping.
After SMT solving in domain Real declared 754/754 variables, and 342 constraints, problems are : Problem set: 0 solved, 421 unsolved in 18989 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 332/332 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 421 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/331 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (OVERLAPS) 1/332 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/332 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (OVERLAPS) 422/754 variables, 332/342 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/754 variables, 421/763 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-22 22:41:59] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 2 ms to minimize.
[2024-05-22 22:41:59] [INFO ] Deduced a trap composed of 78 places in 103 ms of which 2 ms to minimize.
[2024-05-22 22:42:00] [INFO ] Deduced a trap composed of 77 places in 93 ms of which 2 ms to minimize.
[2024-05-22 22:42:00] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 2 ms to minimize.
[2024-05-22 22:42:01] [INFO ] Deduced a trap composed of 79 places in 82 ms of which 2 ms to minimize.
[2024-05-22 22:42:02] [INFO ] Deduced a trap composed of 80 places in 84 ms of which 2 ms to minimize.
[2024-05-22 22:42:02] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 2 ms to minimize.
[2024-05-22 22:42:03] [INFO ] Deduced a trap composed of 81 places in 68 ms of which 3 ms to minimize.
[2024-05-22 22:42:04] [INFO ] Deduced a trap composed of 248 places in 98 ms of which 2 ms to minimize.
[2024-05-22 22:42:04] [INFO ] Deduced a trap composed of 250 places in 103 ms of which 2 ms to minimize.
[2024-05-22 22:42:04] [INFO ] Deduced a trap composed of 250 places in 97 ms of which 2 ms to minimize.
[2024-05-22 22:42:04] [INFO ] Deduced a trap composed of 250 places in 98 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/754 variables, 12/775 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-22 22:42:09] [INFO ] Deduced a trap composed of 79 places in 129 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/754 variables, 1/776 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-22 22:42:19] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 754/754 variables, and 777 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 332/332 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 14/14 constraints]
After SMT, in 49124ms problems are : Problem set: 0 solved, 421 unsolved
Search for dead transitions found 0 dead transitions in 49127ms
Starting structural reductions in LTL mode, iteration 1 : 332/360 places, 422/463 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49480 ms. Remains : 332/360 places, 422/463 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-10
Stuttering criterion allowed to conclude after 68 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-10 finished in 49621 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((G(p0)||(!p1 U (G(!p1)||(!p1&&G(p2))))))))'
Support contains 4 out of 360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 360/360 places, 463/463 transitions.
Graph (trivial) has 329 edges and 360 vertex of which 49 / 360 are part of one of the 8 SCC in 4 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 318 transition count 378
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 276 transition count 378
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 85 place count 276 transition count 362
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 117 place count 260 transition count 362
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 148 place count 229 transition count 331
Iterating global reduction 2 with 31 rules applied. Total rules applied 179 place count 229 transition count 331
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 185 place count 229 transition count 325
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 192 place count 222 transition count 318
Iterating global reduction 3 with 7 rules applied. Total rules applied 199 place count 222 transition count 318
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 205 place count 222 transition count 312
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 303 place count 173 transition count 263
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 305 place count 171 transition count 261
Iterating global reduction 4 with 2 rules applied. Total rules applied 307 place count 171 transition count 261
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 309 place count 171 transition count 259
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 317 place count 171 transition count 251
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 319 place count 169 transition count 249
Applied a total of 319 rules in 44 ms. Remains 169 /360 variables (removed 191) and now considering 249/463 (removed 214) transitions.
[2024-05-22 22:42:22] [INFO ] Flow matrix only has 235 transitions (discarded 14 similar events)
// Phase 1: matrix 235 rows 169 cols
[2024-05-22 22:42:22] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 22:42:22] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-22 22:42:22] [INFO ] Flow matrix only has 235 transitions (discarded 14 similar events)
[2024-05-22 22:42:22] [INFO ] Invariant cache hit.
[2024-05-22 22:42:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 22:42:22] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
[2024-05-22 22:42:22] [INFO ] Redundant transitions in 2 ms returned []
Running 126 sub problems to find dead transitions.
[2024-05-22 22:42:22] [INFO ] Flow matrix only has 235 transitions (discarded 14 similar events)
[2024-05-22 22:42:22] [INFO ] Invariant cache hit.
[2024-05-22 22:42:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 9/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 234/403 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 0/403 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/404 variables, and 180 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3735 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 9/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 234/403 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 126/306 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 0/403 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/404 variables, and 306 constraints, problems are : Problem set: 0 solved, 126 unsolved in 4243 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints]
After SMT, in 8046ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 8048ms
Starting structural reductions in SI_LTL mode, iteration 1 : 169/360 places, 249/463 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8458 ms. Remains : 169/360 places, 249/463 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-11
Product exploration explored 100000 steps with 5660 reset in 413 ms.
Product exploration explored 100000 steps with 5650 reset in 424 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND p0 p1))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 116 ms. Reduced automaton from 3 states, 16 edges and 3 AP (stutter insensitive) to 3 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p2) p1 (NOT p0))]
RANDOM walk for 40000 steps (2295 resets) in 864 ms. (46 steps per ms) remains 8/14 properties
BEST_FIRST walk for 40004 steps (64 resets) in 46 ms. (851 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (64 resets) in 33 ms. (1176 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (64 resets) in 47 ms. (833 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (64 resets) in 25 ms. (1538 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (78 resets) in 52 ms. (754 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (64 resets) in 29 ms. (1333 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (65 resets) in 38 ms. (1025 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (62 resets) in 34 ms. (1142 steps per ms) remains 8/8 properties
[2024-05-22 22:42:32] [INFO ] Flow matrix only has 235 transitions (discarded 14 similar events)
[2024-05-22 22:42:32] [INFO ] Invariant cache hit.
[2024-05-22 22:42:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem apf8 is UNSAT
Problem apf10 is UNSAT
At refinement iteration 1 (OVERLAPS) 31/35 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 100/135 variables, 35/38 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 1/39 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/39 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 218/353 variables, 84/123 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/123 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 50/403 variables, 7/130 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 50/180 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 0/180 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/403 variables, 0/180 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/404 variables, and 180 constraints, problems are : Problem set: 2 solved, 6 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 31/35 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 100/135 variables, 35/38 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 1/39 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/39 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 218/353 variables, 84/123 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 6/129 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/129 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 50/403 variables, 7/136 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 50/186 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/403 variables, 0/186 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/403 variables, 0/186 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/404 variables, and 186 constraints, problems are : Problem set: 2 solved, 6 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 637ms problems are : Problem set: 2 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 3 properties in 213 ms.
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 249/249 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 169 transition count 241
Free-agglomeration rule applied 114 times.
Iterating global reduction 1 with 114 rules applied. Total rules applied 122 place count 169 transition count 127
Reduce places removed 115 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 1 with 164 rules applied. Total rules applied 286 place count 54 transition count 78
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 302 place count 46 transition count 70
Applied a total of 302 rules in 20 ms. Remains 46 /169 variables (removed 123) and now considering 70/249 (removed 179) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 46/169 places, 70/249 transitions.
RANDOM walk for 33901 steps (9 resets) in 290 ms. (116 steps per ms) remains 0/3 properties
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND p0 p1))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 p2 (NOT p1))), (G (OR (NOT p0) p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) p2 p1))), (F p1), (F (NOT p0)), (F (NOT (AND p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p2 (NOT p1)))), (F (NOT (OR p0 (NOT p2) (NOT p1))))]
Knowledge based reduction with 25 factoid took 579 ms. Reduced automaton from 3 states, 16 edges and 3 AP (stutter insensitive) to 3 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p2) p1 (NOT p0))]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p2) p1 (NOT p0))]
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 249/249 transitions.
Applied a total of 0 rules in 10 ms. Remains 169 /169 variables (removed 0) and now considering 249/249 (removed 0) transitions.
[2024-05-22 22:42:34] [INFO ] Flow matrix only has 235 transitions (discarded 14 similar events)
[2024-05-22 22:42:34] [INFO ] Invariant cache hit.
[2024-05-22 22:42:34] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-22 22:42:34] [INFO ] Flow matrix only has 235 transitions (discarded 14 similar events)
[2024-05-22 22:42:34] [INFO ] Invariant cache hit.
[2024-05-22 22:42:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 22:42:34] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2024-05-22 22:42:34] [INFO ] Redundant transitions in 1 ms returned []
Running 126 sub problems to find dead transitions.
[2024-05-22 22:42:34] [INFO ] Flow matrix only has 235 transitions (discarded 14 similar events)
[2024-05-22 22:42:34] [INFO ] Invariant cache hit.
[2024-05-22 22:42:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 9/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 234/403 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 0/403 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/404 variables, and 180 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3767 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 9/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 234/403 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 126/306 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 0/403 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/404 variables, and 306 constraints, problems are : Problem set: 0 solved, 126 unsolved in 4368 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints]
After SMT, in 8204ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 8207ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8449 ms. Remains : 169/169 places, 249/249 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND p0 p1))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 126 ms. Reduced automaton from 3 states, 16 edges and 3 AP (stutter insensitive) to 3 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p2) p1 (NOT p0))]
RANDOM walk for 40000 steps (2334 resets) in 564 ms. (70 steps per ms) remains 10/14 properties
BEST_FIRST walk for 40004 steps (66 resets) in 22 ms. (1739 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (76 resets) in 48 ms. (816 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (62 resets) in 34 ms. (1142 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (64 resets) in 24 ms. (1600 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (64 resets) in 24 ms. (1600 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (78 resets) in 25 ms. (1538 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (63 resets) in 33 ms. (1176 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (64 resets) in 38 ms. (1025 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (79 resets) in 35 ms. (1111 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (64 resets) in 20 ms. (1904 steps per ms) remains 10/10 properties
[2024-05-22 22:42:43] [INFO ] Flow matrix only has 235 transitions (discarded 14 similar events)
[2024-05-22 22:42:43] [INFO ] Invariant cache hit.
[2024-05-22 22:42:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem apf8 is UNSAT
Problem apf10 is UNSAT
At refinement iteration 1 (OVERLAPS) 31/35 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 100/135 variables, 35/38 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 1/39 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/39 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 218/353 variables, 84/123 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 0/123 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 50/403 variables, 7/130 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 50/180 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 0/180 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/403 variables, 0/180 constraints. Problems are: Problem set: 2 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/404 variables, and 180 constraints, problems are : Problem set: 2 solved, 8 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 31/35 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 100/135 variables, 35/38 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 1/39 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/39 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 218/353 variables, 84/123 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/353 variables, 8/131 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/131 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 50/403 variables, 7/138 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 50/188 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/403 variables, 0/188 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/403 variables, 0/188 constraints. Problems are: Problem set: 2 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/404 variables, and 188 constraints, problems are : Problem set: 2 solved, 8 unsolved in 411 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 731ms problems are : Problem set: 2 solved, 8 unsolved
Fused 8 Parikh solutions to 6 different solutions.
Finished Parikh walk after 4373 steps, including 72 resets, run visited all 2 properties in 42 ms. (steps per millisecond=104 )
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 8 properties in 545 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND p0 p1))), (X (AND p0 p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 p2 (NOT p1))), (G (OR (NOT p0) p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) p2 p1))), (F p1), (F (NOT (AND p2 (NOT p1)))), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p2 (NOT p1)))), (F (NOT (OR p0 (NOT p2) (NOT p1))))]
Knowledge based reduction with 25 factoid took 536 ms. Reduced automaton from 3 states, 16 edges and 3 AP (stutter insensitive) to 3 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p2) p1 (NOT p0))]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p2) p1 (NOT p0))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p2) p1 (NOT p0))]
Product exploration explored 100000 steps with 5660 reset in 263 ms.
Product exploration explored 100000 steps with 5654 reset in 268 ms.
Support contains 4 out of 169 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 169/169 places, 249/249 transitions.
Applied a total of 0 rules in 6 ms. Remains 169 /169 variables (removed 0) and now considering 249/249 (removed 0) transitions.
[2024-05-22 22:42:46] [INFO ] Flow matrix only has 235 transitions (discarded 14 similar events)
[2024-05-22 22:42:46] [INFO ] Invariant cache hit.
[2024-05-22 22:42:46] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-22 22:42:46] [INFO ] Flow matrix only has 235 transitions (discarded 14 similar events)
[2024-05-22 22:42:46] [INFO ] Invariant cache hit.
[2024-05-22 22:42:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 22:42:46] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2024-05-22 22:42:46] [INFO ] Redundant transitions in 1 ms returned []
Running 126 sub problems to find dead transitions.
[2024-05-22 22:42:46] [INFO ] Flow matrix only has 235 transitions (discarded 14 similar events)
[2024-05-22 22:42:46] [INFO ] Invariant cache hit.
[2024-05-22 22:42:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 9/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 234/403 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 0/403 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/404 variables, and 180 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3551 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 9/169 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 234/403 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 126/306 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (OVERLAPS) 0/403 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/404 variables, and 306 constraints, problems are : Problem set: 0 solved, 126 unsolved in 4077 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints]
After SMT, in 7702ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 7703ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7951 ms. Remains : 169/169 places, 249/249 transitions.
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-11 finished in 31887 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 p1))&&(G(p1)||G(p2))) U X(p3)))'
Support contains 5 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 463/463 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 344 transition count 447
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 344 transition count 447
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 38 place count 344 transition count 441
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 45 place count 337 transition count 434
Iterating global reduction 1 with 7 rules applied. Total rules applied 52 place count 337 transition count 434
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 57 place count 337 transition count 429
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 336 transition count 428
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 336 transition count 428
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 336 transition count 427
Applied a total of 60 rules in 19 ms. Remains 336 /360 variables (removed 24) and now considering 427/463 (removed 36) transitions.
// Phase 1: matrix 427 rows 336 cols
[2024-05-22 22:42:54] [INFO ] Computed 10 invariants in 3 ms
[2024-05-22 22:42:54] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-22 22:42:54] [INFO ] Invariant cache hit.
[2024-05-22 22:42:54] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2024-05-22 22:42:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (OVERLAPS) 427/763 variables, 336/346 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (OVERLAPS) 0/763 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 426 unsolved
No progress, stopping.
After SMT solving in domain Real declared 763/763 variables, and 346 constraints, problems are : Problem set: 0 solved, 426 unsolved in 18959 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (OVERLAPS) 427/763 variables, 336/346 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 426/772 constraints. Problems are: Problem set: 0 solved, 426 unsolved
[2024-05-22 22:43:20] [INFO ] Deduced a trap composed of 29 places in 89 ms of which 2 ms to minimize.
[2024-05-22 22:43:20] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-22 22:43:21] [INFO ] Deduced a trap composed of 73 places in 98 ms of which 3 ms to minimize.
[2024-05-22 22:43:21] [INFO ] Deduced a trap composed of 76 places in 107 ms of which 2 ms to minimize.
[2024-05-22 22:43:22] [INFO ] Deduced a trap composed of 77 places in 97 ms of which 2 ms to minimize.
[2024-05-22 22:43:22] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 2 ms to minimize.
[2024-05-22 22:43:22] [INFO ] Deduced a trap composed of 108 places in 99 ms of which 2 ms to minimize.
[2024-05-22 22:43:23] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 1 ms to minimize.
[2024-05-22 22:43:23] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 3 ms to minimize.
[2024-05-22 22:43:23] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 2 ms to minimize.
[2024-05-22 22:43:25] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 2 ms to minimize.
[2024-05-22 22:43:25] [INFO ] Deduced a trap composed of 81 places in 98 ms of which 1 ms to minimize.
[2024-05-22 22:43:26] [INFO ] Deduced a trap composed of 252 places in 115 ms of which 2 ms to minimize.
[2024-05-22 22:43:26] [INFO ] Deduced a trap composed of 255 places in 92 ms of which 2 ms to minimize.
[2024-05-22 22:43:27] [INFO ] Deduced a trap composed of 254 places in 106 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/763 variables, 15/787 constraints. Problems are: Problem set: 0 solved, 426 unsolved
[2024-05-22 22:43:32] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 2 ms to minimize.
[2024-05-22 22:43:36] [INFO ] Deduced a trap composed of 80 places in 96 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 2/789 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 763/763 variables, and 789 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 17/17 constraints]
After SMT, in 49103ms problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 49107ms
Starting structural reductions in LTL mode, iteration 1 : 336/360 places, 427/463 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49480 ms. Remains : 336/360 places, 427/463 transitions.
Stuttering acceptance computed with spot in 433 ms :[(NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3) p0), true, (NOT p1), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-12 finished in 49936 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||G(!p0)))'
Support contains 3 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 463/463 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 341 transition count 444
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 341 transition count 444
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 341 transition count 439
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 53 place count 331 transition count 429
Iterating global reduction 1 with 10 rules applied. Total rules applied 63 place count 331 transition count 429
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 71 place count 331 transition count 421
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 330 transition count 420
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 330 transition count 420
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 330 transition count 419
Applied a total of 74 rules in 18 ms. Remains 330 /360 variables (removed 30) and now considering 419/463 (removed 44) transitions.
// Phase 1: matrix 419 rows 330 cols
[2024-05-22 22:43:44] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 22:43:44] [INFO ] Implicit Places using invariants in 214 ms returned []
[2024-05-22 22:43:44] [INFO ] Invariant cache hit.
[2024-05-22 22:43:44] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
Running 418 sub problems to find dead transitions.
[2024-05-22 22:43:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/329 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (OVERLAPS) 1/330 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/330 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (OVERLAPS) 419/749 variables, 330/340 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/749 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 5 (OVERLAPS) 0/749 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 418 unsolved
No progress, stopping.
After SMT solving in domain Real declared 749/749 variables, and 340 constraints, problems are : Problem set: 0 solved, 418 unsolved in 17760 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 330/330 constraints, PredecessorRefiner: 418/418 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 418 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/329 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (OVERLAPS) 1/330 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/330 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (OVERLAPS) 419/749 variables, 330/340 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/749 variables, 418/758 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-05-22 22:44:09] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 2 ms to minimize.
[2024-05-22 22:44:09] [INFO ] Deduced a trap composed of 76 places in 118 ms of which 2 ms to minimize.
[2024-05-22 22:44:10] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 3 ms to minimize.
[2024-05-22 22:44:10] [INFO ] Deduced a trap composed of 78 places in 104 ms of which 2 ms to minimize.
[2024-05-22 22:44:12] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 1 ms to minimize.
[2024-05-22 22:44:12] [INFO ] Deduced a trap composed of 82 places in 89 ms of which 1 ms to minimize.
[2024-05-22 22:44:13] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 1 ms to minimize.
[2024-05-22 22:44:14] [INFO ] Deduced a trap composed of 249 places in 125 ms of which 1 ms to minimize.
[2024-05-22 22:44:14] [INFO ] Deduced a trap composed of 253 places in 108 ms of which 2 ms to minimize.
[2024-05-22 22:44:14] [INFO ] Deduced a trap composed of 280 places in 106 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/749 variables, 10/768 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-05-22 22:44:21] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 2 ms to minimize.
[2024-05-22 22:44:24] [INFO ] Deduced a trap composed of 249 places in 104 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/749 variables, 2/770 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-05-22 22:44:29] [INFO ] Deduced a trap composed of 80 places in 112 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 749/749 variables, and 771 constraints, problems are : Problem set: 0 solved, 418 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 330/330 constraints, PredecessorRefiner: 418/418 constraints, Known Traps: 13/13 constraints]
After SMT, in 47902ms problems are : Problem set: 0 solved, 418 unsolved
Search for dead transitions found 0 dead transitions in 47906ms
Starting structural reductions in LTL mode, iteration 1 : 330/360 places, 419/463 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48449 ms. Remains : 330/360 places, 419/463 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), p0, false, false]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-13
Product exploration explored 100000 steps with 1537 reset in 134 ms.
Product exploration explored 100000 steps with 1522 reset in 148 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 187 ms. Reduced automaton from 5 states, 9 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, p0]
RANDOM walk for 39694 steps (606 resets) in 140 ms. (281 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-08b-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-13 finished in 49327 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 3 out of 360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 360/360 places, 463/463 transitions.
Graph (trivial) has 331 edges and 360 vertex of which 49 / 360 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 318 transition count 377
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 275 transition count 377
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 87 place count 275 transition count 359
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 123 place count 257 transition count 359
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 155 place count 225 transition count 327
Iterating global reduction 2 with 32 rules applied. Total rules applied 187 place count 225 transition count 327
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 192 place count 225 transition count 322
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 198 place count 219 transition count 316
Iterating global reduction 3 with 6 rules applied. Total rules applied 204 place count 219 transition count 316
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 210 place count 219 transition count 310
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 308 place count 170 transition count 261
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 311 place count 167 transition count 258
Iterating global reduction 4 with 3 rules applied. Total rules applied 314 place count 167 transition count 258
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 317 place count 167 transition count 255
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 325 place count 167 transition count 247
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 327 place count 165 transition count 245
Applied a total of 327 rules in 38 ms. Remains 165 /360 variables (removed 195) and now considering 245/463 (removed 218) transitions.
[2024-05-22 22:44:33] [INFO ] Flow matrix only has 230 transitions (discarded 15 similar events)
// Phase 1: matrix 230 rows 165 cols
[2024-05-22 22:44:33] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 22:44:33] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-22 22:44:33] [INFO ] Flow matrix only has 230 transitions (discarded 15 similar events)
[2024-05-22 22:44:33] [INFO ] Invariant cache hit.
[2024-05-22 22:44:33] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2024-05-22 22:44:33] [INFO ] Redundant transitions in 1 ms returned []
Running 122 sub problems to find dead transitions.
[2024-05-22 22:44:33] [INFO ] Flow matrix only has 230 transitions (discarded 15 similar events)
[2024-05-22 22:44:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 8/165 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 229/394 variables, 165/175 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 0/394 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/395 variables, and 175 constraints, problems are : Problem set: 0 solved, 122 unsolved in 3191 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (OVERLAPS) 8/165 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 229/394 variables, 165/175 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 122/297 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 0/394 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/395 variables, and 297 constraints, problems are : Problem set: 0 solved, 122 unsolved in 3535 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 165/165 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
After SMT, in 6776ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 6778ms
Starting structural reductions in SI_LTL mode, iteration 1 : 165/360 places, 245/463 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7142 ms. Remains : 165/360 places, 245/463 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-08b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-15 finished in 7186 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(p0)&&G((X(p1)&&(p1||G(p2)))))||G(p0))))'
Found a Shortening insensitive property : FlexibleBarrier-PT-08b-LTLFireability-01
Stuttering acceptance computed with spot in 419 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false, (AND p1 (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), false]
Support contains 5 out of 360 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 360/360 places, 463/463 transitions.
Graph (trivial) has 327 edges and 360 vertex of which 49 / 360 are part of one of the 8 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 318 transition count 379
Reduce places removed 41 places and 0 transitions.
Iterating post reduction 1 with 41 rules applied. Total rules applied 83 place count 277 transition count 379
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 83 place count 277 transition count 361
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 119 place count 259 transition count 361
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 150 place count 228 transition count 330
Iterating global reduction 2 with 31 rules applied. Total rules applied 181 place count 228 transition count 330
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 186 place count 228 transition count 325
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 192 place count 222 transition count 319
Iterating global reduction 3 with 6 rules applied. Total rules applied 198 place count 222 transition count 319
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 204 place count 222 transition count 313
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 4 with 96 rules applied. Total rules applied 300 place count 174 transition count 265
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 303 place count 171 transition count 262
Iterating global reduction 4 with 3 rules applied. Total rules applied 306 place count 171 transition count 262
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 309 place count 171 transition count 259
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 317 place count 171 transition count 251
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 171 transition count 251
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 320 place count 169 transition count 249
Applied a total of 320 rules in 46 ms. Remains 169 /360 variables (removed 191) and now considering 249/463 (removed 214) transitions.
[2024-05-22 22:44:41] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
// Phase 1: matrix 234 rows 169 cols
[2024-05-22 22:44:41] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 22:44:41] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-22 22:44:41] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
[2024-05-22 22:44:41] [INFO ] Invariant cache hit.
[2024-05-22 22:44:41] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-05-22 22:44:41] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
[2024-05-22 22:44:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 8/169 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 233/402 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 0/402 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/403 variables, and 179 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3264 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 8/169 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 233/402 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 126/305 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-22 22:44:47] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-22 22:44:48] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (OVERLAPS) 0/402 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/403 variables, and 307 constraints, problems are : Problem set: 0 solved, 126 unsolved in 6847 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 2/2 constraints]
After SMT, in 10204ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 10206ms
Starting structural reductions in LI_LTL mode, iteration 1 : 169/360 places, 249/463 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10648 ms. Remains : 169/360 places, 249/463 transitions.
Running random walk in product with property : FlexibleBarrier-PT-08b-LTLFireability-01
Product exploration explored 100000 steps with 37636 reset in 415 ms.
Product exploration explored 100000 steps with 37477 reset in 470 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (OR (AND p1 p0) (AND p2 p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X p0), (X (AND p1 (NOT p2) p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (OR (AND p1 p0) (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X p0)), (X (X (AND p1 (NOT p2) p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 31 factoid took 252 ms. Reduced automaton from 8 states, 61 edges and 3 AP (stutter sensitive) to 8 states, 61 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 462 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), false, (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) (NOT p1)), false]
RANDOM walk for 40000 steps (2837 resets) in 719 ms. (55 steps per ms) remains 8/15 properties
BEST_FIRST walk for 40003 steps (8 resets) in 50 ms. (784 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (79 resets) in 58 ms. (678 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (79 resets) in 57 ms. (689 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (80 resets) in 36 ms. (1081 steps per ms) remains 6/6 properties
[2024-05-22 22:44:54] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
[2024-05-22 22:44:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf2 is UNSAT
Problem apf11 is UNSAT
At refinement iteration 1 (OVERLAPS) 92/97 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 152/249 variables, 97/101 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/101 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 103/352 variables, 42/143 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 1/144 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/144 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 30/382 variables, 5/149 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/382 variables, 10/159 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 0/159 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 20/402 variables, 20/179 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/402 variables, 0/179 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/402 variables, 0/179 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/403 variables, and 179 constraints, problems are : Problem set: 2 solved, 4 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 92/97 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 152/249 variables, 97/101 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 1/102 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/102 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 103/352 variables, 42/144 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 1/145 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 3/148 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/148 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 30/382 variables, 5/153 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/382 variables, 10/163 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-22 22:44:54] [INFO ] Deduced a trap composed of 62 places in 60 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 1/164 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/382 variables, 0/164 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 20/402 variables, 20/184 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/402 variables, 0/184 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/402 variables, 0/184 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/403 variables, and 184 constraints, problems are : Problem set: 2 solved, 4 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 626ms problems are : Problem set: 2 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 646 steps, including 30 resets, run visited all 4 properties in 17 ms. (steps per millisecond=38 )
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 4 properties in 16 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0))))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (OR (AND p1 p0) (AND p2 p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 p2 p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2 (NOT p0)))), (X p0), (X (AND p1 (NOT p2) p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND p2 (NOT p0)))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (OR (AND p1 p0) (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X p0)), (X (X (AND p1 (NOT p2) p0))), (X (X p1)), (G (OR p0 (NOT p2) p1)), (G (OR p0 (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p2 p1))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (AND p0 (NOT p2) p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT (AND (OR p0 (NOT p2)) (OR p0 (NOT p1))))), (F (NOT (OR (NOT p0) p2 p1))), (F p2), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (AND p0 p2) (AND p0 p1))))]
Knowledge based reduction with 33 factoid took 534 ms. Reduced automaton from 8 states, 61 edges and 3 AP (stutter sensitive) to 4 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false]
Support contains 2 out of 169 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 249/249 transitions.
Applied a total of 0 rules in 1 ms. Remains 169 /169 variables (removed 0) and now considering 249/249 (removed 0) transitions.
[2024-05-22 22:44:55] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
[2024-05-22 22:44:55] [INFO ] Invariant cache hit.
[2024-05-22 22:44:55] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-22 22:44:55] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
[2024-05-22 22:44:55] [INFO ] Invariant cache hit.
[2024-05-22 22:44:55] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Running 126 sub problems to find dead transitions.
[2024-05-22 22:44:55] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
[2024-05-22 22:44:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 8/169 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 233/402 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (OVERLAPS) 0/402 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/403 variables, and 179 constraints, problems are : Problem set: 0 solved, 126 unsolved in 3254 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (OVERLAPS) 8/169 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 233/402 variables, 169/179 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 126/305 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-22 22:45:01] [INFO ] Deduced a trap composed of 62 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 126 unsolved
[2024-05-22 22:45:02] [INFO ] Deduced a trap composed of 62 places in 50 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (OVERLAPS) 0/402 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/403 variables, and 307 constraints, problems are : Problem set: 0 solved, 126 unsolved in 6360 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 2/2 constraints]
After SMT, in 9670ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 9674ms
Finished structural reductions in LTL mode , in 1 iterations and 9960 ms. Remains : 169/169 places, 249/249 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 218 ms. Reduced automaton from 4 states, 17 edges and 2 AP (stutter sensitive) to 4 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false]
RANDOM walk for 40000 steps (2835 resets) in 850 ms. (47 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (78 resets) in 32 ms. (1212 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (78 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (78 resets) in 30 ms. (1290 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (81 resets) in 39 ms. (1000 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (79 resets) in 54 ms. (727 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (80 resets) in 25 ms. (1538 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 476274 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :0 out of 6
Probabilistic random walk after 476274 steps, saw 92490 distinct states, run finished after 3001 ms. (steps per millisecond=158 ) properties seen :0
[2024-05-22 22:45:09] [INFO ] Flow matrix only has 234 transitions (discarded 15 similar events)
[2024-05-22 22:45:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 66/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 119/187 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 145/332 variables, 59/129 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/332 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 42/374 variables, 7/137 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/374 variables, 14/151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 28/402 variables, 28/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/402 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/402 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/403 variables, and 179 constraints, problems are : Problem set: 0 solved, 6 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 66/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 119/187 variables, 68/70 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 6/76 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 145/332 variables, 59/135 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/332 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/332 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 42/374 variables, 7/143 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/374 variables, 14/157 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-22 22:45:10] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/374 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/374 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 28/402 variables, 28/186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/402 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 0/402 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/403 variables, and 186 constraints, problems are : Problem set: 0 solved, 6 unsolved in 376 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 742ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Finished Parikh walk after 495 steps, including 28 resets, run visited all 3 properties in 2 ms. (steps per millisecond=247 )
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 6 properties in 28 ms.
Knowledge obtained : [(AND p0 p1), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 13 factoid took 313 ms. Reduced automaton from 4 states, 17 edges and 2 AP (stutter sensitive) to 4 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p1)), false]
Product exploration explored 100000 steps with 37674 reset in 361 ms.
Product exploration explored 100000 steps with 37527 reset in 360 ms.
Support contains 2 out of 169 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 169/169 places, 249/249 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 168 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 168 transition count 248
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 168 transition count 247
Applied a total of 3 rules in 1 ms. Remains 168 /169 variables (removed 1) and now considering 247/249 (removed 2) transitions.
[2024-05-22 22:45:11] [INFO ] Flow matrix only has 232 transitions (discarded 15 similar events)
// Phase 1: matrix 232 rows 168 cols
[2024-05-22 22:45:11] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 22:45:11] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-22 22:45:11] [INFO ] Flow matrix only has 232 transitions (discarded 15 similar events)
[2024-05-22 22:45:11] [INFO ] Invariant cache hit.
[2024-05-22 22:45:12] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2024-05-22 22:45:12] [INFO ] Flow matrix only has 232 transitions (discarded 15 similar events)
[2024-05-22 22:45:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 8/168 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 231/399 variables, 168/178 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (OVERLAPS) 0/399 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/400 variables, and 178 constraints, problems are : Problem set: 0 solved, 125 unsolved in 3089 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 8/168 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (OVERLAPS) 231/399 variables, 168/178 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 125/303 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 0/399 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 399/400 variables, and 303 constraints, problems are : Problem set: 0 solved, 125 unsolved in 3458 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 168/168 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints]
After SMT, in 6623ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 6624ms
Starting structural reductions in LTL mode, iteration 1 : 168/169 places, 247/249 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6873 ms. Remains : 168/169 places, 247/249 transitions.
Treatment of property FlexibleBarrier-PT-08b-LTLFireability-01 finished in 37962 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((G(p0)||(!p1 U (G(!p1)||(!p1&&G(p2))))))))'
[2024-05-22 22:45:18] [INFO ] Flatten gal took : 22 ms
[2024-05-22 22:45:18] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-22 22:45:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 360 places, 463 transitions and 1303 arcs took 7 ms.
Total runtime 724682 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FlexibleBarrier-PT-08b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 360
TRANSITIONS: 463
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.008s, Sys 0.000s]


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2535
MODEL NAME: /home/mcc/execution/410/model
360 places, 463 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA FlexibleBarrier-PT-08b-LTLFireability-01 CANNOT_COMPUTE
FORMULA FlexibleBarrier-PT-08b-LTLFireability-11 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716418221268

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//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//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

Error in allocating array of size 1767154756 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory

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-08b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is FlexibleBarrier-PT-08b, 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 r179-tall-171640600700044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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