Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 972K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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 4.2K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Apr 22 14:45 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 13K Apr 13 08:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 13 08:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 13 08:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 08:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 536K 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-12b-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-12b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716420172123

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-12b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 23:22:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 23:22:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:22:53] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2024-05-22 23:22:53] [INFO ] Transformed 1988 places.
[2024-05-22 23:22:53] [INFO ] Transformed 2289 transitions.
[2024-05-22 23:22:53] [INFO ] Found NUPN structural information;
[2024-05-22 23:22:53] [INFO ] Parsed PT model containing 1988 places and 2289 transitions and 5727 arcs in 260 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-12b-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 1988 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1988/1988 places, 2289/2289 transitions.
Discarding 782 places :
Symmetric choice reduction at 0 with 782 rule applications. Total rules 782 place count 1206 transition count 1507
Iterating global reduction 0 with 782 rules applied. Total rules applied 1564 place count 1206 transition count 1507
Discarding 353 places :
Symmetric choice reduction at 0 with 353 rule applications. Total rules 1917 place count 853 transition count 1154
Iterating global reduction 0 with 353 rules applied. Total rules applied 2270 place count 853 transition count 1154
Discarding 220 places :
Symmetric choice reduction at 0 with 220 rule applications. Total rules 2490 place count 633 transition count 934
Iterating global reduction 0 with 220 rules applied. Total rules applied 2710 place count 633 transition count 934
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Iterating post reduction 0 with 104 rules applied. Total rules applied 2814 place count 633 transition count 830
Applied a total of 2814 rules in 387 ms. Remains 633 /1988 variables (removed 1355) and now considering 830/2289 (removed 1459) transitions.
// Phase 1: matrix 830 rows 633 cols
[2024-05-22 23:22:54] [INFO ] Computed 14 invariants in 31 ms
[2024-05-22 23:22:54] [INFO ] Implicit Places using invariants in 453 ms returned []
[2024-05-22 23:22:54] [INFO ] Invariant cache hit.
[2024-05-22 23:22:55] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 926 ms to find 0 implicit places.
Running 829 sub problems to find dead transitions.
[2024-05-22 23:22:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 829 unsolved
At refinement iteration 1 (OVERLAPS) 1/633 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 829 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/633 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 829 unsolved
At refinement iteration 3 (OVERLAPS) 830/1463 variables, 633/647 constraints. Problems are: Problem set: 0 solved, 829 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1463/1463 variables, and 647 constraints, problems are : Problem set: 0 solved, 829 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 633/633 constraints, PredecessorRefiner: 829/829 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 829 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 829 unsolved
At refinement iteration 1 (OVERLAPS) 1/633 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 829 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/633 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 829 unsolved
At refinement iteration 3 (OVERLAPS) 830/1463 variables, 633/647 constraints. Problems are: Problem set: 0 solved, 829 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1463 variables, 829/1476 constraints. Problems are: Problem set: 0 solved, 829 unsolved
[2024-05-22 23:23:47] [INFO ] Deduced a trap composed of 175 places in 208 ms of which 29 ms to minimize.
[2024-05-22 23:23:47] [INFO ] Deduced a trap composed of 167 places in 172 ms of which 4 ms to minimize.
[2024-05-22 23:23:48] [INFO ] Deduced a trap composed of 167 places in 176 ms of which 4 ms to minimize.
[2024-05-22 23:23:49] [INFO ] Deduced a trap composed of 168 places in 169 ms of which 3 ms to minimize.
[2024-05-22 23:23:50] [INFO ] Deduced a trap composed of 168 places in 149 ms of which 3 ms to minimize.
[2024-05-22 23:23:52] [INFO ] Deduced a trap composed of 101 places in 193 ms of which 4 ms to minimize.
[2024-05-22 23:23:53] [INFO ] Deduced a trap composed of 105 places in 197 ms of which 3 ms to minimize.
[2024-05-22 23:23:54] [INFO ] Deduced a trap composed of 195 places in 201 ms of which 4 ms to minimize.
[2024-05-22 23:23:54] [INFO ] Deduced a trap composed of 170 places in 194 ms of which 4 ms to minimize.
[2024-05-22 23:23:55] [INFO ] Deduced a trap composed of 106 places in 197 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1463/1463 variables, and 1486 constraints, problems are : Problem set: 0 solved, 829 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 633/633 constraints, PredecessorRefiner: 829/829 constraints, Known Traps: 10/10 constraints]
After SMT, in 60678ms problems are : Problem set: 0 solved, 829 unsolved
Search for dead transitions found 0 dead transitions in 60701ms
Starting structural reductions in LTL mode, iteration 1 : 633/1988 places, 830/2289 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62035 ms. Remains : 633/1988 places, 830/2289 transitions.
Support contains 43 out of 633 places after structural reductions.
[2024-05-22 23:23:55] [INFO ] Flatten gal took : 76 ms
[2024-05-22 23:23:56] [INFO ] Flatten gal took : 47 ms
[2024-05-22 23:23:56] [INFO ] Input system was already deterministic with 830 transitions.
Reduction of identical properties reduced properties to check from 30 to 29
RANDOM walk for 40000 steps (454 resets) in 2209 ms. (18 steps per ms) remains 18/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
[2024-05-22 23:23:56] [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, 18 unsolved
At refinement iteration 1 (OVERLAPS) 524/555 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/555 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 78/633 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/633 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 830/1463 variables, 633/647 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1463 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/1463 variables, 0/647 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1463/1463 variables, and 647 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1215 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 633/633 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Problem AtomicPropp24 is UNSAT
At refinement iteration 1 (OVERLAPS) 524/555 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 17 unsolved
[2024-05-22 23:23:58] [INFO ] Deduced a trap composed of 167 places in 147 ms of which 4 ms to minimize.
[2024-05-22 23:23:58] [INFO ] Deduced a trap composed of 168 places in 150 ms of which 3 ms to minimize.
[2024-05-22 23:23:58] [INFO ] Deduced a trap composed of 170 places in 138 ms of which 3 ms to minimize.
[2024-05-22 23:23:59] [INFO ] Deduced a trap composed of 168 places in 151 ms of which 3 ms to minimize.
[2024-05-22 23:23:59] [INFO ] Deduced a trap composed of 167 places in 131 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/555 variables, 5/16 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/555 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 78/633 variables, 3/19 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/633 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 830/1463 variables, 633/652 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1463 variables, 17/669 constraints. Problems are: Problem set: 1 solved, 17 unsolved
[2024-05-22 23:24:00] [INFO ] Deduced a trap composed of 85 places in 156 ms of which 3 ms to minimize.
[2024-05-22 23:24:00] [INFO ] Deduced a trap composed of 142 places in 117 ms of which 3 ms to minimize.
[2024-05-22 23:24:00] [INFO ] Deduced a trap composed of 127 places in 77 ms of which 2 ms to minimize.
[2024-05-22 23:24:00] [INFO ] Deduced a trap composed of 145 places in 99 ms of which 3 ms to minimize.
[2024-05-22 23:24:00] [INFO ] Deduced a trap composed of 233 places in 169 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1463 variables, 5/674 constraints. Problems are: Problem set: 1 solved, 17 unsolved
[2024-05-22 23:24:01] [INFO ] Deduced a trap composed of 258 places in 178 ms of which 3 ms to minimize.
[2024-05-22 23:24:01] [INFO ] Deduced a trap composed of 236 places in 171 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1463 variables, 2/676 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1463 variables, 0/676 constraints. Problems are: Problem set: 1 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 0/1463 variables, 0/676 constraints. Problems are: Problem set: 1 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1463/1463 variables, and 676 constraints, problems are : Problem set: 1 solved, 17 unsolved in 4890 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 633/633 constraints, PredecessorRefiner: 17/18 constraints, Known Traps: 12/12 constraints]
After SMT, in 6119ms problems are : Problem set: 1 solved, 17 unsolved
Parikh walk visited 15 properties in 5019 ms.
Support contains 6 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 830/830 transitions.
Graph (trivial) has 586 edges and 633 vertex of which 67 / 633 are part of one of the 11 SCC in 4 ms
Free SCC test removed 56 places
Drop transitions (Empty/Sink Transition effects.) removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 577 transition count 698
Reduce places removed 64 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 513 transition count 697
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 131 place count 512 transition count 697
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 131 place count 512 transition count 666
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 193 place count 481 transition count 666
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 234 place count 440 transition count 625
Iterating global reduction 3 with 41 rules applied. Total rules applied 275 place count 440 transition count 625
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 278 place count 440 transition count 622
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 278 place count 440 transition count 621
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 280 place count 439 transition count 621
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 289 place count 430 transition count 612
Iterating global reduction 4 with 9 rules applied. Total rules applied 298 place count 430 transition count 612
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 307 place count 430 transition count 603
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 5 with 156 rules applied. Total rules applied 463 place count 352 transition count 525
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 5 with 23 rules applied. Total rules applied 486 place count 352 transition count 502
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 501 place count 337 transition count 487
Iterating global reduction 6 with 15 rules applied. Total rules applied 516 place count 337 transition count 487
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 519 place count 337 transition count 484
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 7 with 2 rules applied. Total rules applied 521 place count 336 transition count 484
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 523 place count 336 transition count 482
Free-agglomeration rule applied 264 times.
Iterating global reduction 7 with 264 rules applied. Total rules applied 787 place count 336 transition count 218
Reduce places removed 264 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Iterating post reduction 7 with 354 rules applied. Total rules applied 1141 place count 72 transition count 128
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 1149 place count 72 transition count 120
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1150 place count 72 transition count 120
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1151 place count 71 transition count 119
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 60 edges and 70 vertex of which 22 / 70 are part of one of the 11 SCC in 0 ms
Free SCC test removed 11 places
Iterating post reduction 8 with 2 rules applied. Total rules applied 1153 place count 59 transition count 119
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 1175 place count 59 transition count 97
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 12 Pre rules applied. Total rules applied 1175 place count 59 transition count 85
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 10 with 24 rules applied. Total rules applied 1199 place count 47 transition count 85
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 10 with 12 rules applied. Total rules applied 1211 place count 47 transition count 73
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 11 with 26 rules applied. Total rules applied 1237 place count 34 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 1238 place count 34 transition count 59
Free-agglomeration rule applied 12 times.
Iterating global reduction 11 with 12 rules applied. Total rules applied 1250 place count 34 transition count 47
Reduce places removed 20 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 11 with 45 rules applied. Total rules applied 1295 place count 14 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 12 with 5 rules applied. Total rules applied 1300 place count 14 transition count 17
Applied a total of 1300 rules in 340 ms. Remains 14 /633 variables (removed 619) and now considering 17/830 (removed 813) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 341 ms. Remains : 14/633 places, 17/830 transitions.
RANDOM walk for 435 steps (0 resets) in 6 ms. (62 steps per ms) remains 0/2 properties
FORMULA FlexibleBarrier-PT-12b-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 15 stabilizing places and 15 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&(G(p1)||X(G((X(p0)&&p2))))))'
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 830/830 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 610 transition count 807
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 610 transition count 807
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 610 transition count 804
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 66 place count 593 transition count 787
Iterating global reduction 1 with 17 rules applied. Total rules applied 83 place count 593 transition count 787
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 93 place count 593 transition count 777
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 97 place count 589 transition count 773
Iterating global reduction 2 with 4 rules applied. Total rules applied 101 place count 589 transition count 773
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 589 transition count 771
Applied a total of 103 rules in 46 ms. Remains 589 /633 variables (removed 44) and now considering 771/830 (removed 59) transitions.
// Phase 1: matrix 771 rows 589 cols
[2024-05-22 23:24:08] [INFO ] Computed 14 invariants in 14 ms
[2024-05-22 23:24:09] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-22 23:24:09] [INFO ] Invariant cache hit.
[2024-05-22 23:24:09] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
Running 770 sub problems to find dead transitions.
[2024-05-22 23:24:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/588 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 1 (OVERLAPS) 1/589 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/589 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 3 (OVERLAPS) 771/1360 variables, 589/603 constraints. Problems are: Problem set: 0 solved, 770 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1360/1360 variables, and 603 constraints, problems are : Problem set: 0 solved, 770 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 589/589 constraints, PredecessorRefiner: 770/770 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 770 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/588 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 1 (OVERLAPS) 1/589 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/589 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 3 (OVERLAPS) 771/1360 variables, 589/603 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1360 variables, 770/1373 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-05-22 23:25:01] [INFO ] Deduced a trap composed of 101 places in 186 ms of which 3 ms to minimize.
[2024-05-22 23:25:03] [INFO ] Deduced a trap composed of 105 places in 186 ms of which 4 ms to minimize.
[2024-05-22 23:25:06] [INFO ] Deduced a trap composed of 108 places in 98 ms of which 2 ms to minimize.
[2024-05-22 23:25:07] [INFO ] Deduced a trap composed of 108 places in 168 ms of which 4 ms to minimize.
[2024-05-22 23:25:09] [INFO ] Deduced a trap composed of 110 places in 158 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1360/1360 variables, and 1378 constraints, problems are : Problem set: 0 solved, 770 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 589/589 constraints, PredecessorRefiner: 770/770 constraints, Known Traps: 5/5 constraints]
After SMT, in 60504ms problems are : Problem set: 0 solved, 770 unsolved
Search for dead transitions found 0 dead transitions in 60512ms
Starting structural reductions in LTL mode, iteration 1 : 589/633 places, 771/830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61185 ms. Remains : 589/633 places, 771/830 transitions.
Stuttering acceptance computed with spot in 463 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (AND (NOT p0) p2), (NOT p1), (AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-00
Stuttering criterion allowed to conclude after 87 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-00 finished in 61720 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&&F(p1))))'
Support contains 2 out of 633 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 633/633 places, 830/830 transitions.
Graph (trivial) has 580 edges and 633 vertex of which 67 / 633 are part of one of the 11 SCC in 1 ms
Free SCC test removed 56 places
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 576 transition count 708
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 129 place count 512 transition count 708
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 129 place count 512 transition count 676
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 193 place count 480 transition count 676
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 236 place count 437 transition count 633
Iterating global reduction 2 with 43 rules applied. Total rules applied 279 place count 437 transition count 633
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 283 place count 437 transition count 629
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 283 place count 437 transition count 628
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 285 place count 436 transition count 628
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 294 place count 427 transition count 619
Iterating global reduction 3 with 9 rules applied. Total rules applied 303 place count 427 transition count 619
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 312 place count 427 transition count 610
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 464 place count 351 transition count 534
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 468 place count 347 transition count 530
Iterating global reduction 4 with 4 rules applied. Total rules applied 472 place count 347 transition count 530
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 476 place count 347 transition count 526
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 480 place count 345 transition count 539
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 493 place count 345 transition count 526
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 494 place count 344 transition count 525
Applied a total of 494 rules in 180 ms. Remains 344 /633 variables (removed 289) and now considering 525/830 (removed 305) transitions.
[2024-05-22 23:25:10] [INFO ] Flow matrix only has 503 transitions (discarded 22 similar events)
// Phase 1: matrix 503 rows 344 cols
[2024-05-22 23:25:10] [INFO ] Computed 14 invariants in 10 ms
[2024-05-22 23:25:10] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-22 23:25:10] [INFO ] Flow matrix only has 503 transitions (discarded 22 similar events)
[2024-05-22 23:25:10] [INFO ] Invariant cache hit.
[2024-05-22 23:25:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 23:25:11] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
[2024-05-22 23:25:11] [INFO ] Redundant transitions in 30 ms returned []
Running 401 sub problems to find dead transitions.
[2024-05-22 23:25:11] [INFO ] Flow matrix only has 503 transitions (discarded 22 similar events)
[2024-05-22 23:25:11] [INFO ] Invariant cache hit.
[2024-05-22 23:25:11] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (OVERLAPS) 1/344 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/344 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (OVERLAPS) 502/846 variables, 344/358 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/846 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 6 (OVERLAPS) 1/847 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/847 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 8 (OVERLAPS) 0/847 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 401 unsolved
No progress, stopping.
After SMT solving in domain Real declared 847/847 variables, and 359 constraints, problems are : Problem set: 0 solved, 401 unsolved in 23797 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 344/344 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (OVERLAPS) 1/344 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/344 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 4 (OVERLAPS) 502/846 variables, 344/358 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/846 variables, 401/759 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/846 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 7 (OVERLAPS) 1/847 variables, 1/760 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/847 variables, 0/760 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 847/847 variables, and 760 constraints, problems are : Problem set: 0 solved, 401 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 344/344 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 0/0 constraints]
After SMT, in 54076ms problems are : Problem set: 0 solved, 401 unsolved
Search for dead transitions found 0 dead transitions in 54080ms
Starting structural reductions in SI_LTL mode, iteration 1 : 344/633 places, 525/830 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54802 ms. Remains : 344/633 places, 525/830 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-02
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-02 finished in 54910 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 830/830 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 609 transition count 806
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 609 transition count 806
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 609 transition count 802
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 69 place count 592 transition count 785
Iterating global reduction 1 with 17 rules applied. Total rules applied 86 place count 592 transition count 785
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 95 place count 592 transition count 776
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 100 place count 587 transition count 771
Iterating global reduction 2 with 5 rules applied. Total rules applied 105 place count 587 transition count 771
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 108 place count 587 transition count 768
Applied a total of 108 rules in 53 ms. Remains 587 /633 variables (removed 46) and now considering 768/830 (removed 62) transitions.
// Phase 1: matrix 768 rows 587 cols
[2024-05-22 23:26:05] [INFO ] Computed 14 invariants in 15 ms
[2024-05-22 23:26:05] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-22 23:26:05] [INFO ] Invariant cache hit.
[2024-05-22 23:26:06] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
Running 767 sub problems to find dead transitions.
[2024-05-22 23:26:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 1 (OVERLAPS) 1/587 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/587 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 3 (OVERLAPS) 768/1355 variables, 587/601 constraints. Problems are: Problem set: 0 solved, 767 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1355/1355 variables, and 601 constraints, problems are : Problem set: 0 solved, 767 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 587/587 constraints, PredecessorRefiner: 767/767 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 767 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 1 (OVERLAPS) 1/587 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/587 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 3 (OVERLAPS) 768/1355 variables, 587/601 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1355 variables, 767/1368 constraints. Problems are: Problem set: 0 solved, 767 unsolved
[2024-05-22 23:26:57] [INFO ] Deduced a trap composed of 101 places in 184 ms of which 4 ms to minimize.
[2024-05-22 23:26:58] [INFO ] Deduced a trap composed of 104 places in 174 ms of which 4 ms to minimize.
[2024-05-22 23:26:59] [INFO ] Deduced a trap composed of 105 places in 183 ms of which 4 ms to minimize.
[2024-05-22 23:27:01] [INFO ] Deduced a trap composed of 106 places in 170 ms of which 4 ms to minimize.
[2024-05-22 23:27:02] [INFO ] Deduced a trap composed of 107 places in 166 ms of which 4 ms to minimize.
[2024-05-22 23:27:03] [INFO ] Deduced a trap composed of 108 places in 150 ms of which 3 ms to minimize.
[2024-05-22 23:27:05] [INFO ] Deduced a trap composed of 109 places in 143 ms of which 4 ms to minimize.
[2024-05-22 23:27:06] [INFO ] Deduced a trap composed of 110 places in 126 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1355/1355 variables, and 1376 constraints, problems are : Problem set: 0 solved, 767 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 587/587 constraints, PredecessorRefiner: 767/767 constraints, Known Traps: 8/8 constraints]
After SMT, in 60518ms problems are : Problem set: 0 solved, 767 unsolved
Search for dead transitions found 0 dead transitions in 60526ms
Starting structural reductions in LTL mode, iteration 1 : 587/633 places, 768/830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61196 ms. Remains : 587/633 places, 768/830 transitions.
Stuttering acceptance computed with spot in 220 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-03
Product exploration explored 100000 steps with 1128 reset in 243 ms.
Product exploration explored 100000 steps with 1129 reset in 235 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 69 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (450 resets) in 214 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (50 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 789373 steps, run timeout after 3001 ms. (steps per millisecond=263 ) properties seen :0 out of 1
Probabilistic random walk after 789373 steps, saw 202847 distinct states, run finished after 3005 ms. (steps per millisecond=262 ) properties seen :0
[2024-05-22 23:27:10] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 537/587 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/587 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 768/1355 variables, 587/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1355 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1355 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1355/1355 variables, and 601 constraints, problems are : Problem set: 0 solved, 1 unsolved in 258 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 587/587 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 537/587 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/587 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 768/1355 variables, 587/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1355 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1355 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1355 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1355/1355 variables, and 602 constraints, problems are : Problem set: 0 solved, 1 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 587/587 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 551ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 86 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=86 )
Parikh walk visited 1 properties in 12 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 233 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 587 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 587/587 places, 768/768 transitions.
Applied a total of 0 rules in 13 ms. Remains 587 /587 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-05-22 23:27:11] [INFO ] Invariant cache hit.
[2024-05-22 23:27:12] [INFO ] Implicit Places using invariants in 213 ms returned []
[2024-05-22 23:27:12] [INFO ] Invariant cache hit.
[2024-05-22 23:27:12] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
Running 767 sub problems to find dead transitions.
[2024-05-22 23:27:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 1 (OVERLAPS) 1/587 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/587 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 3 (OVERLAPS) 768/1355 variables, 587/601 constraints. Problems are: Problem set: 0 solved, 767 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1355/1355 variables, and 601 constraints, problems are : Problem set: 0 solved, 767 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 587/587 constraints, PredecessorRefiner: 767/767 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 767 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 1 (OVERLAPS) 1/587 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/587 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 3 (OVERLAPS) 768/1355 variables, 587/601 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1355 variables, 767/1368 constraints. Problems are: Problem set: 0 solved, 767 unsolved
[2024-05-22 23:28:03] [INFO ] Deduced a trap composed of 101 places in 189 ms of which 4 ms to minimize.
[2024-05-22 23:28:04] [INFO ] Deduced a trap composed of 104 places in 165 ms of which 3 ms to minimize.
[2024-05-22 23:28:06] [INFO ] Deduced a trap composed of 105 places in 185 ms of which 4 ms to minimize.
[2024-05-22 23:28:07] [INFO ] Deduced a trap composed of 106 places in 175 ms of which 3 ms to minimize.
[2024-05-22 23:28:08] [INFO ] Deduced a trap composed of 107 places in 169 ms of which 3 ms to minimize.
[2024-05-22 23:28:10] [INFO ] Deduced a trap composed of 108 places in 152 ms of which 3 ms to minimize.
[2024-05-22 23:28:11] [INFO ] Deduced a trap composed of 109 places in 144 ms of which 3 ms to minimize.
[2024-05-22 23:28:12] [INFO ] Deduced a trap composed of 110 places in 116 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1355/1355 variables, and 1376 constraints, problems are : Problem set: 0 solved, 767 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 587/587 constraints, PredecessorRefiner: 767/767 constraints, Known Traps: 8/8 constraints]
After SMT, in 60467ms problems are : Problem set: 0 solved, 767 unsolved
Search for dead transitions found 0 dead transitions in 60474ms
Finished structural reductions in LTL mode , in 1 iterations and 61120 ms. Remains : 587/587 places, 768/768 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (449 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (49 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 828630 steps, run timeout after 3001 ms. (steps per millisecond=276 ) properties seen :0 out of 1
Probabilistic random walk after 828630 steps, saw 210183 distinct states, run finished after 3001 ms. (steps per millisecond=276 ) properties seen :0
[2024-05-22 23:28:16] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 537/587 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/587 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 768/1355 variables, 587/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1355 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1355 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1355/1355 variables, and 601 constraints, problems are : Problem set: 0 solved, 1 unsolved in 262 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 587/587 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 537/587 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/587 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 768/1355 variables, 587/601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1355 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1355 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1355 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1355/1355 variables, and 602 constraints, problems are : Problem set: 0 solved, 1 unsolved in 276 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 587/587 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 567ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 85 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=85 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 120 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 254 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1128 reset in 191 ms.
Product exploration explored 100000 steps with 1127 reset in 199 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 180 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 587 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 587/587 places, 768/768 transitions.
Graph (trivial) has 548 edges and 587 vertex of which 73 / 587 are part of one of the 12 SCC in 2 ms
Free SCC test removed 61 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 526 transition count 706
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 34 Pre rules applied. Total rules applied 48 place count 526 transition count 706
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 82 place count 526 transition count 706
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 138 place count 470 transition count 650
Deduced a syphon composed of 48 places in 1 ms
Iterating global reduction 1 with 56 rules applied. Total rules applied 194 place count 470 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 195 place count 469 transition count 649
Deduced a syphon composed of 48 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 196 place count 469 transition count 649
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 1 with 66 rules applied. Total rules applied 262 place count 469 transition count 673
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 290 place count 441 transition count 645
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 318 place count 441 transition count 645
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 98 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 330 place count 441 transition count 669
Deduced a syphon composed of 98 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 354 place count 441 transition count 645
Deduced a syphon composed of 98 places in 1 ms
Applied a total of 354 rules in 150 ms. Remains 441 /587 variables (removed 146) and now considering 645/768 (removed 123) transitions.
[2024-05-22 23:28:18] [INFO ] Redundant transitions in 13 ms returned []
Running 644 sub problems to find dead transitions.
[2024-05-22 23:28:18] [INFO ] Flow matrix only has 622 transitions (discarded 23 similar events)
// Phase 1: matrix 622 rows 441 cols
[2024-05-22 23:28:18] [INFO ] Computed 14 invariants in 9 ms
[2024-05-22 23:28:18] [INFO ] State equation strengthened by 97 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (OVERLAPS) 1/441 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-05-22 23:28:28] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
[2024-05-22 23:28:28] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
[2024-05-22 23:28:28] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
[2024-05-22 23:28:28] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
[2024-05-22 23:28:28] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
[2024-05-22 23:28:29] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
[2024-05-22 23:28:29] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
[2024-05-22 23:28:29] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
[2024-05-22 23:28:29] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
[2024-05-22 23:28:29] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
[2024-05-22 23:28:29] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
[2024-05-22 23:28:29] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
[2024-05-22 23:28:30] [INFO ] Deduced a trap composed of 123 places in 80 ms of which 2 ms to minimize.
Problem TDEAD411 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
[2024-05-22 23:28:31] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 3 ms to minimize.
Problem TDEAD570 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD642 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 14/28 constraints. Problems are: Problem set: 134 solved, 510 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 0/28 constraints. Problems are: Problem set: 134 solved, 510 unsolved
At refinement iteration 4 (OVERLAPS) 621/1062 variables, 441/469 constraints. Problems are: Problem set: 134 solved, 510 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1062 variables, 96/565 constraints. Problems are: Problem set: 134 solved, 510 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1062 variables, 0/565 constraints. Problems are: Problem set: 134 solved, 510 unsolved
SMT process timed out in 30754ms, After SMT, problems are : Problem set: 134 solved, 510 unsolved
Search for dead transitions found 134 dead transitions in 30760ms
Found 134 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 134 transitions
Dead transitions reduction (with SMT) removed 134 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 441/587 places, 511/768 transitions.
Graph (complete) has 1447 edges and 441 vertex of which 343 are kept as prefixes of interest. Removing 98 places using SCC suffix rule.2 ms
Discarding 98 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 28 ms. Remains 343 /441 variables (removed 98) and now considering 511/511 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 343/587 places, 511/768 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30961 ms. Remains : 343/587 places, 511/768 transitions.
Support contains 1 out of 587 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 587/587 places, 768/768 transitions.
Applied a total of 0 rules in 9 ms. Remains 587 /587 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 587 cols
[2024-05-22 23:28:49] [INFO ] Computed 14 invariants in 6 ms
[2024-05-22 23:28:49] [INFO ] Implicit Places using invariants in 369 ms returned []
[2024-05-22 23:28:49] [INFO ] Invariant cache hit.
[2024-05-22 23:28:50] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 830 ms to find 0 implicit places.
Running 767 sub problems to find dead transitions.
[2024-05-22 23:28:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 1 (OVERLAPS) 1/587 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/587 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 767 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 768/1355 variables, 587/601 constraints. Problems are: Problem set: 0 solved, 767 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1355/1355 variables, and 601 constraints, problems are : Problem set: 0 solved, 767 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 587/587 constraints, PredecessorRefiner: 767/767 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 767 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 1 (OVERLAPS) 1/587 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/587 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 3 (OVERLAPS) 768/1355 variables, 587/601 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1355 variables, 767/1368 constraints. Problems are: Problem set: 0 solved, 767 unsolved
[2024-05-22 23:29:41] [INFO ] Deduced a trap composed of 101 places in 202 ms of which 4 ms to minimize.
[2024-05-22 23:29:42] [INFO ] Deduced a trap composed of 104 places in 198 ms of which 4 ms to minimize.
[2024-05-22 23:29:43] [INFO ] Deduced a trap composed of 105 places in 194 ms of which 3 ms to minimize.
[2024-05-22 23:29:45] [INFO ] Deduced a trap composed of 106 places in 186 ms of which 3 ms to minimize.
[2024-05-22 23:29:46] [INFO ] Deduced a trap composed of 107 places in 204 ms of which 3 ms to minimize.
[2024-05-22 23:29:47] [INFO ] Deduced a trap composed of 108 places in 150 ms of which 3 ms to minimize.
[2024-05-22 23:29:49] [INFO ] Deduced a trap composed of 109 places in 136 ms of which 3 ms to minimize.
[2024-05-22 23:29:50] [INFO ] Deduced a trap composed of 110 places in 135 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1355/1355 variables, and 1376 constraints, problems are : Problem set: 0 solved, 767 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 587/587 constraints, PredecessorRefiner: 767/767 constraints, Known Traps: 8/8 constraints]
After SMT, in 60450ms problems are : Problem set: 0 solved, 767 unsolved
Search for dead transitions found 0 dead transitions in 60458ms
Finished structural reductions in LTL mode , in 1 iterations and 61298 ms. Remains : 587/587 places, 768/768 transitions.
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-03 finished in 225340 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 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 830/830 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 610 transition count 807
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 610 transition count 807
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 610 transition count 803
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 66 place count 594 transition count 787
Iterating global reduction 1 with 16 rules applied. Total rules applied 82 place count 594 transition count 787
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 91 place count 594 transition count 778
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 95 place count 590 transition count 774
Iterating global reduction 2 with 4 rules applied. Total rules applied 99 place count 590 transition count 774
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 101 place count 590 transition count 772
Applied a total of 101 rules in 68 ms. Remains 590 /633 variables (removed 43) and now considering 772/830 (removed 58) transitions.
// Phase 1: matrix 772 rows 590 cols
[2024-05-22 23:29:50] [INFO ] Computed 14 invariants in 6 ms
[2024-05-22 23:29:51] [INFO ] Implicit Places using invariants in 685 ms returned []
[2024-05-22 23:29:51] [INFO ] Invariant cache hit.
[2024-05-22 23:29:52] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 1188 ms to find 0 implicit places.
Running 771 sub problems to find dead transitions.
[2024-05-22 23:29:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/589 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 1 (OVERLAPS) 1/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 771 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 772/1362 variables, 590/604 constraints. Problems are: Problem set: 0 solved, 771 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1362/1362 variables, and 604 constraints, problems are : Problem set: 0 solved, 771 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 590/590 constraints, PredecessorRefiner: 771/771 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 771 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/589 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 1 (OVERLAPS) 1/590 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/590 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 3 (OVERLAPS) 772/1362 variables, 590/604 constraints. Problems are: Problem set: 0 solved, 771 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1362 variables, 771/1375 constraints. Problems are: Problem set: 0 solved, 771 unsolved
[2024-05-22 23:30:43] [INFO ] Deduced a trap composed of 101 places in 185 ms of which 4 ms to minimize.
[2024-05-22 23:30:44] [INFO ] Deduced a trap composed of 104 places in 191 ms of which 4 ms to minimize.
[2024-05-22 23:30:45] [INFO ] Deduced a trap composed of 105 places in 182 ms of which 3 ms to minimize.
[2024-05-22 23:30:47] [INFO ] Deduced a trap composed of 106 places in 183 ms of which 3 ms to minimize.
[2024-05-22 23:30:48] [INFO ] Deduced a trap composed of 109 places in 168 ms of which 3 ms to minimize.
[2024-05-22 23:30:49] [INFO ] Deduced a trap composed of 108 places in 160 ms of which 3 ms to minimize.
[2024-05-22 23:30:51] [INFO ] Deduced a trap composed of 110 places in 158 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1362/1362 variables, and 1382 constraints, problems are : Problem set: 0 solved, 771 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 590/590 constraints, PredecessorRefiner: 771/771 constraints, Known Traps: 7/7 constraints]
After SMT, in 60437ms problems are : Problem set: 0 solved, 771 unsolved
Search for dead transitions found 0 dead transitions in 60447ms
Starting structural reductions in LTL mode, iteration 1 : 590/633 places, 772/830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61730 ms. Remains : 590/633 places, 772/830 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-04
Product exploration explored 100000 steps with 1124 reset in 191 ms.
Product exploration explored 100000 steps with 1126 reset in 190 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 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 125 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 40 ms :[true, (NOT p0)]
RANDOM walk for 31862 steps (358 resets) in 112 ms. (281 steps per ms) remains 0/1 properties
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 79 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-12b-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-04 finished in 62548 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 830/830 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 609 transition count 806
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 609 transition count 806
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 609 transition count 802
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 69 place count 592 transition count 785
Iterating global reduction 1 with 17 rules applied. Total rules applied 86 place count 592 transition count 785
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 95 place count 592 transition count 776
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 100 place count 587 transition count 771
Iterating global reduction 2 with 5 rules applied. Total rules applied 105 place count 587 transition count 771
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 108 place count 587 transition count 768
Applied a total of 108 rules in 85 ms. Remains 587 /633 variables (removed 46) and now considering 768/830 (removed 62) transitions.
// Phase 1: matrix 768 rows 587 cols
[2024-05-22 23:30:53] [INFO ] Computed 14 invariants in 5 ms
[2024-05-22 23:30:53] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-22 23:30:53] [INFO ] Invariant cache hit.
[2024-05-22 23:30:54] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 789 ms to find 0 implicit places.
Running 767 sub problems to find dead transitions.
[2024-05-22 23:30:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 1 (OVERLAPS) 1/587 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/587 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 3 (OVERLAPS) 768/1355 variables, 587/601 constraints. Problems are: Problem set: 0 solved, 767 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1355/1355 variables, and 601 constraints, problems are : Problem set: 0 solved, 767 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 587/587 constraints, PredecessorRefiner: 767/767 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 767 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 1 (OVERLAPS) 1/587 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/587 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 3 (OVERLAPS) 768/1355 variables, 587/601 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1355 variables, 767/1368 constraints. Problems are: Problem set: 0 solved, 767 unsolved
[2024-05-22 23:31:45] [INFO ] Deduced a trap composed of 101 places in 185 ms of which 4 ms to minimize.
[2024-05-22 23:31:46] [INFO ] Deduced a trap composed of 104 places in 186 ms of which 3 ms to minimize.
[2024-05-22 23:31:48] [INFO ] Deduced a trap composed of 105 places in 199 ms of which 3 ms to minimize.
[2024-05-22 23:31:49] [INFO ] Deduced a trap composed of 106 places in 218 ms of which 3 ms to minimize.
[2024-05-22 23:31:50] [INFO ] Deduced a trap composed of 107 places in 176 ms of which 3 ms to minimize.
[2024-05-22 23:31:52] [INFO ] Deduced a trap composed of 109 places in 168 ms of which 3 ms to minimize.
[2024-05-22 23:31:53] [INFO ] Deduced a trap composed of 109 places in 173 ms of which 3 ms to minimize.
[2024-05-22 23:31:54] [INFO ] Deduced a trap composed of 110 places in 146 ms of which 3 ms to minimize.
SMT process timed out in 60550ms, After SMT, problems are : Problem set: 0 solved, 767 unsolved
Search for dead transitions found 0 dead transitions in 60558ms
Starting structural reductions in LTL mode, iteration 1 : 587/633 places, 768/830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61434 ms. Remains : 587/633 places, 768/830 transitions.
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-05
Product exploration explored 100000 steps with 1122 reset in 162 ms.
Product exploration explored 100000 steps with 1127 reset in 179 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (448 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (47 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 836148 steps, run timeout after 3001 ms. (steps per millisecond=278 ) properties seen :0 out of 1
Probabilistic random walk after 836148 steps, saw 211900 distinct states, run finished after 3001 ms. (steps per millisecond=278 ) properties seen :0
[2024-05-22 23:31:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 542/587 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 23:31:58] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 2 ms to minimize.
[2024-05-22 23:31:58] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 2 ms to minimize.
[2024-05-22 23:31:59] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 3 ms to minimize.
[2024-05-22 23:31:59] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/587 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/587 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 768/1355 variables, 587/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1355 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1355 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1355/1355 variables, and 605 constraints, problems are : Problem set: 0 solved, 1 unsolved in 861 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 587/587 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 542/587 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/587 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 23:31:59] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/587 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/587 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 768/1355 variables, 587/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1355 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1355 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1355 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1355/1355 variables, and 607 constraints, problems are : Problem set: 0 solved, 1 unsolved in 392 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 587/587 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1282ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 90 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=90 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 587 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 587/587 places, 768/768 transitions.
Applied a total of 0 rules in 14 ms. Remains 587 /587 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-05-22 23:32:00] [INFO ] Invariant cache hit.
[2024-05-22 23:32:00] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-22 23:32:00] [INFO ] Invariant cache hit.
[2024-05-22 23:32:00] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
Running 767 sub problems to find dead transitions.
[2024-05-22 23:32:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 1 (OVERLAPS) 1/587 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/587 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 767 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 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 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 1.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 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 768/1355 variables, 587/601 constraints. Problems are: Problem set: 0 solved, 767 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1355/1355 variables, and 601 constraints, problems are : Problem set: 0 solved, 767 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 587/587 constraints, PredecessorRefiner: 767/767 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 767 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 1 (OVERLAPS) 1/587 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/587 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 3 (OVERLAPS) 768/1355 variables, 587/601 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1355 variables, 767/1368 constraints. Problems are: Problem set: 0 solved, 767 unsolved
[2024-05-22 23:32:52] [INFO ] Deduced a trap composed of 101 places in 214 ms of which 3 ms to minimize.
[2024-05-22 23:32:53] [INFO ] Deduced a trap composed of 104 places in 192 ms of which 3 ms to minimize.
[2024-05-22 23:32:55] [INFO ] Deduced a trap composed of 105 places in 192 ms of which 3 ms to minimize.
[2024-05-22 23:32:56] [INFO ] Deduced a trap composed of 106 places in 182 ms of which 3 ms to minimize.
[2024-05-22 23:32:57] [INFO ] Deduced a trap composed of 107 places in 176 ms of which 3 ms to minimize.
[2024-05-22 23:32:59] [INFO ] Deduced a trap composed of 109 places in 165 ms of which 4 ms to minimize.
[2024-05-22 23:33:00] [INFO ] Deduced a trap composed of 109 places in 190 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1355/1355 variables, and 1375 constraints, problems are : Problem set: 0 solved, 767 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 587/587 constraints, PredecessorRefiner: 767/767 constraints, Known Traps: 7/7 constraints]
After SMT, in 60411ms problems are : Problem set: 0 solved, 767 unsolved
Search for dead transitions found 0 dead transitions in 60417ms
Finished structural reductions in LTL mode , in 1 iterations and 61122 ms. Remains : 587/587 places, 768/768 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (446 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (49 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 821661 steps, run timeout after 3001 ms. (steps per millisecond=273 ) properties seen :0 out of 1
Probabilistic random walk after 821661 steps, saw 208839 distinct states, run finished after 3001 ms. (steps per millisecond=273 ) properties seen :0
[2024-05-22 23:33:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 542/587 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 23:33:04] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 3 ms to minimize.
[2024-05-22 23:33:04] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 3 ms to minimize.
[2024-05-22 23:33:05] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 2 ms to minimize.
[2024-05-22 23:33:05] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/587 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/587 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 768/1355 variables, 587/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1355 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1355 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1355/1355 variables, and 605 constraints, problems are : Problem set: 0 solved, 1 unsolved in 878 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 587/587 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 542/587 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/587 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 23:33:05] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/587 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/587 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 768/1355 variables, 587/606 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1355 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1355 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1355 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1355/1355 variables, and 607 constraints, problems are : Problem set: 0 solved, 1 unsolved in 429 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 587/587 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1337ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 82 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=82 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1131 reset in 166 ms.
Product exploration explored 100000 steps with 1118 reset in 173 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 587 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 587/587 places, 768/768 transitions.
Graph (trivial) has 548 edges and 587 vertex of which 73 / 587 are part of one of the 12 SCC in 2 ms
Free SCC test removed 61 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 526 transition count 706
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 34 Pre rules applied. Total rules applied 48 place count 526 transition count 706
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 1 with 34 rules applied. Total rules applied 82 place count 526 transition count 706
Discarding 56 places :
Symmetric choice reduction at 1 with 56 rule applications. Total rules 138 place count 470 transition count 650
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 56 rules applied. Total rules applied 194 place count 470 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 195 place count 469 transition count 649
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 196 place count 469 transition count 649
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 114 places in 0 ms
Iterating global reduction 1 with 66 rules applied. Total rules applied 262 place count 469 transition count 673
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 290 place count 441 transition count 645
Deduced a syphon composed of 86 places in 1 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 318 place count 441 transition count 645
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 98 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 330 place count 441 transition count 669
Deduced a syphon composed of 98 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 1 with 24 rules applied. Total rules applied 354 place count 441 transition count 645
Deduced a syphon composed of 98 places in 0 ms
Applied a total of 354 rules in 133 ms. Remains 441 /587 variables (removed 146) and now considering 645/768 (removed 123) transitions.
[2024-05-22 23:33:07] [INFO ] Redundant transitions in 5 ms returned []
Running 644 sub problems to find dead transitions.
[2024-05-22 23:33:07] [INFO ] Flow matrix only has 622 transitions (discarded 23 similar events)
// Phase 1: matrix 622 rows 441 cols
[2024-05-22 23:33:07] [INFO ] Computed 14 invariants in 6 ms
[2024-05-22 23:33:07] [INFO ] State equation strengthened by 97 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 644 unsolved
At refinement iteration 1 (OVERLAPS) 1/441 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 644 unsolved
[2024-05-22 23:33:16] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
[2024-05-22 23:33:16] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
[2024-05-22 23:33:16] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
[2024-05-22 23:33:16] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
Problem TDEAD179 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
[2024-05-22 23:33:17] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
[2024-05-22 23:33:17] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
[2024-05-22 23:33:17] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
[2024-05-22 23:33:17] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
Problem TDEAD255 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
[2024-05-22 23:33:17] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
[2024-05-22 23:33:17] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
[2024-05-22 23:33:17] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 6 ms to minimize.
Problem TDEAD312 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
[2024-05-22 23:33:18] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
Problem TDEAD332 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD363 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
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
[2024-05-22 23:33:18] [INFO ] Deduced a trap composed of 123 places in 90 ms of which 2 ms to minimize.
Problem TDEAD411 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
[2024-05-22 23:33:19] [INFO ] Deduced a trap composed of 3 places in 168 ms of which 3 ms to minimize.
Problem TDEAD570 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD642 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/441 variables, 14/28 constraints. Problems are: Problem set: 134 solved, 510 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/441 variables, 0/28 constraints. Problems are: Problem set: 134 solved, 510 unsolved
At refinement iteration 4 (OVERLAPS) 621/1062 variables, 441/469 constraints. Problems are: Problem set: 134 solved, 510 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1062 variables, 96/565 constraints. Problems are: Problem set: 134 solved, 510 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1062 variables, 0/565 constraints. Problems are: Problem set: 134 solved, 510 unsolved
SMT process timed out in 30739ms, After SMT, problems are : Problem set: 134 solved, 510 unsolved
Search for dead transitions found 134 dead transitions in 30744ms
Found 134 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 134 transitions
Dead transitions reduction (with SMT) removed 134 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 441/587 places, 511/768 transitions.
Graph (complete) has 1447 edges and 441 vertex of which 343 are kept as prefixes of interest. Removing 98 places using SCC suffix rule.2 ms
Discarding 98 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 20 ms. Remains 343 /441 variables (removed 98) and now considering 511/511 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 343/587 places, 511/768 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 30919 ms. Remains : 343/587 places, 511/768 transitions.
Support contains 1 out of 587 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 587/587 places, 768/768 transitions.
Applied a total of 0 rules in 9 ms. Remains 587 /587 variables (removed 0) and now considering 768/768 (removed 0) transitions.
// Phase 1: matrix 768 rows 587 cols
[2024-05-22 23:33:37] [INFO ] Computed 14 invariants in 48 ms
[2024-05-22 23:33:38] [INFO ] Implicit Places using invariants in 364 ms returned []
[2024-05-22 23:33:38] [INFO ] Invariant cache hit.
[2024-05-22 23:33:38] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 856 ms to find 0 implicit places.
Running 767 sub problems to find dead transitions.
[2024-05-22 23:33:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 1 (OVERLAPS) 1/587 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/587 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 767 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (OVERLAPS) 768/1355 variables, 587/601 constraints. Problems are: Problem set: 0 solved, 767 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1355/1355 variables, and 601 constraints, problems are : Problem set: 0 solved, 767 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 587/587 constraints, PredecessorRefiner: 767/767 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 767 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 1 (OVERLAPS) 1/587 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/587 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 3 (OVERLAPS) 768/1355 variables, 587/601 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1355 variables, 767/1368 constraints. Problems are: Problem set: 0 solved, 767 unsolved
[2024-05-22 23:34:30] [INFO ] Deduced a trap composed of 101 places in 196 ms of which 4 ms to minimize.
[2024-05-22 23:34:31] [INFO ] Deduced a trap composed of 104 places in 183 ms of which 3 ms to minimize.
[2024-05-22 23:34:33] [INFO ] Deduced a trap composed of 105 places in 218 ms of which 4 ms to minimize.
[2024-05-22 23:34:34] [INFO ] Deduced a trap composed of 106 places in 171 ms of which 3 ms to minimize.
[2024-05-22 23:34:35] [INFO ] Deduced a trap composed of 107 places in 173 ms of which 4 ms to minimize.
[2024-05-22 23:34:37] [INFO ] Deduced a trap composed of 109 places in 165 ms of which 3 ms to minimize.
[2024-05-22 23:34:38] [INFO ] Deduced a trap composed of 109 places in 160 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1355/1355 variables, and 1375 constraints, problems are : Problem set: 0 solved, 767 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 587/587 constraints, PredecessorRefiner: 767/767 constraints, Known Traps: 7/7 constraints]
After SMT, in 60454ms problems are : Problem set: 0 solved, 767 unsolved
Search for dead transitions found 0 dead transitions in 60460ms
Finished structural reductions in LTL mode , in 1 iterations and 61327 ms. Remains : 587/587 places, 768/768 transitions.
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-05 finished in 225893 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) U (p1&&X(p2))) U (G(p3) U !p0))))'
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 830/830 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 612 transition count 809
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 612 transition count 809
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 612 transition count 805
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 60 place count 598 transition count 791
Iterating global reduction 1 with 14 rules applied. Total rules applied 74 place count 598 transition count 791
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 81 place count 598 transition count 784
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 86 place count 593 transition count 779
Iterating global reduction 2 with 5 rules applied. Total rules applied 91 place count 593 transition count 779
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 94 place count 593 transition count 776
Applied a total of 94 rules in 56 ms. Remains 593 /633 variables (removed 40) and now considering 776/830 (removed 54) transitions.
// Phase 1: matrix 776 rows 593 cols
[2024-05-22 23:34:39] [INFO ] Computed 14 invariants in 5 ms
[2024-05-22 23:34:39] [INFO ] Implicit Places using invariants in 438 ms returned []
[2024-05-22 23:34:39] [INFO ] Invariant cache hit.
[2024-05-22 23:34:40] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 918 ms to find 0 implicit places.
Running 775 sub problems to find dead transitions.
[2024-05-22 23:34:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 775 unsolved
At refinement iteration 1 (OVERLAPS) 1/593 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 775 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 775 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 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 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 1.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 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 1.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 1.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 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 1.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 1.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 1.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 0.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 1.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 0.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 1.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 0.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 776/1369 variables, 593/607 constraints. Problems are: Problem set: 0 solved, 775 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1369/1369 variables, and 607 constraints, problems are : Problem set: 0 solved, 775 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 593/593 constraints, PredecessorRefiner: 775/775 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 775 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/592 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 775 unsolved
At refinement iteration 1 (OVERLAPS) 1/593 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 775 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/593 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 775 unsolved
At refinement iteration 3 (OVERLAPS) 776/1369 variables, 593/607 constraints. Problems are: Problem set: 0 solved, 775 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1369 variables, 775/1382 constraints. Problems are: Problem set: 0 solved, 775 unsolved
[2024-05-22 23:35:29] [INFO ] Deduced a trap composed of 158 places in 135 ms of which 2 ms to minimize.
[2024-05-22 23:35:33] [INFO ] Deduced a trap composed of 101 places in 209 ms of which 3 ms to minimize.
[2024-05-22 23:35:34] [INFO ] Deduced a trap composed of 105 places in 197 ms of which 6 ms to minimize.
[2024-05-22 23:35:35] [INFO ] Deduced a trap composed of 105 places in 162 ms of which 4 ms to minimize.
[2024-05-22 23:35:37] [INFO ] Deduced a trap composed of 106 places in 186 ms of which 13 ms to minimize.
[2024-05-22 23:35:38] [INFO ] Deduced a trap composed of 109 places in 183 ms of which 3 ms to minimize.
[2024-05-22 23:35:39] [INFO ] Deduced a trap composed of 109 places in 171 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1369/1369 variables, and 1389 constraints, problems are : Problem set: 0 solved, 775 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 593/593 constraints, PredecessorRefiner: 775/775 constraints, Known Traps: 7/7 constraints]
After SMT, in 60410ms problems are : Problem set: 0 solved, 775 unsolved
Search for dead transitions found 0 dead transitions in 60416ms
Starting structural reductions in LTL mode, iteration 1 : 593/633 places, 776/830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61392 ms. Remains : 593/633 places, 776/830 transitions.
Stuttering acceptance computed with spot in 492 ms :[p0, p0, (OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3) p1 (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 194 ms.
Product exploration explored 100000 steps with 50000 reset in 217 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (X (NOT (AND p0 (NOT p3) (NOT p1)))), (X (NOT p3)), (X (NOT (AND p0 p3 p1))), (X (NOT (AND p0 (NOT p3) p1))), (X (NOT (AND p0 p3 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) (NOT p1))))), (X (X (NOT p3))), (X (X (NOT (AND p3 p1)))), (X (X (NOT (AND p0 p3 p1)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1)))), (X (X (NOT (AND (NOT p3) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p3 p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p3 (NOT p1))))), (X (X (NOT (AND (NOT p3) p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p3 p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p3) (NOT p1)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 (NOT p2))))), (X (X (NOT (AND p3 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) p1)))), (X (X (AND (NOT p3) (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 38 factoid took 49 ms. Reduced automaton from 10 states, 36 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-12b-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-06 finished in 62456 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))||(p1 U p2)))'
Support contains 5 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 830/830 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 610 transition count 807
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 610 transition count 807
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 610 transition count 803
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 67 place count 593 transition count 786
Iterating global reduction 1 with 17 rules applied. Total rules applied 84 place count 593 transition count 786
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 94 place count 593 transition count 776
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 98 place count 589 transition count 772
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 589 transition count 772
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 105 place count 589 transition count 769
Applied a total of 105 rules in 50 ms. Remains 589 /633 variables (removed 44) and now considering 769/830 (removed 61) transitions.
// Phase 1: matrix 769 rows 589 cols
[2024-05-22 23:35:41] [INFO ] Computed 14 invariants in 12 ms
[2024-05-22 23:35:41] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-22 23:35:41] [INFO ] Invariant cache hit.
[2024-05-22 23:35:42] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
Running 768 sub problems to find dead transitions.
[2024-05-22 23:35:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/588 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 1 (OVERLAPS) 1/589 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/589 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 3 (OVERLAPS) 769/1358 variables, 589/603 constraints. Problems are: Problem set: 0 solved, 768 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1358/1358 variables, and 603 constraints, problems are : Problem set: 0 solved, 768 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 589/589 constraints, PredecessorRefiner: 768/768 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 768 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/588 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 1 (OVERLAPS) 1/589 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/589 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 3 (OVERLAPS) 769/1358 variables, 589/603 constraints. Problems are: Problem set: 0 solved, 768 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1358 variables, 768/1371 constraints. Problems are: Problem set: 0 solved, 768 unsolved
[2024-05-22 23:36:33] [INFO ] Deduced a trap composed of 156 places in 129 ms of which 3 ms to minimize.
[2024-05-22 23:36:34] [INFO ] Deduced a trap composed of 101 places in 200 ms of which 3 ms to minimize.
[2024-05-22 23:36:35] [INFO ] Deduced a trap composed of 104 places in 196 ms of which 4 ms to minimize.
[2024-05-22 23:36:37] [INFO ] Deduced a trap composed of 105 places in 189 ms of which 3 ms to minimize.
[2024-05-22 23:36:38] [INFO ] Deduced a trap composed of 106 places in 205 ms of which 3 ms to minimize.
[2024-05-22 23:36:40] [INFO ] Deduced a trap composed of 107 places in 172 ms of which 3 ms to minimize.
[2024-05-22 23:36:41] [INFO ] Deduced a trap composed of 108 places in 153 ms of which 3 ms to minimize.
[2024-05-22 23:36:42] [INFO ] Deduced a trap composed of 109 places in 145 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1358/1358 variables, and 1379 constraints, problems are : Problem set: 0 solved, 768 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 589/589 constraints, PredecessorRefiner: 768/768 constraints, Known Traps: 8/8 constraints]
After SMT, in 60445ms problems are : Problem set: 0 solved, 768 unsolved
Search for dead transitions found 0 dead transitions in 60451ms
Starting structural reductions in LTL mode, iteration 1 : 589/633 places, 769/830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61131 ms. Remains : 589/633 places, 769/830 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-08 finished in 61327 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 X((p2&&G(p3)))))'
Support contains 7 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 830/830 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 611 transition count 808
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 611 transition count 808
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 611 transition count 805
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 63 place count 595 transition count 789
Iterating global reduction 1 with 16 rules applied. Total rules applied 79 place count 595 transition count 789
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 89 place count 595 transition count 779
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 92 place count 592 transition count 776
Iterating global reduction 2 with 3 rules applied. Total rules applied 95 place count 592 transition count 776
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 97 place count 592 transition count 774
Applied a total of 97 rules in 51 ms. Remains 592 /633 variables (removed 41) and now considering 774/830 (removed 56) transitions.
// Phase 1: matrix 774 rows 592 cols
[2024-05-22 23:36:43] [INFO ] Computed 14 invariants in 9 ms
[2024-05-22 23:36:43] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-05-22 23:36:43] [INFO ] Invariant cache hit.
[2024-05-22 23:36:43] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
Running 773 sub problems to find dead transitions.
[2024-05-22 23:36:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 773 unsolved
At refinement iteration 1 (OVERLAPS) 1/592 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 773 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 773 unsolved
At refinement iteration 3 (OVERLAPS) 774/1366 variables, 592/606 constraints. Problems are: Problem set: 0 solved, 773 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1366/1366 variables, and 606 constraints, problems are : Problem set: 0 solved, 773 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 592/592 constraints, PredecessorRefiner: 773/773 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 773 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/591 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 773 unsolved
At refinement iteration 1 (OVERLAPS) 1/592 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 773 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/592 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 773 unsolved
At refinement iteration 3 (OVERLAPS) 774/1366 variables, 592/606 constraints. Problems are: Problem set: 0 solved, 773 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1366 variables, 773/1379 constraints. Problems are: Problem set: 0 solved, 773 unsolved
[2024-05-22 23:37:35] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 4 ms to minimize.
[2024-05-22 23:37:36] [INFO ] Deduced a trap composed of 101 places in 173 ms of which 3 ms to minimize.
[2024-05-22 23:37:37] [INFO ] Deduced a trap composed of 104 places in 185 ms of which 4 ms to minimize.
[2024-05-22 23:37:38] [INFO ] Deduced a trap composed of 106 places in 175 ms of which 4 ms to minimize.
[2024-05-22 23:37:40] [INFO ] Deduced a trap composed of 106 places in 178 ms of which 4 ms to minimize.
[2024-05-22 23:37:41] [INFO ] Deduced a trap composed of 108 places in 153 ms of which 3 ms to minimize.
[2024-05-22 23:37:43] [INFO ] Deduced a trap composed of 108 places in 158 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1366/1366 variables, and 1386 constraints, problems are : Problem set: 0 solved, 773 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 592/592 constraints, PredecessorRefiner: 773/773 constraints, Known Traps: 7/7 constraints]
After SMT, in 60444ms problems are : Problem set: 0 solved, 773 unsolved
Search for dead transitions found 0 dead transitions in 60450ms
Starting structural reductions in LTL mode, iteration 1 : 592/633 places, 774/830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61115 ms. Remains : 592/633 places, 774/830 transitions.
Stuttering acceptance computed with spot in 366 ms :[(OR (NOT p3) (NOT p2)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (NOT p2)), true, (NOT p3), (AND (NOT p3) (NOT p1)), (NOT p3)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-09 finished in 61504 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 633 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 633/633 places, 830/830 transitions.
Graph (trivial) has 592 edges and 633 vertex of which 73 / 633 are part of one of the 12 SCC in 1 ms
Free SCC test removed 61 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 571 transition count 702
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 131 place count 506 transition count 702
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 131 place count 506 transition count 671
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 193 place count 475 transition count 671
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 238 place count 430 transition count 626
Iterating global reduction 2 with 45 rules applied. Total rules applied 283 place count 430 transition count 626
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 286 place count 430 transition count 623
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 286 place count 430 transition count 622
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 288 place count 429 transition count 622
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 297 place count 420 transition count 613
Iterating global reduction 3 with 9 rules applied. Total rules applied 306 place count 420 transition count 613
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 315 place count 420 transition count 604
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 461 place count 347 transition count 531
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 465 place count 343 transition count 527
Iterating global reduction 4 with 4 rules applied. Total rules applied 469 place count 343 transition count 527
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 473 place count 343 transition count 523
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 485 place count 343 transition count 511
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 487 place count 341 transition count 509
Applied a total of 487 rules in 99 ms. Remains 341 /633 variables (removed 292) and now considering 509/830 (removed 321) transitions.
[2024-05-22 23:37:44] [INFO ] Flow matrix only has 486 transitions (discarded 23 similar events)
// Phase 1: matrix 486 rows 341 cols
[2024-05-22 23:37:44] [INFO ] Computed 14 invariants in 13 ms
[2024-05-22 23:37:44] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-22 23:37:44] [INFO ] Flow matrix only has 486 transitions (discarded 23 similar events)
[2024-05-22 23:37:44] [INFO ] Invariant cache hit.
[2024-05-22 23:37:45] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
[2024-05-22 23:37:45] [INFO ] Redundant transitions in 2 ms returned []
Running 230 sub problems to find dead transitions.
[2024-05-22 23:37:45] [INFO ] Flow matrix only has 486 transitions (discarded 23 similar events)
[2024-05-22 23:37:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/329 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/329 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (OVERLAPS) 12/341 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (OVERLAPS) 485/826 variables, 341/355 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/826 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (OVERLAPS) 0/826 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 826/827 variables, and 355 constraints, problems are : Problem set: 0 solved, 230 unsolved in 11123 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 341/341 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/329 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/329 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (OVERLAPS) 12/341 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/341 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (OVERLAPS) 485/826 variables, 341/355 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/826 variables, 230/585 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/826 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (OVERLAPS) 0/826 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Int declared 826/827 variables, and 585 constraints, problems are : Problem set: 0 solved, 230 unsolved in 13671 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 341/341 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 0/0 constraints]
After SMT, in 24952ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 24955ms
Starting structural reductions in SI_LTL mode, iteration 1 : 341/633 places, 509/830 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 25541 ms. Remains : 341/633 places, 509/830 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-10 finished in 25624 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(!p0))&&F(p1))))'
Support contains 2 out of 633 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 633/633 places, 830/830 transitions.
Graph (trivial) has 593 edges and 633 vertex of which 73 / 633 are part of one of the 12 SCC in 0 ms
Free SCC test removed 61 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 571 transition count 702
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 131 place count 506 transition count 702
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 131 place count 506 transition count 671
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 193 place count 475 transition count 671
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 237 place count 431 transition count 627
Iterating global reduction 2 with 44 rules applied. Total rules applied 281 place count 431 transition count 627
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 285 place count 431 transition count 623
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 285 place count 431 transition count 622
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 287 place count 430 transition count 622
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 296 place count 421 transition count 613
Iterating global reduction 3 with 9 rules applied. Total rules applied 305 place count 421 transition count 613
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 314 place count 421 transition count 604
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 460 place count 348 transition count 531
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 462 place count 346 transition count 529
Iterating global reduction 4 with 2 rules applied. Total rules applied 464 place count 346 transition count 529
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 466 place count 346 transition count 527
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 478 place count 346 transition count 515
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 480 place count 344 transition count 513
Applied a total of 480 rules in 114 ms. Remains 344 /633 variables (removed 289) and now considering 513/830 (removed 317) transitions.
[2024-05-22 23:38:10] [INFO ] Flow matrix only has 490 transitions (discarded 23 similar events)
// Phase 1: matrix 490 rows 344 cols
[2024-05-22 23:38:10] [INFO ] Computed 14 invariants in 13 ms
[2024-05-22 23:38:10] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-22 23:38:10] [INFO ] Flow matrix only has 490 transitions (discarded 23 similar events)
[2024-05-22 23:38:10] [INFO ] Invariant cache hit.
[2024-05-22 23:38:10] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2024-05-22 23:38:10] [INFO ] Redundant transitions in 2 ms returned []
Running 233 sub problems to find dead transitions.
[2024-05-22 23:38:10] [INFO ] Flow matrix only has 490 transitions (discarded 23 similar events)
[2024-05-22 23:38:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/332 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 12/344 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/344 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 489/833 variables, 344/358 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/833 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (OVERLAPS) 0/833 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 833/834 variables, and 358 constraints, problems are : Problem set: 0 solved, 233 unsolved in 11358 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/332 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/332 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (OVERLAPS) 12/344 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/344 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 489/833 variables, 344/358 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/833 variables, 233/591 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/833 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (OVERLAPS) 0/833 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Int declared 833/834 variables, and 591 constraints, problems are : Problem set: 0 solved, 233 unsolved in 14312 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 0/0 constraints]
After SMT, in 25809ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 25811ms
Starting structural reductions in SI_LTL mode, iteration 1 : 344/633 places, 513/830 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26366 ms. Remains : 344/633 places, 513/830 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-11
Stuttering criterion allowed to conclude after 23801 steps with 1277 reset in 187 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-11 finished in 26707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 633 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 633/633 places, 830/830 transitions.
Graph (trivial) has 581 edges and 633 vertex of which 67 / 633 are part of one of the 11 SCC in 0 ms
Free SCC test removed 56 places
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 576 transition count 707
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 131 place count 511 transition count 707
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 131 place count 511 transition count 675
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 195 place count 479 transition count 675
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 238 place count 436 transition count 632
Iterating global reduction 2 with 43 rules applied. Total rules applied 281 place count 436 transition count 632
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 285 place count 436 transition count 628
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 285 place count 436 transition count 627
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 287 place count 435 transition count 627
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 296 place count 426 transition count 618
Iterating global reduction 3 with 9 rules applied. Total rules applied 305 place count 426 transition count 618
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 314 place count 426 transition count 609
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 464 place count 351 transition count 534
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 468 place count 347 transition count 530
Iterating global reduction 4 with 4 rules applied. Total rules applied 472 place count 347 transition count 530
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 476 place count 347 transition count 526
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 480 place count 345 transition count 539
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 494 place count 345 transition count 525
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 496 place count 343 transition count 523
Applied a total of 496 rules in 95 ms. Remains 343 /633 variables (removed 290) and now considering 523/830 (removed 307) transitions.
[2024-05-22 23:38:36] [INFO ] Flow matrix only has 501 transitions (discarded 22 similar events)
// Phase 1: matrix 501 rows 343 cols
[2024-05-22 23:38:36] [INFO ] Computed 14 invariants in 11 ms
[2024-05-22 23:38:37] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-22 23:38:37] [INFO ] Flow matrix only has 501 transitions (discarded 22 similar events)
[2024-05-22 23:38:37] [INFO ] Invariant cache hit.
[2024-05-22 23:38:37] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
[2024-05-22 23:38:37] [INFO ] Redundant transitions in 2 ms returned []
Running 360 sub problems to find dead transitions.
[2024-05-22 23:38:37] [INFO ] Flow matrix only has 501 transitions (discarded 22 similar events)
[2024-05-22 23:38:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/339 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/339 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (OVERLAPS) 4/343 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (OVERLAPS) 500/843 variables, 343/357 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/843 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (OVERLAPS) 0/843 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Real declared 843/844 variables, and 357 constraints, problems are : Problem set: 0 solved, 360 unsolved in 17904 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 343/343 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/339 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/339 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (OVERLAPS) 4/343 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (OVERLAPS) 500/843 variables, 343/357 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/843 variables, 360/717 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/843 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (OVERLAPS) 0/843 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Int declared 843/844 variables, and 717 constraints, problems are : Problem set: 0 solved, 360 unsolved in 23102 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 343/343 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints]
After SMT, in 41195ms problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 41199ms
Starting structural reductions in SI_LTL mode, iteration 1 : 343/633 places, 523/830 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 41732 ms. Remains : 343/633 places, 523/830 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-12
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-12 finished in 41840 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) U (G(F(p1))||G(p2)))))'
Support contains 3 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 830/830 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 610 transition count 807
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 610 transition count 807
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 610 transition count 803
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 67 place count 593 transition count 786
Iterating global reduction 1 with 17 rules applied. Total rules applied 84 place count 593 transition count 786
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 94 place count 593 transition count 776
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 99 place count 588 transition count 771
Iterating global reduction 2 with 5 rules applied. Total rules applied 104 place count 588 transition count 771
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 107 place count 588 transition count 768
Applied a total of 107 rules in 44 ms. Remains 588 /633 variables (removed 45) and now considering 768/830 (removed 62) transitions.
// Phase 1: matrix 768 rows 588 cols
[2024-05-22 23:39:18] [INFO ] Computed 14 invariants in 13 ms
[2024-05-22 23:39:18] [INFO ] Implicit Places using invariants in 214 ms returned []
[2024-05-22 23:39:18] [INFO ] Invariant cache hit.
[2024-05-22 23:39:19] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 645 ms to find 0 implicit places.
Running 767 sub problems to find dead transitions.
[2024-05-22 23:39:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/587 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 1 (OVERLAPS) 1/588 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 767 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 768/1356 variables, 588/602 constraints. Problems are: Problem set: 0 solved, 767 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1356/1356 variables, and 602 constraints, problems are : Problem set: 0 solved, 767 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 588/588 constraints, PredecessorRefiner: 767/767 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 767 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/587 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 1 (OVERLAPS) 1/588 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/588 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 3 (OVERLAPS) 768/1356 variables, 588/602 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1356 variables, 767/1369 constraints. Problems are: Problem set: 0 solved, 767 unsolved
[2024-05-22 23:40:09] [INFO ] Deduced a trap composed of 222 places in 182 ms of which 4 ms to minimize.
[2024-05-22 23:40:09] [INFO ] Deduced a trap composed of 156 places in 191 ms of which 4 ms to minimize.
[2024-05-22 23:40:12] [INFO ] Deduced a trap composed of 101 places in 187 ms of which 5 ms to minimize.
[2024-05-22 23:40:13] [INFO ] Deduced a trap composed of 104 places in 179 ms of which 4 ms to minimize.
[2024-05-22 23:40:14] [INFO ] Deduced a trap composed of 105 places in 176 ms of which 4 ms to minimize.
[2024-05-22 23:40:16] [INFO ] Deduced a trap composed of 107 places in 163 ms of which 3 ms to minimize.
[2024-05-22 23:40:17] [INFO ] Deduced a trap composed of 107 places in 165 ms of which 4 ms to minimize.
[2024-05-22 23:40:18] [INFO ] Deduced a trap composed of 108 places in 105 ms of which 3 ms to minimize.
[2024-05-22 23:40:19] [INFO ] Deduced a trap composed of 109 places in 155 ms of which 3 ms to minimize.
SMT process timed out in 60484ms, After SMT, problems are : Problem set: 0 solved, 767 unsolved
Search for dead transitions found 0 dead transitions in 60491ms
Starting structural reductions in LTL mode, iteration 1 : 588/633 places, 768/830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61187 ms. Remains : 588/633 places, 768/830 transitions.
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) p2)]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-14
Stuttering criterion allowed to conclude after 190 steps with 2 reset in 0 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-14 finished in 61441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 2 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 830/830 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 609 transition count 806
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 609 transition count 806
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 609 transition count 802
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 69 place count 592 transition count 785
Iterating global reduction 1 with 17 rules applied. Total rules applied 86 place count 592 transition count 785
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 95 place count 592 transition count 776
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 100 place count 587 transition count 771
Iterating global reduction 2 with 5 rules applied. Total rules applied 105 place count 587 transition count 771
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 108 place count 587 transition count 768
Applied a total of 108 rules in 43 ms. Remains 587 /633 variables (removed 46) and now considering 768/830 (removed 62) transitions.
// Phase 1: matrix 768 rows 587 cols
[2024-05-22 23:40:20] [INFO ] Computed 14 invariants in 4 ms
[2024-05-22 23:40:20] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-22 23:40:20] [INFO ] Invariant cache hit.
[2024-05-22 23:40:20] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
Running 767 sub problems to find dead transitions.
[2024-05-22 23:40:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 1 (OVERLAPS) 1/587 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/587 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 767 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 768/1355 variables, 587/601 constraints. Problems are: Problem set: 0 solved, 767 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1355/1355 variables, and 601 constraints, problems are : Problem set: 0 solved, 767 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 587/587 constraints, PredecessorRefiner: 767/767 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 767 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 1 (OVERLAPS) 1/587 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/587 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 3 (OVERLAPS) 768/1355 variables, 587/601 constraints. Problems are: Problem set: 0 solved, 767 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1355 variables, 767/1368 constraints. Problems are: Problem set: 0 solved, 767 unsolved
[2024-05-22 23:41:12] [INFO ] Deduced a trap composed of 101 places in 184 ms of which 4 ms to minimize.
[2024-05-22 23:41:14] [INFO ] Deduced a trap composed of 104 places in 186 ms of which 2 ms to minimize.
[2024-05-22 23:41:15] [INFO ] Deduced a trap composed of 105 places in 186 ms of which 3 ms to minimize.
[2024-05-22 23:41:17] [INFO ] Deduced a trap composed of 106 places in 184 ms of which 4 ms to minimize.
[2024-05-22 23:41:18] [INFO ] Deduced a trap composed of 107 places in 123 ms of which 2 ms to minimize.
[2024-05-22 23:41:19] [INFO ] Deduced a trap composed of 110 places in 166 ms of which 3 ms to minimize.
[2024-05-22 23:41:21] [INFO ] Deduced a trap composed of 109 places in 159 ms of which 3 ms to minimize.
SMT process timed out in 60580ms, After SMT, problems are : Problem set: 0 solved, 767 unsolved
Search for dead transitions found 0 dead transitions in 60586ms
Starting structural reductions in LTL mode, iteration 1 : 587/633 places, 768/830 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61257 ms. Remains : 587/633 places, 768/830 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-15
Product exploration explored 100000 steps with 1123 reset in 225 ms.
Product exploration explored 100000 steps with 1128 reset in 224 ms.
Computed a total of 14 stabilizing places and 14 stable transitions
Computed a total of 14 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (445 resets) in 238 ms. (167 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (46 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (48 resets) in 137 ms. (289 steps per ms) remains 3/3 properties
[2024-05-22 23:41:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 170/172 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 415/587 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/587 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 768/1355 variables, 587/601 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 23:41:22] [INFO ] Deduced a trap composed of 82 places in 70 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1355 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1355 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1355 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1355/1355 variables, and 602 constraints, problems are : Problem set: 0 solved, 3 unsolved in 631 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 587/587 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 170/172 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 415/587 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/587 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/587 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 768/1355 variables, 587/602 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1355 variables, 3/605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1355 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1355 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1355/1355 variables, and 605 constraints, problems are : Problem set: 0 solved, 3 unsolved in 590 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 587/587 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 1251ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 115 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=23 )
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 3 properties in 6 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 268 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Support contains 2 out of 587 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 587/587 places, 768/768 transitions.
Graph (trivial) has 426 edges and 587 vertex of which 73 / 587 are part of one of the 12 SCC in 1 ms
Free SCC test removed 61 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 525 transition count 647
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 117 place count 467 transition count 647
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 117 place count 467 transition count 622
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 167 place count 442 transition count 622
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 190 place count 419 transition count 599
Iterating global reduction 2 with 23 rules applied. Total rules applied 213 place count 419 transition count 599
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 361 place count 345 transition count 525
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 363 place count 343 transition count 523
Applied a total of 363 rules in 43 ms. Remains 343 /587 variables (removed 244) and now considering 523/768 (removed 245) transitions.
[2024-05-22 23:41:24] [INFO ] Flow matrix only has 489 transitions (discarded 34 similar events)
// Phase 1: matrix 489 rows 343 cols
[2024-05-22 23:41:24] [INFO ] Computed 14 invariants in 3 ms
[2024-05-22 23:41:24] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-22 23:41:24] [INFO ] Flow matrix only has 489 transitions (discarded 34 similar events)
[2024-05-22 23:41:24] [INFO ] Invariant cache hit.
[2024-05-22 23:41:24] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
[2024-05-22 23:41:24] [INFO ] Redundant transitions in 17 ms returned []
Running 364 sub problems to find dead transitions.
[2024-05-22 23:41:24] [INFO ] Flow matrix only has 489 transitions (discarded 34 similar events)
[2024-05-22 23:41:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/343 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (OVERLAPS) 488/831 variables, 343/357 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/831 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (OVERLAPS) 0/831 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 364 unsolved
No progress, stopping.
After SMT solving in domain Real declared 831/832 variables, and 357 constraints, problems are : Problem set: 0 solved, 364 unsolved in 17823 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 343/343 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 364 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 2 (OVERLAPS) 1/343 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/343 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 4 (OVERLAPS) 488/831 variables, 343/357 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/831 variables, 364/721 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/831 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 364 unsolved
At refinement iteration 7 (OVERLAPS) 0/831 variables, 0/721 constraints. Problems are: Problem set: 0 solved, 364 unsolved
No progress, stopping.
After SMT solving in domain Int declared 831/832 variables, and 721 constraints, problems are : Problem set: 0 solved, 364 unsolved in 21872 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 343/343 constraints, PredecessorRefiner: 364/364 constraints, Known Traps: 0/0 constraints]
After SMT, in 40049ms problems are : Problem set: 0 solved, 364 unsolved
Search for dead transitions found 0 dead transitions in 40052ms
Starting structural reductions in SI_LTL mode, iteration 1 : 343/587 places, 523/768 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40707 ms. Remains : 343/587 places, 523/768 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 p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 563 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false]
RANDOM walk for 40000 steps (2102 resets) in 2071 ms. (19 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (11 resets) in 36 ms. (1081 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (32 resets) in 34 ms. (1142 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (32 resets) in 27 ms. (1428 steps per ms) remains 3/3 properties
[2024-05-22 23:42:06] [INFO ] Flow matrix only has 489 transitions (discarded 34 similar events)
[2024-05-22 23:42:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 141/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 289/432 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/432 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 366/798 variables, 167/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/798 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/798 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 33/831 variables, 11/324 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/831 variables, 33/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/831 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/831 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 831/832 variables, and 357 constraints, problems are : Problem set: 0 solved, 3 unsolved in 365 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 343/343 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 141/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 289/432 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/432 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 366/798 variables, 167/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/798 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/798 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/798 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 33/831 variables, 11/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/831 variables, 33/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/831 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/831 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 831/832 variables, and 360 constraints, problems are : Problem set: 0 solved, 3 unsolved in 466 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 343/343 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 840ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 61 steps, including 3 resets, run visited all 3 properties in 2 ms. (steps per millisecond=30 )
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 3 properties in 4 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT p1)), (F (NOT (AND p1 (NOT p0)))), (F (NOT (OR p1 p0))), (F (NOT (OR p1 (NOT p0))))]
Knowledge based reduction with 7 factoid took 613 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-15 finished in 108280 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)))))'
Found a Lengthening insensitive property : FlexibleBarrier-PT-12b-LTLFireability-03
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 633 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 633/633 places, 830/830 transitions.
Graph (trivial) has 594 edges and 633 vertex of which 73 / 633 are part of one of the 12 SCC in 0 ms
Free SCC test removed 61 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 571 transition count 702
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 131 place count 506 transition count 702
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 131 place count 506 transition count 672
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 191 place count 476 transition count 672
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 236 place count 431 transition count 627
Iterating global reduction 2 with 45 rules applied. Total rules applied 281 place count 431 transition count 627
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 285 place count 431 transition count 623
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 285 place count 431 transition count 622
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 287 place count 430 transition count 622
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 296 place count 421 transition count 613
Iterating global reduction 3 with 9 rules applied. Total rules applied 305 place count 421 transition count 613
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 313 place count 421 transition count 605
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 459 place count 348 transition count 532
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 463 place count 344 transition count 528
Iterating global reduction 4 with 4 rules applied. Total rules applied 467 place count 344 transition count 528
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 471 place count 344 transition count 524
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 483 place count 344 transition count 512
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 485 place count 342 transition count 510
Applied a total of 485 rules in 78 ms. Remains 342 /633 variables (removed 291) and now considering 510/830 (removed 320) transitions.
[2024-05-22 23:42:08] [INFO ] Flow matrix only has 487 transitions (discarded 23 similar events)
// Phase 1: matrix 487 rows 342 cols
[2024-05-22 23:42:08] [INFO ] Computed 14 invariants in 14 ms
[2024-05-22 23:42:08] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-22 23:42:08] [INFO ] Flow matrix only has 487 transitions (discarded 23 similar events)
[2024-05-22 23:42:08] [INFO ] Invariant cache hit.
[2024-05-22 23:42:09] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2024-05-22 23:42:09] [INFO ] Flow matrix only has 487 transitions (discarded 23 similar events)
[2024-05-22 23:42:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/330 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 12/342 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (OVERLAPS) 486/828 variables, 342/356 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/828 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (OVERLAPS) 0/828 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 828/829 variables, and 356 constraints, problems are : Problem set: 0 solved, 231 unsolved in 11127 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 342/342 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/330 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 12/342 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (OVERLAPS) 486/828 variables, 342/356 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/828 variables, 231/587 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/828 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 0/828 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Int declared 828/829 variables, and 587 constraints, problems are : Problem set: 0 solved, 231 unsolved in 13331 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 342/342 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 0/0 constraints]
After SMT, in 24588ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 24590ms
Starting structural reductions in LI_LTL mode, iteration 1 : 342/633 places, 510/830 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 25121 ms. Remains : 342/633 places, 510/830 transitions.
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-03
Product exploration explored 100000 steps with 5370 reset in 491 ms.
Product exploration explored 100000 steps with 5376 reset in 492 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 : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2214 resets) in 266 ms. (149 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (28 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1278353 steps, run timeout after 3001 ms. (steps per millisecond=425 ) properties seen :0 out of 1
Probabilistic random walk after 1278353 steps, saw 267964 distinct states, run finished after 3001 ms. (steps per millisecond=425 ) properties seen :0
[2024-05-22 23:42:38] [INFO ] Flow matrix only has 487 transitions (discarded 23 similar events)
[2024-05-22 23:42:38] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/62 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 456/518 variables, 57/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 266/784 variables, 12/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/784 variables, 222/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/784 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 44/828 variables, 44/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/828 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/828 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 828/829 variables, and 356 constraints, problems are : Problem set: 0 solved, 1 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 342/342 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/62 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 456/518 variables, 57/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/518 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 266/784 variables, 12/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/784 variables, 222/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/784 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 44/828 variables, 44/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/828 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/828 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 828/829 variables, and 357 constraints, problems are : Problem set: 0 solved, 1 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 342/342 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 339ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 342/342 places, 510/510 transitions.
Applied a total of 0 rules in 3 ms. Remains 342 /342 variables (removed 0) and now considering 510/510 (removed 0) transitions.
[2024-05-22 23:42:38] [INFO ] Flow matrix only has 487 transitions (discarded 23 similar events)
[2024-05-22 23:42:38] [INFO ] Invariant cache hit.
[2024-05-22 23:42:39] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-22 23:42:39] [INFO ] Flow matrix only has 487 transitions (discarded 23 similar events)
[2024-05-22 23:42:39] [INFO ] Invariant cache hit.
[2024-05-22 23:42:39] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2024-05-22 23:42:39] [INFO ] Flow matrix only has 487 transitions (discarded 23 similar events)
[2024-05-22 23:42:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/330 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 12/342 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (OVERLAPS) 486/828 variables, 342/356 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/828 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (OVERLAPS) 0/828 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 828/829 variables, and 356 constraints, problems are : Problem set: 0 solved, 231 unsolved in 11366 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 342/342 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/330 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 12/342 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (OVERLAPS) 486/828 variables, 342/356 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/828 variables, 231/587 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/828 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 0/828 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Int declared 828/829 variables, and 587 constraints, problems are : Problem set: 0 solved, 231 unsolved in 13404 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 342/342 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 0/0 constraints]
After SMT, in 24915ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 24917ms
Finished structural reductions in LTL mode , in 1 iterations and 25362 ms. Remains : 342/342 places, 510/510 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 : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (2227 resets) in 264 ms. (150 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (27 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1231226 steps, run timeout after 3001 ms. (steps per millisecond=410 ) properties seen :0 out of 1
Probabilistic random walk after 1231226 steps, saw 256550 distinct states, run finished after 3006 ms. (steps per millisecond=409 ) properties seen :0
[2024-05-22 23:43:07] [INFO ] Flow matrix only has 487 transitions (discarded 23 similar events)
[2024-05-22 23:43:07] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/62 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 456/518 variables, 57/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 266/784 variables, 12/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/784 variables, 222/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/784 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 44/828 variables, 44/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/828 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/828 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 828/829 variables, and 356 constraints, problems are : Problem set: 0 solved, 1 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 342/342 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/62 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 456/518 variables, 57/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/518 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 266/784 variables, 12/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/784 variables, 222/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/784 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 44/828 variables, 44/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/828 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/828 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 828/829 variables, and 357 constraints, problems are : Problem set: 0 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 342/342 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 394ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 113 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 179 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5398 reset in 500 ms.
Product exploration explored 100000 steps with 5368 reset in 499 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 342/342 places, 510/510 transitions.
Applied a total of 0 rules in 18 ms. Remains 342 /342 variables (removed 0) and now considering 510/510 (removed 0) transitions.
[2024-05-22 23:43:10] [INFO ] Redundant transitions in 3 ms returned []
Running 231 sub problems to find dead transitions.
[2024-05-22 23:43:10] [INFO ] Flow matrix only has 487 transitions (discarded 23 similar events)
[2024-05-22 23:43:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/330 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 12/342 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (OVERLAPS) 486/828 variables, 342/356 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/828 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (OVERLAPS) 0/828 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 828/829 variables, and 356 constraints, problems are : Problem set: 0 solved, 231 unsolved in 11300 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 342/342 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/330 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 12/342 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (OVERLAPS) 486/828 variables, 342/356 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/828 variables, 231/587 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/828 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 0/828 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Int declared 828/829 variables, and 587 constraints, problems are : Problem set: 0 solved, 231 unsolved in 13670 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 342/342 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 0/0 constraints]
After SMT, in 25128ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 25130ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 25163 ms. Remains : 342/342 places, 510/510 transitions.
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 342/342 places, 510/510 transitions.
Applied a total of 0 rules in 9 ms. Remains 342 /342 variables (removed 0) and now considering 510/510 (removed 0) transitions.
[2024-05-22 23:43:35] [INFO ] Flow matrix only has 487 transitions (discarded 23 similar events)
[2024-05-22 23:43:35] [INFO ] Invariant cache hit.
[2024-05-22 23:43:35] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-22 23:43:35] [INFO ] Flow matrix only has 487 transitions (discarded 23 similar events)
[2024-05-22 23:43:35] [INFO ] Invariant cache hit.
[2024-05-22 23:43:35] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2024-05-22 23:43:35] [INFO ] Flow matrix only has 487 transitions (discarded 23 similar events)
[2024-05-22 23:43:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/330 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 12/342 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (OVERLAPS) 486/828 variables, 342/356 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/828 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (OVERLAPS) 0/828 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 828/829 variables, and 356 constraints, problems are : Problem set: 0 solved, 231 unsolved in 11416 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 342/342 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/330 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 12/342 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (OVERLAPS) 486/828 variables, 342/356 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/828 variables, 231/587 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/828 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 0/828 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Int declared 828/829 variables, and 587 constraints, problems are : Problem set: 0 solved, 231 unsolved in 13469 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 342/342 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 0/0 constraints]
After SMT, in 25049ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 25052ms
Finished structural reductions in LTL mode , in 1 iterations and 25524 ms. Remains : 342/342 places, 510/510 transitions.
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-03 finished in 112380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : FlexibleBarrier-PT-12b-LTLFireability-05
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 633 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 633/633 places, 830/830 transitions.
Graph (trivial) has 594 edges and 633 vertex of which 73 / 633 are part of one of the 12 SCC in 1 ms
Free SCC test removed 61 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 571 transition count 702
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 131 place count 506 transition count 702
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 131 place count 506 transition count 672
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 191 place count 476 transition count 672
Discarding 45 places :
Symmetric choice reduction at 2 with 45 rule applications. Total rules 236 place count 431 transition count 627
Iterating global reduction 2 with 45 rules applied. Total rules applied 281 place count 431 transition count 627
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 285 place count 431 transition count 623
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 285 place count 431 transition count 622
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 287 place count 430 transition count 622
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 296 place count 421 transition count 613
Iterating global reduction 3 with 9 rules applied. Total rules applied 305 place count 421 transition count 613
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 313 place count 421 transition count 605
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 459 place count 348 transition count 532
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 463 place count 344 transition count 528
Iterating global reduction 4 with 4 rules applied. Total rules applied 467 place count 344 transition count 528
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 471 place count 344 transition count 524
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 483 place count 344 transition count 512
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 485 place count 342 transition count 510
Applied a total of 485 rules in 64 ms. Remains 342 /633 variables (removed 291) and now considering 510/830 (removed 320) transitions.
[2024-05-22 23:44:01] [INFO ] Flow matrix only has 487 transitions (discarded 23 similar events)
// Phase 1: matrix 487 rows 342 cols
[2024-05-22 23:44:01] [INFO ] Computed 14 invariants in 4 ms
[2024-05-22 23:44:01] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-22 23:44:01] [INFO ] Flow matrix only has 487 transitions (discarded 23 similar events)
[2024-05-22 23:44:01] [INFO ] Invariant cache hit.
[2024-05-22 23:44:01] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
Running 231 sub problems to find dead transitions.
[2024-05-22 23:44:01] [INFO ] Flow matrix only has 487 transitions (discarded 23 similar events)
[2024-05-22 23:44:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/330 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 12/342 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (OVERLAPS) 486/828 variables, 342/356 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/828 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (OVERLAPS) 0/828 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 828/829 variables, and 356 constraints, problems are : Problem set: 0 solved, 231 unsolved in 11312 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 342/342 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/330 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/330 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (OVERLAPS) 12/342 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (OVERLAPS) 486/828 variables, 342/356 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/828 variables, 231/587 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/828 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 0/828 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Int declared 828/829 variables, and 587 constraints, problems are : Problem set: 0 solved, 231 unsolved in 13606 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 342/342 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 0/0 constraints]
After SMT, in 25068ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 25070ms
Starting structural reductions in LI_LTL mode, iteration 1 : 342/633 places, 510/830 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 25598 ms. Remains : 342/633 places, 510/830 transitions.
Running random walk in product with property : FlexibleBarrier-PT-12b-LTLFireability-05
Product exploration explored 100000 steps with 5377 reset in 520 ms.
Entered a terminal (fully accepting) state of product in 63743 steps with 3453 reset in 340 ms.
Treatment of property FlexibleBarrier-PT-12b-LTLFireability-05 finished in 26709 ms.
FORMULA FlexibleBarrier-PT-12b-LTLFireability-05 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-22 23:44:27] [INFO ] Flatten gal took : 30 ms
[2024-05-22 23:44:27] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-22 23:44:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 633 places, 830 transitions and 2393 arcs took 8 ms.
Total runtime 1294311 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FlexibleBarrier-PT-12b

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 2503
MODEL NAME: /home/mcc/execution/408/model
633 places, 830 transitions.

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

BK_STOP 1716421924790

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-12b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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