Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r496-tall-171640602600092.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is FlexibleBarrier-PT-14b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r496-tall-171640602600092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K 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.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 13 08:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 13 08:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 13 08:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 13 08:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 726K 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-14b-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-14b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-14b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-14b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-14b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-14b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-14b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-14b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-14b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-14b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-14b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-14b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-14b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-14b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-14b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-14b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717182845143

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-14b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:14:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 19:14:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:14:06] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2024-05-31 19:14:06] [INFO ] Transformed 2678 places.
[2024-05-31 19:14:06] [INFO ] Transformed 3085 transitions.
[2024-05-31 19:14:06] [INFO ] Found NUPN structural information;
[2024-05-31 19:14:06] [INFO ] Parsed PT model containing 2678 places and 3085 transitions and 7733 arcs in 285 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA FlexibleBarrier-PT-14b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14b-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 2678 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2678/2678 places, 3085/3085 transitions.
Discarding 1074 places :
Symmetric choice reduction at 0 with 1074 rule applications. Total rules 1074 place count 1604 transition count 2011
Iterating global reduction 0 with 1074 rules applied. Total rules applied 2148 place count 1604 transition count 2011
Discarding 500 places :
Symmetric choice reduction at 0 with 500 rule applications. Total rules 2648 place count 1104 transition count 1511
Iterating global reduction 0 with 500 rules applied. Total rules applied 3148 place count 1104 transition count 1511
Discarding 314 places :
Symmetric choice reduction at 0 with 314 rule applications. Total rules 3462 place count 790 transition count 1197
Iterating global reduction 0 with 314 rules applied. Total rules applied 3776 place count 790 transition count 1197
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 149 transitions.
Iterating post reduction 0 with 149 rules applied. Total rules applied 3925 place count 790 transition count 1048
Applied a total of 3925 rules in 425 ms. Remains 790 /2678 variables (removed 1888) and now considering 1048/3085 (removed 2037) transitions.
// Phase 1: matrix 1048 rows 790 cols
[2024-05-31 19:14:07] [INFO ] Computed 16 invariants in 44 ms
[2024-05-31 19:14:07] [INFO ] Implicit Places using invariants in 525 ms returned []
[2024-05-31 19:14:07] [INFO ] Invariant cache hit.
[2024-05-31 19:14:08] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 1178 ms to find 0 implicit places.
Running 1047 sub problems to find dead transitions.
[2024-05-31 19:14:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/789 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1047 unsolved
At refinement iteration 1 (OVERLAPS) 1/790 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1047 unsolved
[2024-05-31 19:14:31] [INFO ] Deduced a trap composed of 32 places in 240 ms of which 35 ms to minimize.
[2024-05-31 19:14:32] [INFO ] Deduced a trap composed of 115 places in 97 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 790/1838 variables, and 18 constraints, problems are : Problem set: 0 solved, 1047 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/790 constraints, PredecessorRefiner: 1047/1047 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1047 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/789 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1047 unsolved
At refinement iteration 1 (OVERLAPS) 1/790 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 1047 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/790 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1047 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/790 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1047 unsolved
At refinement iteration 4 (OVERLAPS) 1048/1838 variables, 790/808 constraints. Problems are: Problem set: 0 solved, 1047 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1838 variables, 1047/1855 constraints. Problems are: Problem set: 0 solved, 1047 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1838/1838 variables, and 1855 constraints, problems are : Problem set: 0 solved, 1047 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 790/790 constraints, PredecessorRefiner: 1047/1047 constraints, Known Traps: 2/2 constraints]
After SMT, in 61049ms problems are : Problem set: 0 solved, 1047 unsolved
Search for dead transitions found 0 dead transitions in 61076ms
Starting structural reductions in LTL mode, iteration 1 : 790/2678 places, 1048/3085 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62714 ms. Remains : 790/2678 places, 1048/3085 transitions.
Support contains 44 out of 790 places after structural reductions.
[2024-05-31 19:15:09] [INFO ] Flatten gal took : 99 ms
[2024-05-31 19:15:09] [INFO ] Flatten gal took : 53 ms
[2024-05-31 19:15:09] [INFO ] Input system was already deterministic with 1048 transitions.
Support contains 41 out of 790 places (down from 44) after GAL structural reductions.
RANDOM walk for 40000 steps (396 resets) in 2668 ms. (14 steps per ms) remains 23/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
[2024-05-31 19:15:10] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 641/672 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/672 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 118/790 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/790 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 1048/1838 variables, 790/806 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1838 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 0/1838 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1838/1838 variables, and 806 constraints, problems are : Problem set: 0 solved, 23 unsolved in 1859 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 790/790 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 641/672 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-31 19:15:13] [INFO ] Deduced a trap composed of 220 places in 216 ms of which 5 ms to minimize.
[2024-05-31 19:15:13] [INFO ] Deduced a trap composed of 254 places in 208 ms of which 4 ms to minimize.
[2024-05-31 19:15:13] [INFO ] Deduced a trap composed of 225 places in 219 ms of which 4 ms to minimize.
[2024-05-31 19:15:13] [INFO ] Deduced a trap composed of 224 places in 210 ms of which 4 ms to minimize.
[2024-05-31 19:15:14] [INFO ] Deduced a trap composed of 253 places in 193 ms of which 4 ms to minimize.
[2024-05-31 19:15:14] [INFO ] Deduced a trap composed of 220 places in 191 ms of which 4 ms to minimize.
[2024-05-31 19:15:14] [INFO ] Deduced a trap composed of 253 places in 196 ms of which 4 ms to minimize.
[2024-05-31 19:15:14] [INFO ] Deduced a trap composed of 222 places in 199 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/672 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/672 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 118/790 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-31 19:15:15] [INFO ] Deduced a trap composed of 220 places in 235 ms of which 5 ms to minimize.
[2024-05-31 19:15:16] [INFO ] Deduced a trap composed of 253 places in 223 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/790 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/790 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 1048/1838 variables, 790/816 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1838 variables, 23/839 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-31 19:15:17] [INFO ] Deduced a trap composed of 46 places in 141 ms of which 3 ms to minimize.
[2024-05-31 19:15:17] [INFO ] Deduced a trap composed of 260 places in 243 ms of which 4 ms to minimize.
[2024-05-31 19:15:17] [INFO ] Deduced a trap composed of 251 places in 245 ms of which 4 ms to minimize.
SMT process timed out in 7012ms, After SMT, problems are : Problem set: 0 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 31 out of 790 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Graph (trivial) has 693 edges and 790 vertex of which 79 / 790 are part of one of the 13 SCC in 4 ms
Free SCC test removed 66 places
Drop transitions (Empty/Sink Transition effects.) removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 724 transition count 900
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 137 place count 656 transition count 900
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 137 place count 656 transition count 870
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 197 place count 626 transition count 870
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 225 place count 598 transition count 842
Iterating global reduction 2 with 28 rules applied. Total rules applied 253 place count 598 transition count 842
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 255 place count 598 transition count 840
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 259 place count 594 transition count 836
Iterating global reduction 3 with 4 rules applied. Total rules applied 263 place count 594 transition count 836
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 186 rules applied. Total rules applied 449 place count 501 transition count 743
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 462 place count 501 transition count 730
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 464 place count 500 transition count 730
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 466 place count 500 transition count 728
Free-agglomeration rule applied 359 times.
Iterating global reduction 4 with 359 rules applied. Total rules applied 825 place count 500 transition count 369
Reduce places removed 359 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 106 transitions
Reduce isomorphic transitions removed 106 transitions.
Iterating post reduction 4 with 465 rules applied. Total rules applied 1290 place count 141 transition count 263
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 1308 place count 141 transition count 245
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1309 place count 141 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1310 place count 140 transition count 244
Applied a total of 1310 rules in 367 ms. Remains 140 /790 variables (removed 650) and now considering 244/1048 (removed 804) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 369 ms. Remains : 140/790 places, 244/1048 transitions.
RANDOM walk for 35482 steps (265 resets) in 1157 ms. (30 steps per ms) remains 0/23 properties
Computed a total of 17 stabilizing places and 17 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((p0&&G(p1))))'
Support contains 2 out of 790 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Graph (trivial) has 744 edges and 790 vertex of which 85 / 790 are part of one of the 14 SCC in 2 ms
Free SCC test removed 71 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 718 transition count 896
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 639 transition count 896
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 159 place count 639 transition count 864
Deduced a syphon composed of 32 places in 2 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 223 place count 607 transition count 864
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 273 place count 557 transition count 814
Iterating global reduction 2 with 50 rules applied. Total rules applied 323 place count 557 transition count 814
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 328 place count 557 transition count 809
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 328 place count 557 transition count 808
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 330 place count 556 transition count 808
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 340 place count 546 transition count 798
Iterating global reduction 3 with 10 rules applied. Total rules applied 350 place count 546 transition count 798
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 360 place count 546 transition count 788
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 530 place count 461 transition count 703
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 534 place count 457 transition count 699
Iterating global reduction 4 with 4 rules applied. Total rules applied 538 place count 457 transition count 699
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 542 place count 457 transition count 695
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 556 place count 457 transition count 681
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 557 place count 456 transition count 680
Applied a total of 557 rules in 284 ms. Remains 456 /790 variables (removed 334) and now considering 680/1048 (removed 368) transitions.
[2024-05-31 19:15:19] [INFO ] Flow matrix only has 653 transitions (discarded 27 similar events)
// Phase 1: matrix 653 rows 456 cols
[2024-05-31 19:15:19] [INFO ] Computed 16 invariants in 17 ms
[2024-05-31 19:15:19] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-31 19:15:19] [INFO ] Flow matrix only has 653 transitions (discarded 27 similar events)
[2024-05-31 19:15:19] [INFO ] Invariant cache hit.
[2024-05-31 19:15:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 19:15:20] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
[2024-05-31 19:15:20] [INFO ] Redundant transitions in 37 ms returned []
Running 509 sub problems to find dead transitions.
[2024-05-31 19:15:20] [INFO ] Flow matrix only has 653 transitions (discarded 27 similar events)
[2024-05-31 19:15:20] [INFO ] Invariant cache hit.
[2024-05-31 19:15:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (OVERLAPS) 1/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (OVERLAPS) 652/1108 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1108 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (OVERLAPS) 1/1109 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 473 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (OVERLAPS) 1/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (OVERLAPS) 652/1108 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1108 variables, 509/981 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1108 variables, 0/981 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 7 (OVERLAPS) 1/1109 variables, 1/982 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 982 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints]
After SMT, in 60486ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 60491ms
Starting structural reductions in SI_LTL mode, iteration 1 : 456/790 places, 680/1048 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61517 ms. Remains : 456/790 places, 680/1048 transitions.
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-00
Product exploration explored 100000 steps with 4430 reset in 710 ms.
Stuttering criterion allowed to conclude after 52554 steps with 2332 reset in 333 ms.
FORMULA FlexibleBarrier-PT-14b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-00 finished in 62860 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(p0))'
Support contains 1 out of 790 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Graph (trivial) has 744 edges and 790 vertex of which 85 / 790 are part of one of the 14 SCC in 3 ms
Free SCC test removed 71 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 718 transition count 898
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 155 place count 641 transition count 898
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 155 place count 641 transition count 865
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 221 place count 608 transition count 865
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 272 place count 557 transition count 814
Iterating global reduction 2 with 51 rules applied. Total rules applied 323 place count 557 transition count 814
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 328 place count 557 transition count 809
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 338 place count 547 transition count 799
Iterating global reduction 3 with 10 rules applied. Total rules applied 348 place count 547 transition count 799
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 358 place count 547 transition count 789
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 4 with 172 rules applied. Total rules applied 530 place count 461 transition count 703
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 535 place count 456 transition count 698
Iterating global reduction 4 with 5 rules applied. Total rules applied 540 place count 456 transition count 698
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 545 place count 456 transition count 693
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 559 place count 456 transition count 679
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 561 place count 454 transition count 677
Applied a total of 561 rules in 160 ms. Remains 454 /790 variables (removed 336) and now considering 677/1048 (removed 371) transitions.
[2024-05-31 19:16:22] [INFO ] Flow matrix only has 650 transitions (discarded 27 similar events)
// Phase 1: matrix 650 rows 454 cols
[2024-05-31 19:16:22] [INFO ] Computed 16 invariants in 14 ms
[2024-05-31 19:16:22] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-31 19:16:22] [INFO ] Flow matrix only has 650 transitions (discarded 27 similar events)
[2024-05-31 19:16:22] [INFO ] Invariant cache hit.
[2024-05-31 19:16:22] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
[2024-05-31 19:16:22] [INFO ] Redundant transitions in 6 ms returned []
Running 297 sub problems to find dead transitions.
[2024-05-31 19:16:22] [INFO ] Flow matrix only has 650 transitions (discarded 27 similar events)
[2024-05-31 19:16:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 14/454 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (OVERLAPS) 649/1103 variables, 454/470 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1103 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (OVERLAPS) 0/1103 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1103/1104 variables, and 470 constraints, problems are : Problem set: 0 solved, 297 unsolved in 18173 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 454/454 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 14/454 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (OVERLAPS) 649/1103 variables, 454/470 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1103 variables, 297/767 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-31 19:16:48] [INFO ] Deduced a trap composed of 188 places in 137 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1103 variables, 1/768 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1103 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (OVERLAPS) 0/1103 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1103/1104 variables, and 768 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 454/454 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 1/1 constraints]
After SMT, in 48416ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 48420ms
Starting structural reductions in SI_LTL mode, iteration 1 : 454/790 places, 677/1048 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49199 ms. Remains : 454/790 places, 677/1048 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-14b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-01 finished in 49277 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(p0))'
Support contains 6 out of 790 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Graph (trivial) has 738 edges and 790 vertex of which 85 / 790 are part of one of the 14 SCC in 3 ms
Free SCC test removed 71 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 718 transition count 897
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 640 transition count 897
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 157 place count 640 transition count 866
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 219 place count 609 transition count 866
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 270 place count 558 transition count 815
Iterating global reduction 2 with 51 rules applied. Total rules applied 321 place count 558 transition count 815
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 325 place count 558 transition count 811
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 325 place count 558 transition count 810
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 327 place count 557 transition count 810
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 337 place count 547 transition count 800
Iterating global reduction 3 with 10 rules applied. Total rules applied 347 place count 547 transition count 800
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 357 place count 547 transition count 790
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 4 with 166 rules applied. Total rules applied 523 place count 464 transition count 707
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 528 place count 459 transition count 702
Iterating global reduction 4 with 5 rules applied. Total rules applied 533 place count 459 transition count 702
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 538 place count 459 transition count 697
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 552 place count 459 transition count 683
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 554 place count 459 transition count 683
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 556 place count 457 transition count 681
Applied a total of 556 rules in 196 ms. Remains 457 /790 variables (removed 333) and now considering 681/1048 (removed 367) transitions.
[2024-05-31 19:17:11] [INFO ] Flow matrix only has 656 transitions (discarded 25 similar events)
// Phase 1: matrix 656 rows 457 cols
[2024-05-31 19:17:11] [INFO ] Computed 16 invariants in 15 ms
[2024-05-31 19:17:11] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-31 19:17:11] [INFO ] Flow matrix only has 656 transitions (discarded 25 similar events)
[2024-05-31 19:17:11] [INFO ] Invariant cache hit.
[2024-05-31 19:17:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 19:17:12] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 658 ms to find 0 implicit places.
[2024-05-31 19:17:12] [INFO ] Redundant transitions in 4 ms returned []
Running 300 sub problems to find dead transitions.
[2024-05-31 19:17:12] [INFO ] Flow matrix only has 656 transitions (discarded 25 similar events)
[2024-05-31 19:17:12] [INFO ] Invariant cache hit.
[2024-05-31 19:17:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 15/457 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 655/1112 variables, 457/473 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1112 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1112 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (OVERLAPS) 0/1112 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1112/1113 variables, and 474 constraints, problems are : Problem set: 0 solved, 300 unsolved in 19614 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 457/457 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 15/457 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (OVERLAPS) 655/1112 variables, 457/473 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1112 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1112 variables, 300/774 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1112 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 8 (OVERLAPS) 0/1112 variables, 0/774 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1112/1113 variables, and 774 constraints, problems are : Problem set: 0 solved, 300 unsolved in 25939 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 457/457 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 45858ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 45862ms
Starting structural reductions in SI_LTL mode, iteration 1 : 457/790 places, 681/1048 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46730 ms. Remains : 457/790 places, 681/1048 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-14b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-02 finished in 46803 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(p1)) U G(p2)) U !p1))'
Support contains 3 out of 790 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Graph (trivial) has 741 edges and 790 vertex of which 79 / 790 are part of one of the 13 SCC in 6 ms
Free SCC test removed 66 places
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 723 transition count 901
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 644 transition count 901
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 159 place count 644 transition count 868
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 225 place count 611 transition count 868
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 273 place count 563 transition count 820
Iterating global reduction 2 with 48 rules applied. Total rules applied 321 place count 563 transition count 820
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 326 place count 563 transition count 815
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 326 place count 563 transition count 814
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 328 place count 562 transition count 814
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 338 place count 552 transition count 804
Iterating global reduction 3 with 10 rules applied. Total rules applied 348 place count 552 transition count 804
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 358 place count 552 transition count 794
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 534 place count 464 transition count 706
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 537 place count 461 transition count 703
Iterating global reduction 4 with 3 rules applied. Total rules applied 540 place count 461 transition count 703
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 543 place count 461 transition count 700
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 545 place count 460 transition count 700
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 5 with 15 rules applied. Total rules applied 560 place count 460 transition count 685
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 562 place count 458 transition count 683
Applied a total of 562 rules in 201 ms. Remains 458 /790 variables (removed 332) and now considering 683/1048 (removed 365) transitions.
[2024-05-31 19:17:58] [INFO ] Flow matrix only has 657 transitions (discarded 26 similar events)
// Phase 1: matrix 657 rows 458 cols
[2024-05-31 19:17:58] [INFO ] Computed 16 invariants in 11 ms
[2024-05-31 19:17:58] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-31 19:17:58] [INFO ] Flow matrix only has 657 transitions (discarded 26 similar events)
[2024-05-31 19:17:58] [INFO ] Invariant cache hit.
[2024-05-31 19:17:58] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 629 ms to find 0 implicit places.
[2024-05-31 19:17:58] [INFO ] Redundant transitions in 3 ms returned []
Running 315 sub problems to find dead transitions.
[2024-05-31 19:17:58] [INFO ] Flow matrix only has 657 transitions (discarded 26 similar events)
[2024-05-31 19:17:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (OVERLAPS) 14/458 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/458 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 656/1114 variables, 458/474 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1114 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (OVERLAPS) 0/1114 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1114/1115 variables, and 474 constraints, problems are : Problem set: 0 solved, 315 unsolved in 20511 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 458/458 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/444 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/444 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 2 (OVERLAPS) 14/458 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/458 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 4 (OVERLAPS) 656/1114 variables, 458/474 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1114 variables, 315/789 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1114 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 315 unsolved
At refinement iteration 7 (OVERLAPS) 0/1114 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1114/1115 variables, and 789 constraints, problems are : Problem set: 0 solved, 315 unsolved in 24444 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 458/458 constraints, PredecessorRefiner: 315/315 constraints, Known Traps: 0/0 constraints]
After SMT, in 45217ms problems are : Problem set: 0 solved, 315 unsolved
Search for dead transitions found 0 dead transitions in 45221ms
Starting structural reductions in SI_LTL mode, iteration 1 : 458/790 places, 683/1048 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46060 ms. Remains : 458/790 places, 683/1048 transitions.
Stuttering acceptance computed with spot in 242 ms :[p1, true, true, (OR (NOT p2) p1), (OR (NOT p2) p1), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-14b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-03 finished in 46329 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&&X(F((p1||G(p2)))))||G(F((p1||G(p2))))))))'
Support contains 5 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 765 transition count 1023
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 765 transition count 1023
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 765 transition count 1019
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 72 place count 747 transition count 1001
Iterating global reduction 1 with 18 rules applied. Total rules applied 90 place count 747 transition count 1001
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 101 place count 747 transition count 990
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 108 place count 740 transition count 983
Iterating global reduction 2 with 7 rules applied. Total rules applied 115 place count 740 transition count 983
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 118 place count 740 transition count 980
Applied a total of 118 rules in 77 ms. Remains 740 /790 variables (removed 50) and now considering 980/1048 (removed 68) transitions.
// Phase 1: matrix 980 rows 740 cols
[2024-05-31 19:18:44] [INFO ] Computed 16 invariants in 18 ms
[2024-05-31 19:18:44] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-31 19:18:44] [INFO ] Invariant cache hit.
[2024-05-31 19:18:45] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 870 ms to find 0 implicit places.
Running 979 sub problems to find dead transitions.
[2024-05-31 19:18:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/739 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 979 unsolved
At refinement iteration 1 (OVERLAPS) 1/740 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 979 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 740/1720 variables, and 16 constraints, problems are : Problem set: 0 solved, 979 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/740 constraints, PredecessorRefiner: 979/979 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 979 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/739 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 979 unsolved
At refinement iteration 1 (OVERLAPS) 1/740 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 979 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/740 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 979 unsolved
At refinement iteration 3 (OVERLAPS) 980/1720 variables, 740/756 constraints. Problems are: Problem set: 0 solved, 979 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1720 variables, 979/1735 constraints. Problems are: Problem set: 0 solved, 979 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1720/1720 variables, and 1735 constraints, problems are : Problem set: 0 solved, 979 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 740/740 constraints, PredecessorRefiner: 979/979 constraints, Known Traps: 0/0 constraints]
After SMT, in 60786ms problems are : Problem set: 0 solved, 979 unsolved
Search for dead transitions found 0 dead transitions in 60798ms
Starting structural reductions in LTL mode, iteration 1 : 740/790 places, 980/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61749 ms. Remains : 740/790 places, 980/1048 transitions.
Stuttering acceptance computed with spot in 310 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-04
Product exploration explored 100000 steps with 33333 reset in 190 ms.
Product exploration explored 100000 steps with 33333 reset in 215 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 25 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-14b-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-04 finished in 62538 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 790 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Graph (trivial) has 744 edges and 790 vertex of which 85 / 790 are part of one of the 14 SCC in 1 ms
Free SCC test removed 71 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 78 place count 718 transition count 898
Reduce places removed 77 places and 0 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 155 place count 641 transition count 898
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 155 place count 641 transition count 865
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 221 place count 608 transition count 865
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 272 place count 557 transition count 814
Iterating global reduction 2 with 51 rules applied. Total rules applied 323 place count 557 transition count 814
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 328 place count 557 transition count 809
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 338 place count 547 transition count 799
Iterating global reduction 3 with 10 rules applied. Total rules applied 348 place count 547 transition count 799
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 358 place count 547 transition count 789
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 4 with 172 rules applied. Total rules applied 530 place count 461 transition count 703
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 535 place count 456 transition count 698
Iterating global reduction 4 with 5 rules applied. Total rules applied 540 place count 456 transition count 698
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 545 place count 456 transition count 693
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 559 place count 456 transition count 679
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 561 place count 454 transition count 677
Applied a total of 561 rules in 149 ms. Remains 454 /790 variables (removed 336) and now considering 677/1048 (removed 371) transitions.
[2024-05-31 19:19:46] [INFO ] Flow matrix only has 650 transitions (discarded 27 similar events)
// Phase 1: matrix 650 rows 454 cols
[2024-05-31 19:19:46] [INFO ] Computed 16 invariants in 15 ms
[2024-05-31 19:19:47] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-31 19:19:47] [INFO ] Flow matrix only has 650 transitions (discarded 27 similar events)
[2024-05-31 19:19:47] [INFO ] Invariant cache hit.
[2024-05-31 19:19:47] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 586 ms to find 0 implicit places.
[2024-05-31 19:19:47] [INFO ] Redundant transitions in 5 ms returned []
Running 297 sub problems to find dead transitions.
[2024-05-31 19:19:47] [INFO ] Flow matrix only has 650 transitions (discarded 27 similar events)
[2024-05-31 19:19:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 14/454 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-05-31 19:19:52] [INFO ] Deduced a trap composed of 188 places in 123 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (OVERLAPS) 649/1103 variables, 454/471 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1103 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 0/1103 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1103/1104 variables, and 471 constraints, problems are : Problem set: 0 solved, 297 unsolved in 20736 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 454/454 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 14/454 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (OVERLAPS) 649/1103 variables, 454/471 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1103 variables, 297/768 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1103 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (OVERLAPS) 0/1103 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1103/1104 variables, and 768 constraints, problems are : Problem set: 0 solved, 297 unsolved in 23037 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 454/454 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 1/1 constraints]
After SMT, in 44011ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 44014ms
Starting structural reductions in SI_LTL mode, iteration 1 : 454/790 places, 677/1048 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44767 ms. Remains : 454/790 places, 677/1048 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-14b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-05 finished in 44840 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&&F(G(p0))))))))'
Support contains 1 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 764 transition count 1022
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 764 transition count 1022
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 764 transition count 1017
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 75 place count 746 transition count 999
Iterating global reduction 1 with 18 rules applied. Total rules applied 93 place count 746 transition count 999
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 105 place count 746 transition count 987
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 111 place count 740 transition count 981
Iterating global reduction 2 with 6 rules applied. Total rules applied 117 place count 740 transition count 981
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 120 place count 740 transition count 978
Applied a total of 120 rules in 73 ms. Remains 740 /790 variables (removed 50) and now considering 978/1048 (removed 70) transitions.
// Phase 1: matrix 978 rows 740 cols
[2024-05-31 19:20:31] [INFO ] Computed 16 invariants in 16 ms
[2024-05-31 19:20:31] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-31 19:20:31] [INFO ] Invariant cache hit.
[2024-05-31 19:20:32] [INFO ] Implicit Places using invariants and state equation in 606 ms returned []
Implicit Place search using SMT with State Equation took 874 ms to find 0 implicit places.
Running 977 sub problems to find dead transitions.
[2024-05-31 19:20:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/739 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 977 unsolved
At refinement iteration 1 (OVERLAPS) 1/740 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 977 unsolved
(s731 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 1.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 1.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 1.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 1.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 1.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 1.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 1.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 1.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 740/1718 variables, and 16 constraints, problems are : Problem set: 0 solved, 977 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/740 constraints, PredecessorRefiner: 977/977 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 977 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/739 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 977 unsolved
At refinement iteration 1 (OVERLAPS) 1/740 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 977 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/740 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 977 unsolved
At refinement iteration 3 (OVERLAPS) 978/1718 variables, 740/756 constraints. Problems are: Problem set: 0 solved, 977 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1718 variables, 977/1733 constraints. Problems are: Problem set: 0 solved, 977 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1718/1718 variables, and 1733 constraints, problems are : Problem set: 0 solved, 977 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 740/740 constraints, PredecessorRefiner: 977/977 constraints, Known Traps: 0/0 constraints]
After SMT, in 60810ms problems are : Problem set: 0 solved, 977 unsolved
Search for dead transitions found 0 dead transitions in 60821ms
Starting structural reductions in LTL mode, iteration 1 : 740/790 places, 978/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61770 ms. Remains : 740/790 places, 978/1048 transitions.
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-14b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-06 finished in 61979 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)))'
Support contains 2 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 764 transition count 1022
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 764 transition count 1022
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 764 transition count 1017
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 75 place count 746 transition count 999
Iterating global reduction 1 with 18 rules applied. Total rules applied 93 place count 746 transition count 999
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 105 place count 746 transition count 987
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 111 place count 740 transition count 981
Iterating global reduction 2 with 6 rules applied. Total rules applied 117 place count 740 transition count 981
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 119 place count 740 transition count 979
Applied a total of 119 rules in 67 ms. Remains 740 /790 variables (removed 50) and now considering 979/1048 (removed 69) transitions.
// Phase 1: matrix 979 rows 740 cols
[2024-05-31 19:21:33] [INFO ] Computed 16 invariants in 17 ms
[2024-05-31 19:21:33] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-31 19:21:33] [INFO ] Invariant cache hit.
[2024-05-31 19:21:34] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 902 ms to find 0 implicit places.
Running 978 sub problems to find dead transitions.
[2024-05-31 19:21:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/739 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 978 unsolved
At refinement iteration 1 (OVERLAPS) 1/740 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 978 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 740/1719 variables, and 16 constraints, problems are : Problem set: 0 solved, 978 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/740 constraints, PredecessorRefiner: 978/978 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 978 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/739 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 978 unsolved
At refinement iteration 1 (OVERLAPS) 1/740 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 978 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/740 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 978 unsolved
At refinement iteration 3 (OVERLAPS) 979/1719 variables, 740/756 constraints. Problems are: Problem set: 0 solved, 978 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1719 variables, 978/1734 constraints. Problems are: Problem set: 0 solved, 978 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1719/1719 variables, and 1734 constraints, problems are : Problem set: 0 solved, 978 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 740/740 constraints, PredecessorRefiner: 978/978 constraints, Known Traps: 0/0 constraints]
After SMT, in 60897ms problems are : Problem set: 0 solved, 978 unsolved
Search for dead transitions found 0 dead transitions in 60911ms
Starting structural reductions in LTL mode, iteration 1 : 740/790 places, 979/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61883 ms. Remains : 740/790 places, 979/1048 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-07
Product exploration explored 100000 steps with 999 reset in 203 ms.
Product exploration explored 100000 steps with 999 reset in 219 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (397 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (37 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 741793 steps, run timeout after 3001 ms. (steps per millisecond=247 ) properties seen :0 out of 1
Probabilistic random walk after 741793 steps, saw 241345 distinct states, run finished after 3016 ms. (steps per millisecond=245 ) properties seen :0
[2024-05-31 19:22:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 91/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 647/740 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/740 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 979/1719 variables, 740/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1719 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1719 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1719/1719 variables, and 756 constraints, problems are : Problem set: 0 solved, 1 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 740/740 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 91/93 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 647/740 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/740 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 979/1719 variables, 740/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1719 variables, 1/757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1719 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1719 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1719/1719 variables, and 757 constraints, problems are : Problem set: 0 solved, 1 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 740/740 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 675ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 91 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=91 )
Parikh walk visited 1 properties in 8 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 99 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-14b-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-07 finished in 66440 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 U (G(!p0)||((!p0 U (G(!p0)||(!p0&&G(p2))))&&p1))))'
Support contains 7 out of 790 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Graph (trivial) has 739 edges and 790 vertex of which 85 / 790 are part of one of the 14 SCC in 2 ms
Free SCC test removed 71 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 718 transition count 896
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 639 transition count 896
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 159 place count 639 transition count 865
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 221 place count 608 transition count 865
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 270 place count 559 transition count 816
Iterating global reduction 2 with 49 rules applied. Total rules applied 319 place count 559 transition count 816
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 322 place count 559 transition count 813
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 322 place count 559 transition count 812
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 324 place count 558 transition count 812
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 334 place count 548 transition count 802
Iterating global reduction 3 with 10 rules applied. Total rules applied 344 place count 548 transition count 802
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 353 place count 548 transition count 793
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 523 place count 463 transition count 708
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 528 place count 458 transition count 703
Iterating global reduction 4 with 5 rules applied. Total rules applied 533 place count 458 transition count 703
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 538 place count 458 transition count 698
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 552 place count 458 transition count 684
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 554 place count 456 transition count 682
Applied a total of 554 rules in 164 ms. Remains 456 /790 variables (removed 334) and now considering 682/1048 (removed 366) transitions.
[2024-05-31 19:22:40] [INFO ] Flow matrix only has 655 transitions (discarded 27 similar events)
// Phase 1: matrix 655 rows 456 cols
[2024-05-31 19:22:40] [INFO ] Computed 16 invariants in 13 ms
[2024-05-31 19:22:40] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-31 19:22:40] [INFO ] Flow matrix only has 655 transitions (discarded 27 similar events)
[2024-05-31 19:22:40] [INFO ] Invariant cache hit.
[2024-05-31 19:22:40] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
[2024-05-31 19:22:40] [INFO ] Redundant transitions in 3 ms returned []
Running 299 sub problems to find dead transitions.
[2024-05-31 19:22:40] [INFO ] Flow matrix only has 655 transitions (discarded 27 similar events)
[2024-05-31 19:22:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 654/1110 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1110 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (OVERLAPS) 0/1110 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1110/1111 variables, and 472 constraints, problems are : Problem set: 0 solved, 299 unsolved in 18522 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 654/1110 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1110 variables, 299/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1110 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (OVERLAPS) 0/1110 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1110/1111 variables, and 771 constraints, problems are : Problem set: 0 solved, 299 unsolved in 23090 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
After SMT, in 41869ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 41871ms
Starting structural reductions in SI_LTL mode, iteration 1 : 456/790 places, 682/1048 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42651 ms. Remains : 456/790 places, 682/1048 transitions.
Stuttering acceptance computed with spot in 223 ms :[true, (AND p0 (NOT p2)), (NOT p2), p0, p0]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-09
Product exploration explored 100000 steps with 4881 reset in 700 ms.
Product exploration explored 100000 steps with 4900 reset in 711 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 p0) p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (AND p1 p2 (NOT p0))), (X (NOT (AND p2 p0))), (X (AND p2 (NOT p0))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p2 p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 94 ms. Reduced automaton from 5 states, 14 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p2), (AND (NOT p2) p0), p0]
RANDOM walk for 40000 steps (2010 resets) in 797 ms. (50 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (17 resets) in 255 ms. (156 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 377 ms. (105 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (18 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
[2024-05-31 19:23:25] [INFO ] Flow matrix only has 655 transitions (discarded 27 similar events)
[2024-05-31 19:23:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 228/232 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 409/641 variables, 232/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 359/1000 variables, 158/394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 66/1066 variables, 11/406 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1066 variables, 22/428 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1066 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 44/1110 variables, 44/472 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1110 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/1110 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1110/1111 variables, and 472 constraints, problems are : Problem set: 0 solved, 3 unsolved in 448 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 228/232 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 409/641 variables, 232/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/641 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 359/1000 variables, 158/394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 1/395 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 3/398 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1000 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 66/1066 variables, 11/409 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1066 variables, 22/431 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1066 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 44/1110 variables, 44/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1110 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1110 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1110/1111 variables, and 475 constraints, problems are : Problem set: 0 solved, 3 unsolved in 438 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 892ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 21 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=10 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 2 ms.
Knowledge obtained : [(AND p2 (NOT p0) p1), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X (AND p1 p2 (NOT p0))), (X (NOT (AND p2 p0))), (X (AND p2 (NOT p0))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p2 p0)))), (X (X (AND p2 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p2))), (F (NOT p2)), (F (NOT (AND (NOT p0) p2))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) (NOT p2))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR (NOT p0) p2)))
Knowledge based reduction with 21 factoid took 296 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-14b-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-09 finished in 46355 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((p0&&X(F(p1))))||G(p0)))'
Support contains 2 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 765 transition count 1023
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 765 transition count 1023
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 55 place count 765 transition count 1018
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 72 place count 748 transition count 1001
Iterating global reduction 1 with 17 rules applied. Total rules applied 89 place count 748 transition count 1001
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 99 place count 748 transition count 991
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 106 place count 741 transition count 984
Iterating global reduction 2 with 7 rules applied. Total rules applied 113 place count 741 transition count 984
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 116 place count 741 transition count 981
Applied a total of 116 rules in 69 ms. Remains 741 /790 variables (removed 49) and now considering 981/1048 (removed 67) transitions.
// Phase 1: matrix 981 rows 741 cols
[2024-05-31 19:23:26] [INFO ] Computed 16 invariants in 17 ms
[2024-05-31 19:23:26] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-31 19:23:26] [INFO ] Invariant cache hit.
[2024-05-31 19:23:27] [INFO ] Implicit Places using invariants and state equation in 557 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
Running 980 sub problems to find dead transitions.
[2024-05-31 19:23:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 980 unsolved
At refinement iteration 1 (OVERLAPS) 1/741 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 980 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(timeout
s144 0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/1722 variables, and 16 constraints, problems are : Problem set: 0 solved, 980 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/741 constraints, PredecessorRefiner: 980/980 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 980 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 980 unsolved
At refinement iteration 1 (OVERLAPS) 1/741 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 980 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/741 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 980 unsolved
At refinement iteration 3 (OVERLAPS) 981/1722 variables, 741/757 constraints. Problems are: Problem set: 0 solved, 980 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1722 variables, 980/1737 constraints. Problems are: Problem set: 0 solved, 980 unsolved
[2024-05-31 19:24:27] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1722/1722 variables, and 1738 constraints, problems are : Problem set: 0 solved, 980 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 741/741 constraints, PredecessorRefiner: 980/980 constraints, Known Traps: 1/1 constraints]
After SMT, in 60885ms problems are : Problem set: 0 solved, 980 unsolved
Search for dead transitions found 0 dead transitions in 60898ms
Starting structural reductions in LTL mode, iteration 1 : 741/790 places, 981/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61794 ms. Remains : 741/790 places, 981/1048 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-10
Product exploration explored 100000 steps with 993 reset in 206 ms.
Product exploration explored 100000 steps with 994 reset in 228 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 138 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (397 resets) in 345 ms. (115 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (40 resets) in 106 ms. (373 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (39 resets) in 71 ms. (555 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (37 resets) in 29 ms. (1333 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (39 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (38 resets) in 35 ms. (1111 steps per ms) remains 3/6 properties
[2024-05-31 19:24:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 175/177 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 564/741 variables, 15/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/741 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 981/1722 variables, 741/757 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1722 variables, 0/757 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/1722 variables, 0/757 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1722/1722 variables, and 757 constraints, problems are : Problem set: 1 solved, 2 unsolved in 351 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 741/741 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/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 175/177 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 564/741 variables, 15/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/741 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 981/1722 variables, 741/757 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1722 variables, 2/759 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1722 variables, 0/759 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1722 variables, 0/759 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1722/1722 variables, and 759 constraints, problems are : Problem set: 1 solved, 2 unsolved in 418 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 741/741 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 776ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 76 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=38 )
Parikh walk visited 2 properties in 2 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (OR (NOT p1) p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (NOT p0)), (F p1), (F (NOT (OR p1 p0))), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 10 factoid took 379 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 297 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 271 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Support contains 2 out of 741 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 741/741 places, 981/981 transitions.
Graph (trivial) has 695 edges and 741 vertex of which 85 / 741 are part of one of the 14 SCC in 2 ms
Free SCC test removed 71 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 669 transition count 840
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 137 place count 601 transition count 840
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 137 place count 601 transition count 810
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 197 place count 571 transition count 810
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 224 place count 544 transition count 783
Iterating global reduction 2 with 27 rules applied. Total rules applied 251 place count 544 transition count 783
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 1 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 172 rules applied. Total rules applied 423 place count 458 transition count 697
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 437 place count 458 transition count 683
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 439 place count 456 transition count 681
Applied a total of 439 rules in 114 ms. Remains 456 /741 variables (removed 285) and now considering 681/981 (removed 300) transitions.
[2024-05-31 19:24:31] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
// Phase 1: matrix 654 rows 456 cols
[2024-05-31 19:24:31] [INFO ] Computed 16 invariants in 15 ms
[2024-05-31 19:24:31] [INFO ] Implicit Places using invariants in 231 ms returned []
[2024-05-31 19:24:31] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-31 19:24:31] [INFO ] Invariant cache hit.
[2024-05-31 19:24:31] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
[2024-05-31 19:24:31] [INFO ] Redundant transitions in 4 ms returned []
Running 299 sub problems to find dead transitions.
[2024-05-31 19:24:31] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-31 19:24:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 653/1109 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (OVERLAPS) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1110 variables, and 472 constraints, problems are : Problem set: 0 solved, 299 unsolved in 18699 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 653/1109 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1109 variables, 299/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1109 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (OVERLAPS) 0/1109 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1110 variables, and 771 constraints, problems are : Problem set: 0 solved, 299 unsolved in 23459 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
After SMT, in 42414ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 42417ms
Starting structural reductions in SI_LTL mode, iteration 1 : 456/741 places, 681/981 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43175 ms. Remains : 456/741 places, 681/981 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 (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 133 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 281 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), false, false]
RANDOM walk for 40000 steps (2012 resets) in 587 ms. (68 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (17 resets) in 36 ms. (1081 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 24 ms. (1600 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (17 resets) in 20 ms. (1904 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 20 ms. (1904 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (17 resets) in 24 ms. (1600 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 20 ms. (1904 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 424343 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :0 out of 6
Probabilistic random walk after 424343 steps, saw 101459 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
[2024-05-31 19:25:18] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-31 19:25:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 170/172 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 342/514 variables, 172/173 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 424/938 variables, 198/371 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/938 variables, 0/371 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 84/1022 variables, 14/385 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1022 variables, 0/385 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 84/1106 variables, 84/469 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1106 variables, 0/469 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 3/1109 variables, 2/471 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1109 variables, 1/472 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1110 variables, and 472 constraints, problems are : Problem set: 1 solved, 5 unsolved in 789 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 170/172 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 342/514 variables, 172/173 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 424/938 variables, 198/371 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/938 variables, 5/376 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/938 variables, 0/376 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 84/1022 variables, 14/390 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1022 variables, 0/390 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 84/1106 variables, 84/474 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1106 variables, 0/474 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 3/1109 variables, 2/476 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1109 variables, 1/477 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1109 variables, 0/477 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/1109 variables, 0/477 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1110 variables, and 477 constraints, problems are : Problem set: 1 solved, 5 unsolved in 632 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1437ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 110 steps, including 3 resets, run visited all 5 properties in 5 ms. (steps per millisecond=22 )
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 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 6 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1))), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 14 factoid took 362 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 287 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 290 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 270 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Product exploration explored 100000 steps with 4857 reset in 655 ms.
Product exploration explored 100000 steps with 4872 reset in 637 ms.
Support contains 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 681/681 transitions.
Applied a total of 0 rules in 23 ms. Remains 456 /456 variables (removed 0) and now considering 681/681 (removed 0) transitions.
[2024-05-31 19:25:22] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-31 19:25:22] [INFO ] Invariant cache hit.
[2024-05-31 19:25:22] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-31 19:25:22] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-31 19:25:22] [INFO ] Invariant cache hit.
[2024-05-31 19:25:22] [INFO ] Implicit Places using invariants and state equation in 399 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
[2024-05-31 19:25:22] [INFO ] Redundant transitions in 4 ms returned []
Running 299 sub problems to find dead transitions.
[2024-05-31 19:25:22] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-31 19:25:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 653/1109 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (OVERLAPS) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1110 variables, and 472 constraints, problems are : Problem set: 0 solved, 299 unsolved in 18899 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 653/1109 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1109 variables, 299/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1109 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (OVERLAPS) 0/1109 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1110 variables, and 771 constraints, problems are : Problem set: 0 solved, 299 unsolved in 23066 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
After SMT, in 42207ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 42210ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 42927 ms. Remains : 456/456 places, 681/681 transitions.
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-10 finished in 158724 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 U p1))))'
Support contains 3 out of 790 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Graph (trivial) has 743 edges and 790 vertex of which 85 / 790 are part of one of the 14 SCC in 1 ms
Free SCC test removed 71 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 718 transition count 896
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 639 transition count 896
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 159 place count 639 transition count 865
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 221 place count 608 transition count 865
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 272 place count 557 transition count 814
Iterating global reduction 2 with 51 rules applied. Total rules applied 323 place count 557 transition count 814
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 328 place count 557 transition count 809
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 328 place count 557 transition count 808
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 330 place count 556 transition count 808
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 339 place count 547 transition count 799
Iterating global reduction 3 with 9 rules applied. Total rules applied 348 place count 547 transition count 799
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 357 place count 547 transition count 790
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 0 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 527 place count 462 transition count 705
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 532 place count 457 transition count 700
Iterating global reduction 4 with 5 rules applied. Total rules applied 537 place count 457 transition count 700
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 542 place count 457 transition count 695
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 556 place count 457 transition count 681
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 558 place count 455 transition count 679
Applied a total of 558 rules in 131 ms. Remains 455 /790 variables (removed 335) and now considering 679/1048 (removed 369) transitions.
[2024-05-31 19:26:05] [INFO ] Flow matrix only has 653 transitions (discarded 26 similar events)
// Phase 1: matrix 653 rows 455 cols
[2024-05-31 19:26:05] [INFO ] Computed 16 invariants in 7 ms
[2024-05-31 19:26:05] [INFO ] Implicit Places using invariants in 445 ms returned []
[2024-05-31 19:26:05] [INFO ] Flow matrix only has 653 transitions (discarded 26 similar events)
[2024-05-31 19:26:05] [INFO ] Invariant cache hit.
[2024-05-31 19:26:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 19:26:06] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 865 ms to find 0 implicit places.
[2024-05-31 19:26:06] [INFO ] Redundant transitions in 4 ms returned []
Running 298 sub problems to find dead transitions.
[2024-05-31 19:26:06] [INFO ] Flow matrix only has 653 transitions (discarded 26 similar events)
[2024-05-31 19:26:06] [INFO ] Invariant cache hit.
[2024-05-31 19:26:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (OVERLAPS) 15/455 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 652/1107 variables, 455/471 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1107 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1107 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (OVERLAPS) 0/1107 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1107/1108 variables, and 472 constraints, problems are : Problem set: 0 solved, 298 unsolved in 19458 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 455/455 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (OVERLAPS) 15/455 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (OVERLAPS) 652/1107 variables, 455/471 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1107 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1107 variables, 298/770 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1107 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (OVERLAPS) 0/1107 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1107/1108 variables, and 770 constraints, problems are : Problem set: 0 solved, 298 unsolved in 25783 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 455/455 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 0/0 constraints]
After SMT, in 45556ms problems are : Problem set: 0 solved, 298 unsolved
Search for dead transitions found 0 dead transitions in 45560ms
Starting structural reductions in SI_LTL mode, iteration 1 : 455/790 places, 679/1048 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46571 ms. Remains : 455/790 places, 679/1048 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-14b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-12 finished in 46679 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((X(p0) U (p1||G((F(p3)||p2))))))'
Support contains 4 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 766 transition count 1024
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 766 transition count 1024
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 766 transition count 1019
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 70 place count 749 transition count 1002
Iterating global reduction 1 with 17 rules applied. Total rules applied 87 place count 749 transition count 1002
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 98 place count 749 transition count 991
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 104 place count 743 transition count 985
Iterating global reduction 2 with 6 rules applied. Total rules applied 110 place count 743 transition count 985
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 112 place count 743 transition count 983
Applied a total of 112 rules in 72 ms. Remains 743 /790 variables (removed 47) and now considering 983/1048 (removed 65) transitions.
// Phase 1: matrix 983 rows 743 cols
[2024-05-31 19:26:51] [INFO ] Computed 16 invariants in 14 ms
[2024-05-31 19:26:52] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-31 19:26:52] [INFO ] Invariant cache hit.
[2024-05-31 19:26:52] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 870 ms to find 0 implicit places.
Running 982 sub problems to find dead transitions.
[2024-05-31 19:26:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/742 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 982 unsolved
At refinement iteration 1 (OVERLAPS) 1/743 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 982 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 743/1726 variables, and 16 constraints, problems are : Problem set: 0 solved, 982 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/743 constraints, PredecessorRefiner: 982/982 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 982 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/742 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 982 unsolved
At refinement iteration 1 (OVERLAPS) 1/743 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 982 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/743 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 982 unsolved
At refinement iteration 3 (OVERLAPS) 983/1726 variables, 743/759 constraints. Problems are: Problem set: 0 solved, 982 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1726 variables, 982/1741 constraints. Problems are: Problem set: 0 solved, 982 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1726/1726 variables, and 1741 constraints, problems are : Problem set: 0 solved, 982 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 743/743 constraints, PredecessorRefiner: 982/982 constraints, Known Traps: 0/0 constraints]
After SMT, in 60931ms problems are : Problem set: 0 solved, 982 unsolved
Search for dead transitions found 0 dead transitions in 60941ms
Starting structural reductions in LTL mode, iteration 1 : 743/790 places, 983/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61886 ms. Remains : 743/790 places, 983/1048 transitions.
Stuttering acceptance computed with spot in 356 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p0)), (NOT p3), (AND (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-13
Product exploration explored 100000 steps with 991 reset in 225 ms.
Product exploration explored 100000 steps with 995 reset in 241 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p3 (NOT p0)), (X p2), (X p3), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 129 ms. Reduced automaton from 8 states, 18 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
RANDOM walk for 40000 steps (395 resets) in 122 ms. (325 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (40 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (40 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
[2024-05-31 19:27:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 267/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 473/743 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/743 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 983/1726 variables, 743/759 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1726 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/1726 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1726/1726 variables, and 759 constraints, problems are : Problem set: 0 solved, 2 unsolved in 368 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 743/743 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 267/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 473/743 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/743 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 983/1726 variables, 743/759 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1726 variables, 2/761 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1726 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1726 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1726/1726 variables, and 761 constraints, problems are : Problem set: 0 solved, 2 unsolved in 470 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 743/743 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 846ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 2053 steps, including 18 resets, run visited all 2 properties in 30 ms. (steps per millisecond=68 )
Parikh walk visited 2 properties in 31 ms.
Knowledge obtained : [(AND (NOT p1) p2 p3 (NOT p0)), (X p2), (X p3), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X p3)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (OR p2 p3))), (F (NOT p3))]
Knowledge based reduction with 19 factoid took 216 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Support contains 3 out of 743 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 743/743 places, 983/983 transitions.
Graph (trivial) has 690 edges and 743 vertex of which 79 / 743 are part of one of the 13 SCC in 0 ms
Free SCC test removed 66 places
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 676 transition count 849
Reduce places removed 66 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 67 rules applied. Total rules applied 134 place count 610 transition count 848
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 135 place count 609 transition count 848
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 135 place count 609 transition count 816
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 199 place count 577 transition count 816
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 224 place count 552 transition count 791
Iterating global reduction 3 with 25 rules applied. Total rules applied 249 place count 552 transition count 791
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 250 place count 551 transition count 790
Iterating global reduction 3 with 1 rules applied. Total rules applied 251 place count 551 transition count 790
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 3 with 174 rules applied. Total rules applied 425 place count 464 transition count 703
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 438 place count 464 transition count 690
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 439 place count 464 transition count 690
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 441 place count 462 transition count 688
Applied a total of 441 rules in 136 ms. Remains 462 /743 variables (removed 281) and now considering 688/983 (removed 295) transitions.
[2024-05-31 19:27:56] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
// Phase 1: matrix 663 rows 462 cols
[2024-05-31 19:27:56] [INFO ] Computed 16 invariants in 16 ms
[2024-05-31 19:27:56] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-31 19:27:56] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
[2024-05-31 19:27:56] [INFO ] Invariant cache hit.
[2024-05-31 19:27:56] [INFO ] Implicit Places using invariants and state equation in 383 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
[2024-05-31 19:27:56] [INFO ] Redundant transitions in 4 ms returned []
Running 319 sub problems to find dead transitions.
[2024-05-31 19:27:56] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
[2024-05-31 19:27:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/448 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (OVERLAPS) 14/462 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (OVERLAPS) 662/1124 variables, 462/478 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1124 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (OVERLAPS) 0/1124 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1124/1125 variables, and 478 constraints, problems are : Problem set: 0 solved, 319 unsolved in 20306 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 462/462 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 319 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/448 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (OVERLAPS) 14/462 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (OVERLAPS) 662/1124 variables, 462/478 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1124 variables, 319/797 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1124 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 7 (OVERLAPS) 0/1124 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1124/1125 variables, and 797 constraints, problems are : Problem set: 0 solved, 319 unsolved in 25428 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 462/462 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 0/0 constraints]
After SMT, in 45976ms problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 45981ms
Starting structural reductions in SI_LTL mode, iteration 1 : 462/743 places, 688/983 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46747 ms. Remains : 462/743 places, 688/983 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 p3), (X p3), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
RANDOM walk for 40000 steps (1948 resets) in 756 ms. (52 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (20 resets) in 24 ms. (1600 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (20 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
[2024-05-31 19:28:43] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
[2024-05-31 19:28:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 214/217 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 393/610 variables, 217/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/610 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 389/999 variables, 171/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/999 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/999 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 74/1073 variables, 12/404 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1073 variables, 23/427 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1073 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 51/1124 variables, 51/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1124 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1124 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1124/1125 variables, and 478 constraints, problems are : Problem set: 0 solved, 2 unsolved in 396 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 462/462 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 214/217 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 393/610 variables, 217/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/610 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/610 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 389/999 variables, 171/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/999 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/999 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/999 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 74/1073 variables, 12/406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1073 variables, 23/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1073 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 51/1124 variables, 51/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1124 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1124 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1124/1125 variables, and 480 constraints, problems are : Problem set: 0 solved, 2 unsolved in 344 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 462/462 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 745ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 48 steps, including 1 resets, run visited all 2 properties in 2 ms. (steps per millisecond=24 )
Parikh walk visited 2 properties in 2 ms.
Knowledge obtained : [(AND p2 p3), (X p3), (X (X p3))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (OR p2 p3))), (F (NOT p3))]
Knowledge based reduction with 3 factoid took 182 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Product exploration explored 100000 steps with 4789 reset in 590 ms.
Product exploration explored 100000 steps with 4784 reset in 625 ms.
Support contains 3 out of 462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 462/462 places, 688/688 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 462 transition count 687
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 461 transition count 687
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 460 transition count 686
Applied a total of 4 rules in 33 ms. Remains 460 /462 variables (removed 2) and now considering 686/688 (removed 2) transitions.
[2024-05-31 19:28:45] [INFO ] Flow matrix only has 660 transitions (discarded 26 similar events)
// Phase 1: matrix 660 rows 460 cols
[2024-05-31 19:28:45] [INFO ] Computed 16 invariants in 15 ms
[2024-05-31 19:28:46] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-31 19:28:46] [INFO ] Flow matrix only has 660 transitions (discarded 26 similar events)
[2024-05-31 19:28:46] [INFO ] Invariant cache hit.
[2024-05-31 19:28:46] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
[2024-05-31 19:28:46] [INFO ] Redundant transitions in 5 ms returned []
Running 317 sub problems to find dead transitions.
[2024-05-31 19:28:46] [INFO ] Flow matrix only has 660 transitions (discarded 26 similar events)
[2024-05-31 19:28:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (OVERLAPS) 14/460 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 659/1119 variables, 460/476 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1119 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (OVERLAPS) 0/1119 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 317 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1119/1120 variables, and 476 constraints, problems are : Problem set: 0 solved, 317 unsolved in 19551 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 460/460 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 317 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (OVERLAPS) 14/460 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 659/1119 variables, 460/476 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1119 variables, 317/793 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1119 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 7 (OVERLAPS) 0/1119 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 317 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1119/1120 variables, and 793 constraints, problems are : Problem set: 0 solved, 317 unsolved in 24444 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 460/460 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 0/0 constraints]
After SMT, in 44225ms problems are : Problem set: 0 solved, 317 unsolved
Search for dead transitions found 0 dead transitions in 44230ms
Starting structural reductions in SI_LTL mode, iteration 1 : 460/462 places, 686/688 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44919 ms. Remains : 460/462 places, 686/688 transitions.
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-13 finished in 158911 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&&X(X(G(p1)))))))'
Support contains 2 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 765 transition count 1023
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 765 transition count 1023
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 55 place count 765 transition count 1018
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 72 place count 748 transition count 1001
Iterating global reduction 1 with 17 rules applied. Total rules applied 89 place count 748 transition count 1001
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 100 place count 748 transition count 990
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 106 place count 742 transition count 984
Iterating global reduction 2 with 6 rules applied. Total rules applied 112 place count 742 transition count 984
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 114 place count 742 transition count 982
Applied a total of 114 rules in 66 ms. Remains 742 /790 variables (removed 48) and now considering 982/1048 (removed 66) transitions.
// Phase 1: matrix 982 rows 742 cols
[2024-05-31 19:29:30] [INFO ] Computed 16 invariants in 19 ms
[2024-05-31 19:29:31] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-31 19:29:31] [INFO ] Invariant cache hit.
[2024-05-31 19:29:31] [INFO ] Implicit Places using invariants and state equation in 619 ms returned []
Implicit Place search using SMT with State Equation took 885 ms to find 0 implicit places.
Running 981 sub problems to find dead transitions.
[2024-05-31 19:29:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 981 unsolved
At refinement iteration 1 (OVERLAPS) 1/742 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 981 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 742/1724 variables, and 16 constraints, problems are : Problem set: 0 solved, 981 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/742 constraints, PredecessorRefiner: 981/981 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 981 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 981 unsolved
At refinement iteration 1 (OVERLAPS) 1/742 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 981 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/742 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 981 unsolved
At refinement iteration 3 (OVERLAPS) 982/1724 variables, 742/758 constraints. Problems are: Problem set: 0 solved, 981 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1724 variables, 981/1739 constraints. Problems are: Problem set: 0 solved, 981 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1724/1724 variables, and 1739 constraints, problems are : Problem set: 0 solved, 981 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 742/742 constraints, PredecessorRefiner: 981/981 constraints, Known Traps: 0/0 constraints]
After SMT, in 60844ms problems are : Problem set: 0 solved, 981 unsolved
Search for dead transitions found 0 dead transitions in 60856ms
Starting structural reductions in LTL mode, iteration 1 : 742/790 places, 982/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61810 ms. Remains : 742/790 places, 982/1048 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-14b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-14 finished in 62020 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((X((X(p1)||p0))||G(p2))))'
Support contains 3 out of 790 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 766 transition count 1024
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 766 transition count 1024
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 766 transition count 1019
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 69 place count 750 transition count 1003
Iterating global reduction 1 with 16 rules applied. Total rules applied 85 place count 750 transition count 1003
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 95 place count 750 transition count 993
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 101 place count 744 transition count 987
Iterating global reduction 2 with 6 rules applied. Total rules applied 107 place count 744 transition count 987
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 110 place count 744 transition count 984
Applied a total of 110 rules in 73 ms. Remains 744 /790 variables (removed 46) and now considering 984/1048 (removed 64) transitions.
// Phase 1: matrix 984 rows 744 cols
[2024-05-31 19:30:32] [INFO ] Computed 16 invariants in 16 ms
[2024-05-31 19:30:33] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-31 19:30:33] [INFO ] Invariant cache hit.
[2024-05-31 19:30:33] [INFO ] Implicit Places using invariants and state equation in 583 ms returned []
Implicit Place search using SMT with State Equation took 858 ms to find 0 implicit places.
Running 983 sub problems to find dead transitions.
[2024-05-31 19:30:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 1 (OVERLAPS) 1/744 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 983 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 744/1728 variables, and 16 constraints, problems are : Problem set: 0 solved, 983 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/744 constraints, PredecessorRefiner: 983/983 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 983 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 1 (OVERLAPS) 1/744 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/744 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 3 (OVERLAPS) 984/1728 variables, 744/760 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1728 variables, 983/1743 constraints. Problems are: Problem set: 0 solved, 983 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1728/1728 variables, and 1743 constraints, problems are : Problem set: 0 solved, 983 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 983/983 constraints, Known Traps: 0/0 constraints]
After SMT, in 60813ms problems are : Problem set: 0 solved, 983 unsolved
Search for dead transitions found 0 dead transitions in 60823ms
Starting structural reductions in LTL mode, iteration 1 : 744/790 places, 984/1048 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61756 ms. Remains : 744/790 places, 984/1048 transitions.
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-15
Product exploration explored 100000 steps with 25137 reset in 186 ms.
Product exploration explored 100000 steps with 25025 reset in 182 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 130 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (396 resets) in 343 ms. (116 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (40 resets) in 32 ms. (1212 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (39 resets) in 97 ms. (408 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (39 resets) in 62 ms. (634 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (40 resets) in 125 ms. (317 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (40 resets) in 25 ms. (1538 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (38 resets) in 81 ms. (487 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (40 resets) in 47 ms. (833 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 174630 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 7
Probabilistic random walk after 174630 steps, saw 81259 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
[2024-05-31 19:31:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 267/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 19:31:39] [INFO ] Deduced a trap composed of 206 places in 102 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 474/744 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/744 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 984/1728 variables, 744/761 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1728 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/1728 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1728/1728 variables, and 761 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1132 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 267/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 474/744 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/744 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 984/1728 variables, 744/761 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1728 variables, 7/768 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1728 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/1728 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1728/1728 variables, and 768 constraints, problems are : Problem set: 0 solved, 7 unsolved in 927 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 2067ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Finished Parikh walk after 12888 steps, including 114 resets, run visited all 7 properties in 43 ms. (steps per millisecond=299 )
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 )
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 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 45 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p2) p1))), (F p2), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR p2 p1))), (F (NOT (AND (NOT p2) (NOT p0)))), (F p0)]
Knowledge based reduction with 9 factoid took 382 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 3 out of 744 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 744/744 places, 984/984 transitions.
Applied a total of 0 rules in 17 ms. Remains 744 /744 variables (removed 0) and now considering 984/984 (removed 0) transitions.
[2024-05-31 19:31:41] [INFO ] Invariant cache hit.
[2024-05-31 19:31:42] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-31 19:31:42] [INFO ] Invariant cache hit.
[2024-05-31 19:31:42] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
Running 983 sub problems to find dead transitions.
[2024-05-31 19:31:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 1 (OVERLAPS) 1/744 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 983 unsolved
(s12 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0timeout
)
(s13 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 744/1728 variables, and 16 constraints, problems are : Problem set: 0 solved, 983 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/744 constraints, PredecessorRefiner: 983/983 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 983 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 1 (OVERLAPS) 1/744 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/744 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 3 (OVERLAPS) 984/1728 variables, 744/760 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1728 variables, 983/1743 constraints. Problems are: Problem set: 0 solved, 983 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1728/1728 variables, and 1743 constraints, problems are : Problem set: 0 solved, 983 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 983/983 constraints, Known Traps: 0/0 constraints]
After SMT, in 60800ms problems are : Problem set: 0 solved, 983 unsolved
Search for dead transitions found 0 dead transitions in 60809ms
Finished structural reductions in LTL mode , in 1 iterations and 61661 ms. Remains : 744/744 places, 984/984 transitions.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 128 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
RANDOM walk for 40000 steps (396 resets) in 670 ms. (59 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (38 resets) in 132 ms. (300 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (38 resets) in 118 ms. (336 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (38 resets) in 119 ms. (333 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (39 resets) in 94 ms. (421 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (40 resets) in 113 ms. (350 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (39 resets) in 116 ms. (341 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (37 resets) in 61 ms. (645 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 215398 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 7
Probabilistic random walk after 215398 steps, saw 98455 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
[2024-05-31 19:32:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 267/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-31 19:32:47] [INFO ] Deduced a trap composed of 206 places in 96 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 474/744 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/744 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 984/1728 variables, 744/761 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1728 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/1728 variables, 0/761 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1728/1728 variables, and 761 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1118 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 267/270 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 474/744 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/744 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 984/1728 variables, 744/761 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1728 variables, 7/768 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1728 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/1728 variables, 0/768 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1728/1728 variables, and 768 constraints, problems are : Problem set: 0 solved, 7 unsolved in 870 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 1997ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Finished Parikh walk after 6968 steps, including 60 resets, run visited all 7 properties in 24 ms. (steps per millisecond=290 )
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 2 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 )
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 7 properties in 26 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p2) p1))), (F p2), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR p2 p1))), (F (NOT (AND (NOT p2) (NOT p0)))), (F p0)]
Knowledge based reduction with 9 factoid took 375 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Product exploration explored 100000 steps with 24942 reset in 185 ms.
Product exploration explored 100000 steps with 24982 reset in 187 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Support contains 3 out of 744 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 744/744 places, 984/984 transitions.
Graph (trivial) has 696 edges and 744 vertex of which 85 / 744 are part of one of the 14 SCC in 1 ms
Free SCC test removed 71 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 673 transition count 912
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 41 Pre rules applied. Total rules applied 56 place count 673 transition count 912
Deduced a syphon composed of 96 places in 0 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 97 place count 673 transition count 912
Discarding 66 places :
Symmetric choice reduction at 1 with 66 rule applications. Total rules 163 place count 607 transition count 846
Deduced a syphon composed of 57 places in 1 ms
Iterating global reduction 1 with 66 rules applied. Total rules applied 229 place count 607 transition count 846
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 230 place count 606 transition count 845
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 231 place count 606 transition count 845
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 133 places in 0 ms
Iterating global reduction 1 with 76 rules applied. Total rules applied 307 place count 606 transition count 873
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 339 place count 574 transition count 841
Deduced a syphon composed of 101 places in 0 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 371 place count 574 transition count 841
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 115 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 385 place count 574 transition count 869
Deduced a syphon composed of 115 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 1 with 28 rules applied. Total rules applied 413 place count 574 transition count 841
Deduced a syphon composed of 115 places in 0 ms
Applied a total of 413 rules in 192 ms. Remains 574 /744 variables (removed 170) and now considering 841/984 (removed 143) transitions.
[2024-05-31 19:32:51] [INFO ] Redundant transitions in 5 ms returned []
Running 840 sub problems to find dead transitions.
[2024-05-31 19:32:51] [INFO ] Flow matrix only has 814 transitions (discarded 27 similar events)
// Phase 1: matrix 814 rows 574 cols
[2024-05-31 19:32:51] [INFO ] Computed 16 invariants in 16 ms
[2024-05-31 19:32:51] [INFO ] State equation strengthened by 113 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/573 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 840 unsolved
At refinement iteration 1 (OVERLAPS) 1/574 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 840 unsolved
[2024-05-31 19:33:07] [INFO ] Deduced a trap composed of 173 places in 110 ms of which 3 ms to minimize.
Problem TDEAD113 is UNSAT
[2024-05-31 19:33:08] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
[2024-05-31 19:33:08] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
[2024-05-31 19:33:08] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
Problem TDEAD214 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
[2024-05-31 19:33:08] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
Problem TDEAD235 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
[2024-05-31 19:33:08] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
Problem TDEAD256 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
[2024-05-31 19:33:08] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
[2024-05-31 19:33:09] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
Problem TDEAD298 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
[2024-05-31 19:33:09] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
Problem TDEAD320 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
[2024-05-31 19:33:09] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
[2024-05-31 19:33:09] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
[2024-05-31 19:33:09] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
[2024-05-31 19:33:09] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
[2024-05-31 19:33:10] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
[2024-05-31 19:33:10] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
Problem TDEAD448 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
[2024-05-31 19:33:10] [INFO ] Deduced a trap composed of 189 places in 145 ms of which 3 ms to minimize.
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD712 is UNSAT
Problem TDEAD713 is UNSAT
Problem TDEAD714 is UNSAT
Problem TDEAD715 is UNSAT
Problem TDEAD716 is UNSAT
Problem TDEAD717 is UNSAT
Problem TDEAD718 is UNSAT
Problem TDEAD719 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD722 is UNSAT
Problem TDEAD723 is UNSAT
Problem TDEAD724 is UNSAT
Problem TDEAD725 is UNSAT
[2024-05-31 19:33:12] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 3 ms to minimize.
Problem TDEAD754 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD838 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/574 variables, 17/33 constraints. Problems are: Problem set: 157 solved, 683 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/574 variables, 0/33 constraints. Problems are: Problem set: 157 solved, 683 unsolved
SMT process timed out in 31316ms, After SMT, problems are : Problem set: 157 solved, 683 unsolved
Search for dead transitions found 157 dead transitions in 31326ms
Found 157 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 157 transitions
Dead transitions reduction (with SMT) removed 157 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 574/744 places, 684/984 transitions.
Graph (complete) has 1947 edges and 574 vertex of which 459 are kept as prefixes of interest. Removing 115 places using SCC suffix rule.2 ms
Discarding 115 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 32 ms. Remains 459 /574 variables (removed 115) and now considering 684/684 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 459/744 places, 684/984 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31568 ms. Remains : 459/744 places, 684/984 transitions.
Support contains 3 out of 744 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 744/744 places, 984/984 transitions.
Applied a total of 0 rules in 12 ms. Remains 744 /744 variables (removed 0) and now considering 984/984 (removed 0) transitions.
// Phase 1: matrix 984 rows 744 cols
[2024-05-31 19:33:23] [INFO ] Computed 16 invariants in 13 ms
[2024-05-31 19:33:23] [INFO ] Implicit Places using invariants in 273 ms returned []
[2024-05-31 19:33:23] [INFO ] Invariant cache hit.
[2024-05-31 19:33:23] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 812 ms to find 0 implicit places.
Running 983 sub problems to find dead transitions.
[2024-05-31 19:33:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 1 (OVERLAPS) 1/744 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 983 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 744/1728 variables, and 16 constraints, problems are : Problem set: 0 solved, 983 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 0/744 constraints, PredecessorRefiner: 983/983 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 983 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 1 (OVERLAPS) 1/744 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/744 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 3 (OVERLAPS) 984/1728 variables, 744/760 constraints. Problems are: Problem set: 0 solved, 983 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1728 variables, 983/1743 constraints. Problems are: Problem set: 0 solved, 983 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1728/1728 variables, and 1743 constraints, problems are : Problem set: 0 solved, 983 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 744/744 constraints, PredecessorRefiner: 983/983 constraints, Known Traps: 0/0 constraints]
After SMT, in 60794ms problems are : Problem set: 0 solved, 983 unsolved
Search for dead transitions found 0 dead transitions in 60804ms
Finished structural reductions in LTL mode , in 1 iterations and 61630 ms. Remains : 744/744 places, 984/984 transitions.
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-15 finished in 231966 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((p0&&X(F(p1))))||G(p0)))'
Found a Shortening insensitive property : FlexibleBarrier-PT-14b-LTLFireability-10
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 790 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Graph (trivial) has 744 edges and 790 vertex of which 85 / 790 are part of one of the 14 SCC in 1 ms
Free SCC test removed 71 places
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 80 place count 718 transition count 896
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 159 place count 639 transition count 896
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 159 place count 639 transition count 864
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 223 place count 607 transition count 864
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 273 place count 557 transition count 814
Iterating global reduction 2 with 50 rules applied. Total rules applied 323 place count 557 transition count 814
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 328 place count 557 transition count 809
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 328 place count 557 transition count 808
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 330 place count 556 transition count 808
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 338 place count 548 transition count 800
Iterating global reduction 3 with 8 rules applied. Total rules applied 346 place count 548 transition count 800
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 354 place count 548 transition count 792
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 4 with 170 rules applied. Total rules applied 524 place count 463 transition count 707
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 529 place count 458 transition count 702
Iterating global reduction 4 with 5 rules applied. Total rules applied 534 place count 458 transition count 702
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 539 place count 458 transition count 697
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 553 place count 458 transition count 683
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 555 place count 456 transition count 681
Applied a total of 555 rules in 99 ms. Remains 456 /790 variables (removed 334) and now considering 681/1048 (removed 367) transitions.
[2024-05-31 19:34:25] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
// Phase 1: matrix 654 rows 456 cols
[2024-05-31 19:34:25] [INFO ] Computed 16 invariants in 13 ms
[2024-05-31 19:34:25] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-31 19:34:25] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-31 19:34:25] [INFO ] Invariant cache hit.
[2024-05-31 19:34:25] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
Running 299 sub problems to find dead transitions.
[2024-05-31 19:34:25] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-31 19:34:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 653/1109 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (OVERLAPS) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1110 variables, and 472 constraints, problems are : Problem set: 0 solved, 299 unsolved in 18919 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 653/1109 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1109 variables, 299/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1109 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (OVERLAPS) 0/1109 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1110 variables, and 771 constraints, problems are : Problem set: 0 solved, 299 unsolved in 22975 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
After SMT, in 42139ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 42142ms
Starting structural reductions in LI_LTL mode, iteration 1 : 456/790 places, 681/1048 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 42876 ms. Remains : 456/790 places, 681/1048 transitions.
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-10
Product exploration explored 100000 steps with 4882 reset in 662 ms.
Product exploration explored 100000 steps with 4890 reset in 670 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 p0 (NOT p1)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 122 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (2016 resets) in 679 ms. (58 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 23 ms. (1666 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (16 resets) in 24 ms. (1600 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (16 resets) in 20 ms. (1904 steps per ms) remains 3/3 properties
[2024-05-31 19:35:09] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-31 19:35:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 170/172 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 342/514 variables, 172/173 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 424/938 variables, 198/371 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/938 variables, 0/371 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 84/1022 variables, 14/385 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1022 variables, 0/385 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 84/1106 variables, 84/469 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1106 variables, 0/469 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 3/1109 variables, 2/471 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1109 variables, 1/472 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1110 variables, and 472 constraints, problems are : Problem set: 1 solved, 2 unsolved in 314 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 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/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 170/172 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 342/514 variables, 172/173 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 424/938 variables, 198/371 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/938 variables, 2/373 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/938 variables, 0/373 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 84/1022 variables, 14/387 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1022 variables, 0/387 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 84/1106 variables, 84/471 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1106 variables, 0/471 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3/1109 variables, 2/473 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1109 variables, 1/474 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1109 variables, 0/474 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1109 variables, 0/474 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1110 variables, and 474 constraints, problems are : Problem set: 1 solved, 2 unsolved in 357 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 687ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 10 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=10 )
Parikh walk visited 2 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (OR (NOT p1) p0))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F (NOT p0)), (F p1), (F (NOT (OR p1 p0))), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 10 factoid took 244 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 248 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 330 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Support contains 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 681/681 transitions.
Applied a total of 0 rules in 28 ms. Remains 456 /456 variables (removed 0) and now considering 681/681 (removed 0) transitions.
[2024-05-31 19:35:11] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-31 19:35:11] [INFO ] Invariant cache hit.
[2024-05-31 19:35:11] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-31 19:35:11] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-31 19:35:11] [INFO ] Invariant cache hit.
[2024-05-31 19:35:12] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
[2024-05-31 19:35:12] [INFO ] Redundant transitions in 4 ms returned []
Running 299 sub problems to find dead transitions.
[2024-05-31 19:35:12] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-31 19:35:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 653/1109 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (OVERLAPS) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1110 variables, and 472 constraints, problems are : Problem set: 0 solved, 299 unsolved in 18699 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 653/1109 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1109 variables, 299/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1109 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (OVERLAPS) 0/1109 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1110 variables, and 771 constraints, problems are : Problem set: 0 solved, 299 unsolved in 23684 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
After SMT, in 42640ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 42644ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 43311 ms. Remains : 456/456 places, 681/681 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 (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 134 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 250 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), false, false]
RANDOM walk for 40000 steps (2002 resets) in 1165 ms. (34 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (17 resets) in 26 ms. (1481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 29 ms. (1333 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (17 resets) in 24 ms. (1600 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (17 resets) in 25 ms. (1538 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 23 ms. (1666 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (18 resets) in 22 ms. (1739 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 370579 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 6
Probabilistic random walk after 370579 steps, saw 89394 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
[2024-05-31 19:35:58] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-31 19:35:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 170/172 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 342/514 variables, 172/173 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 424/938 variables, 198/371 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/938 variables, 0/371 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 84/1022 variables, 14/385 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-31 19:35:59] [INFO ] Deduced a trap composed of 189 places in 130 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1022 variables, 1/386 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1022 variables, 0/386 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 84/1106 variables, 84/470 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1106 variables, 0/470 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 3/1109 variables, 2/472 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1109 variables, 1/473 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1109 variables, 0/473 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/1109 variables, 0/473 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1110 variables, and 473 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1047 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 170/172 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 342/514 variables, 172/173 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/514 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 424/938 variables, 198/371 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/938 variables, 5/376 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/938 variables, 0/376 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 84/1022 variables, 14/390 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1022 variables, 1/391 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1022 variables, 0/391 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 84/1106 variables, 84/475 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1106 variables, 0/475 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 3/1109 variables, 2/477 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1109 variables, 1/478 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1109 variables, 0/478 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/1109 variables, 0/478 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1110 variables, and 478 constraints, problems are : Problem set: 1 solved, 5 unsolved in 649 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 1702ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 26 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=13 )
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 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 2 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p1)), (X (AND (NOT p1) p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (AND (NOT p1) p0))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p1))), (F p1), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 14 factoid took 372 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 280 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 275 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Stuttering acceptance computed with spot in 273 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false, false]
Product exploration explored 100000 steps with 4890 reset in 634 ms.
Product exploration explored 100000 steps with 4917 reset in 658 ms.
Support contains 2 out of 456 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 456/456 places, 681/681 transitions.
Applied a total of 0 rules in 23 ms. Remains 456 /456 variables (removed 0) and now considering 681/681 (removed 0) transitions.
[2024-05-31 19:36:02] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-31 19:36:02] [INFO ] Invariant cache hit.
[2024-05-31 19:36:03] [INFO ] Implicit Places using invariants in 223 ms returned []
[2024-05-31 19:36:03] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-31 19:36:03] [INFO ] Invariant cache hit.
[2024-05-31 19:36:03] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
[2024-05-31 19:36:03] [INFO ] Redundant transitions in 3 ms returned []
Running 299 sub problems to find dead transitions.
[2024-05-31 19:36:03] [INFO ] Flow matrix only has 654 transitions (discarded 27 similar events)
[2024-05-31 19:36:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 653/1109 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (OVERLAPS) 0/1109 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1110 variables, and 472 constraints, problems are : Problem set: 0 solved, 299 unsolved in 18905 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 299 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/442 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/442 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 2 (OVERLAPS) 14/456 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 4 (OVERLAPS) 653/1109 variables, 456/472 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1109 variables, 299/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1109 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
At refinement iteration 7 (OVERLAPS) 0/1109 variables, 0/771 constraints. Problems are: Problem set: 0 solved, 299 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1110 variables, and 771 constraints, problems are : Problem set: 0 solved, 299 unsolved in 22554 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 456/456 constraints, PredecessorRefiner: 299/299 constraints, Known Traps: 0/0 constraints]
After SMT, in 41724ms problems are : Problem set: 0 solved, 299 unsolved
Search for dead transitions found 0 dead transitions in 41728ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 42370 ms. Remains : 456/456 places, 681/681 transitions.
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-10 finished in 140559 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((X(p0) U (p1||G((F(p3)||p2))))))'
Found a Lengthening insensitive property : FlexibleBarrier-PT-14b-LTLFireability-13
Stuttering acceptance computed with spot in 313 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p0)), (NOT p3), (AND (NOT p3) (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Support contains 4 out of 790 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 790/790 places, 1048/1048 transitions.
Graph (trivial) has 737 edges and 790 vertex of which 79 / 790 are part of one of the 13 SCC in 1 ms
Free SCC test removed 66 places
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 723 transition count 905
Reduce places removed 75 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 76 rules applied. Total rules applied 152 place count 648 transition count 904
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 153 place count 647 transition count 904
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 153 place count 647 transition count 871
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 219 place count 614 transition count 871
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 267 place count 566 transition count 823
Iterating global reduction 3 with 48 rules applied. Total rules applied 315 place count 566 transition count 823
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 320 place count 566 transition count 818
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 320 place count 566 transition count 816
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 324 place count 564 transition count 816
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 334 place count 554 transition count 806
Iterating global reduction 4 with 10 rules applied. Total rules applied 344 place count 554 transition count 806
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 353 place count 554 transition count 797
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 5 with 172 rules applied. Total rules applied 525 place count 468 transition count 711
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 529 place count 464 transition count 707
Iterating global reduction 5 with 4 rules applied. Total rules applied 533 place count 464 transition count 707
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 537 place count 464 transition count 703
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 550 place count 464 transition count 690
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 551 place count 464 transition count 690
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 553 place count 462 transition count 688
Applied a total of 553 rules in 122 ms. Remains 462 /790 variables (removed 328) and now considering 688/1048 (removed 360) transitions.
[2024-05-31 19:36:45] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
// Phase 1: matrix 663 rows 462 cols
[2024-05-31 19:36:45] [INFO ] Computed 16 invariants in 14 ms
[2024-05-31 19:36:46] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-31 19:36:46] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
[2024-05-31 19:36:46] [INFO ] Invariant cache hit.
[2024-05-31 19:36:46] [INFO ] Implicit Places using invariants and state equation in 416 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
Running 319 sub problems to find dead transitions.
[2024-05-31 19:36:46] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
[2024-05-31 19:36:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/448 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (OVERLAPS) 14/462 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (OVERLAPS) 662/1124 variables, 462/478 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1124 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (OVERLAPS) 0/1124 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1124/1125 variables, and 478 constraints, problems are : Problem set: 0 solved, 319 unsolved in 19785 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 462/462 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 319 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/448 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (OVERLAPS) 14/462 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (OVERLAPS) 662/1124 variables, 462/478 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1124 variables, 319/797 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-31 19:37:13] [INFO ] Deduced a trap composed of 189 places in 178 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1124 variables, 1/798 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1124 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 8 (OVERLAPS) 0/1124 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1124/1125 variables, and 798 constraints, problems are : Problem set: 0 solved, 319 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 462/462 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 1/1 constraints]
After SMT, in 50058ms problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 50062ms
Starting structural reductions in LI_LTL mode, iteration 1 : 462/790 places, 688/1048 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 50828 ms. Remains : 462/790 places, 688/1048 transitions.
Running random walk in product with property : FlexibleBarrier-PT-14b-LTLFireability-13
Product exploration explored 100000 steps with 4799 reset in 602 ms.
Product exploration explored 100000 steps with 4789 reset in 622 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 (NOT p1) p2 p3 (NOT p0)), (X p2), (X p3), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X p3)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 18 factoid took 193 ms. Reduced automaton from 8 states, 18 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
RANDOM walk for 40000 steps (1957 resets) in 650 ms. (61 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (19 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (19 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
[2024-05-31 19:37:38] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
[2024-05-31 19:37:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 214/217 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 393/610 variables, 217/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/610 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 389/999 variables, 171/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/999 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/999 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 74/1073 variables, 12/404 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1073 variables, 23/427 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1073 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 51/1124 variables, 51/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1124 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1124 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1124/1125 variables, and 478 constraints, problems are : Problem set: 0 solved, 2 unsolved in 393 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 462/462 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 214/217 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 393/610 variables, 217/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/610 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/610 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 389/999 variables, 171/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/999 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/999 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/999 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 74/1073 variables, 12/406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1073 variables, 23/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1073 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 51/1124 variables, 51/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1124 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1124 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1124/1125 variables, and 480 constraints, problems are : Problem set: 0 solved, 2 unsolved in 349 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 462/462 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 752ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 60 steps, including 2 resets, run visited all 2 properties in 2 ms. (steps per millisecond=30 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) p2 p3 (NOT p0)), (X p2), (X p3), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X p3)), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT p2)), (F (NOT (OR p2 p3))), (F (NOT p3))]
Knowledge based reduction with 18 factoid took 277 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Support contains 3 out of 462 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 462/462 places, 688/688 transitions.
Applied a total of 0 rules in 27 ms. Remains 462 /462 variables (removed 0) and now considering 688/688 (removed 0) transitions.
[2024-05-31 19:37:39] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
[2024-05-31 19:37:39] [INFO ] Invariant cache hit.
[2024-05-31 19:37:39] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-05-31 19:37:39] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
[2024-05-31 19:37:39] [INFO ] Invariant cache hit.
[2024-05-31 19:37:40] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 666 ms to find 0 implicit places.
[2024-05-31 19:37:40] [INFO ] Redundant transitions in 4 ms returned []
Running 319 sub problems to find dead transitions.
[2024-05-31 19:37:40] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
[2024-05-31 19:37:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/448 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (OVERLAPS) 14/462 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (OVERLAPS) 662/1124 variables, 462/478 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1124 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 6 (OVERLAPS) 0/1124 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1124/1125 variables, and 478 constraints, problems are : Problem set: 0 solved, 319 unsolved in 20756 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 462/462 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 319 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/448 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 2 (OVERLAPS) 14/462 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 4 (OVERLAPS) 662/1124 variables, 462/478 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1124 variables, 319/797 constraints. Problems are: Problem set: 0 solved, 319 unsolved
[2024-05-31 19:38:07] [INFO ] Deduced a trap composed of 189 places in 128 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1124 variables, 1/798 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1124 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 319 unsolved
At refinement iteration 8 (OVERLAPS) 0/1124 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 319 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1124/1125 variables, and 798 constraints, problems are : Problem set: 0 solved, 319 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 462/462 constraints, PredecessorRefiner: 319/319 constraints, Known Traps: 1/1 constraints]
After SMT, in 51011ms problems are : Problem set: 0 solved, 319 unsolved
Search for dead transitions found 0 dead transitions in 51016ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 51729 ms. Remains : 462/462 places, 688/688 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 p3), (X p3), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
RANDOM walk for 40000 steps (1947 resets) in 941 ms. (42 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (20 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (19 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
[2024-05-31 19:38:32] [INFO ] Flow matrix only has 663 transitions (discarded 25 similar events)
[2024-05-31 19:38:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 214/217 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 393/610 variables, 217/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/610 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 389/999 variables, 171/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/999 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/999 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 74/1073 variables, 12/404 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1073 variables, 23/427 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1073 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 51/1124 variables, 51/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1124 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1124 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1124/1125 variables, and 478 constraints, problems are : Problem set: 0 solved, 2 unsolved in 549 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 462/462 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 214/217 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/217 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 393/610 variables, 217/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/610 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/610 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 389/999 variables, 171/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/999 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/999 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/999 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 74/1073 variables, 12/406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1073 variables, 23/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1073 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 51/1124 variables, 51/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1124 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1124 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1124/1125 variables, and 480 constraints, problems are : Problem set: 0 solved, 2 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 462/462 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 923ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 60 steps, including 2 resets, run visited all 2 properties in 1 ms. (steps per millisecond=60 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p2 p3), (X p3), (X (X p3))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (OR p2 p3))), (F (NOT p3))]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p2) (NOT p3)), (NOT p3)]
Product exploration explored 100000 steps with 4797 reset in 608 ms.
Product exploration explored 100000 steps with 4784 reset in 616 ms.
Support contains 3 out of 462 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 462/462 places, 688/688 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 462 transition count 687
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 461 transition count 687
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 460 transition count 686
Applied a total of 4 rules in 31 ms. Remains 460 /462 variables (removed 2) and now considering 686/688 (removed 2) transitions.
[2024-05-31 19:38:34] [INFO ] Flow matrix only has 660 transitions (discarded 26 similar events)
// Phase 1: matrix 660 rows 460 cols
[2024-05-31 19:38:34] [INFO ] Computed 16 invariants in 12 ms
[2024-05-31 19:38:34] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-31 19:38:34] [INFO ] Flow matrix only has 660 transitions (discarded 26 similar events)
[2024-05-31 19:38:34] [INFO ] Invariant cache hit.
[2024-05-31 19:38:35] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 648 ms to find 0 implicit places.
[2024-05-31 19:38:35] [INFO ] Redundant transitions in 4 ms returned []
Running 317 sub problems to find dead transitions.
[2024-05-31 19:38:35] [INFO ] Flow matrix only has 660 transitions (discarded 26 similar events)
[2024-05-31 19:38:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (OVERLAPS) 14/460 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 659/1119 variables, 460/476 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1119 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (OVERLAPS) 0/1119 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 317 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1119/1120 variables, and 476 constraints, problems are : Problem set: 0 solved, 317 unsolved in 20155 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 460/460 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 317 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/446 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/446 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 2 (OVERLAPS) 14/460 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/460 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 4 (OVERLAPS) 659/1119 variables, 460/476 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1119 variables, 317/793 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1119 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 7 (OVERLAPS) 0/1119 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 317 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1119/1120 variables, and 793 constraints, problems are : Problem set: 0 solved, 317 unsolved in 24680 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 460/460 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 0/0 constraints]
After SMT, in 45100ms problems are : Problem set: 0 solved, 317 unsolved
Search for dead transitions found 0 dead transitions in 45103ms
Starting structural reductions in SI_LTL mode, iteration 1 : 460/462 places, 686/688 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 45794 ms. Remains : 460/462 places, 686/688 transitions.
Treatment of property FlexibleBarrier-PT-14b-LTLFireability-13 finished in 155074 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((X((X(p1)||p0))||G(p2))))'
[2024-05-31 19:39:20] [INFO ] Flatten gal took : 42 ms
[2024-05-31 19:39:20] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-31 19:39:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 790 places, 1048 transitions and 3063 arcs took 19 ms.
Total runtime 1514201 ms.
There are residual formulas that ITS could not solve within timeout

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024

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-14b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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