Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 756K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K Apr 13 07:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Apr 13 07:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 13 07:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 13 07:58 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 374K 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-10b-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-10b-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-10b-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-10b-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-10b-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-10b-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-10b-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-10b-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-10b-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-10b-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-10b-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-10b-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-10b-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-10b-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-10b-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-10b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717182188158

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-10b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:03:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 19:03:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:03:09] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2024-05-31 19:03:09] [INFO ] Transformed 1402 places.
[2024-05-31 19:03:09] [INFO ] Transformed 1613 transitions.
[2024-05-31 19:03:09] [INFO ] Found NUPN structural information;
[2024-05-31 19:03:09] [INFO ] Parsed PT model containing 1402 places and 1613 transitions and 4025 arcs in 237 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 1402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1402/1402 places, 1613/1613 transitions.
Discarding 530 places :
Symmetric choice reduction at 0 with 530 rule applications. Total rules 530 place count 872 transition count 1083
Iterating global reduction 0 with 530 rules applied. Total rules applied 1060 place count 872 transition count 1083
Discarding 234 places :
Symmetric choice reduction at 0 with 234 rule applications. Total rules 1294 place count 638 transition count 849
Iterating global reduction 0 with 234 rules applied. Total rules applied 1528 place count 638 transition count 849
Discarding 142 places :
Symmetric choice reduction at 0 with 142 rule applications. Total rules 1670 place count 496 transition count 707
Iterating global reduction 0 with 142 rules applied. Total rules applied 1812 place count 496 transition count 707
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 1876 place count 496 transition count 643
Applied a total of 1876 rules in 231 ms. Remains 496 /1402 variables (removed 906) and now considering 643/1613 (removed 970) transitions.
// Phase 1: matrix 643 rows 496 cols
[2024-05-31 19:03:10] [INFO ] Computed 12 invariants in 27 ms
[2024-05-31 19:03:10] [INFO ] Implicit Places using invariants in 384 ms returned []
[2024-05-31 19:03:10] [INFO ] Invariant cache hit.
[2024-05-31 19:03:10] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 890 ms to find 0 implicit places.
Running 642 sub problems to find dead transitions.
[2024-05-31 19:03:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 1 (OVERLAPS) 1/496 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-05-31 19:03:25] [INFO ] Deduced a trap composed of 399 places in 221 ms of which 36 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 4 (OVERLAPS) 643/1139 variables, 496/509 constraints. Problems are: Problem set: 0 solved, 642 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1139/1139 variables, and 509 constraints, problems are : Problem set: 0 solved, 642 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 642/642 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 642 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/495 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 1 (OVERLAPS) 1/496 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 4 (OVERLAPS) 643/1139 variables, 496/509 constraints. Problems are: Problem set: 0 solved, 642 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1139 variables, 642/1151 constraints. Problems are: Problem set: 0 solved, 642 unsolved
[2024-05-31 19:03:55] [INFO ] Deduced a trap composed of 125 places in 126 ms of which 4 ms to minimize.
[2024-05-31 19:03:56] [INFO ] Deduced a trap composed of 122 places in 125 ms of which 3 ms to minimize.
[2024-05-31 19:03:57] [INFO ] Deduced a trap composed of 88 places in 164 ms of which 3 ms to minimize.
[2024-05-31 19:03:58] [INFO ] Deduced a trap composed of 124 places in 151 ms of which 3 ms to minimize.
[2024-05-31 19:03:59] [INFO ] Deduced a trap composed of 96 places in 148 ms of which 3 ms to minimize.
[2024-05-31 19:04:00] [INFO ] Deduced a trap composed of 99 places in 141 ms of which 3 ms to minimize.
[2024-05-31 19:04:02] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 2 ms to minimize.
[2024-05-31 19:04:03] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 3 ms to minimize.
[2024-05-31 19:04:04] [INFO ] Deduced a trap composed of 96 places in 135 ms of which 3 ms to minimize.
[2024-05-31 19:04:05] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 2 ms to minimize.
[2024-05-31 19:04:06] [INFO ] Deduced a trap composed of 102 places in 105 ms of which 2 ms to minimize.
[2024-05-31 19:04:07] [INFO ] Deduced a trap composed of 101 places in 94 ms of which 2 ms to minimize.
[2024-05-31 19:04:09] [INFO ] Deduced a trap composed of 372 places in 151 ms of which 2 ms to minimize.
[2024-05-31 19:04:09] [INFO ] Deduced a trap composed of 375 places in 149 ms of which 3 ms to minimize.
[2024-05-31 19:04:10] [INFO ] Deduced a trap composed of 372 places in 150 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1139/1139 variables, and 1166 constraints, problems are : Problem set: 0 solved, 642 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 642/642 constraints, Known Traps: 16/16 constraints]
After SMT, in 60748ms problems are : Problem set: 0 solved, 642 unsolved
Search for dead transitions found 0 dead transitions in 60774ms
Starting structural reductions in LTL mode, iteration 1 : 496/1402 places, 643/1613 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61943 ms. Remains : 496/1402 places, 643/1613 transitions.
Support contains 40 out of 496 places after structural reductions.
[2024-05-31 19:04:12] [INFO ] Flatten gal took : 90 ms
[2024-05-31 19:04:12] [INFO ] Flatten gal took : 62 ms
[2024-05-31 19:04:12] [INFO ] Input system was already deterministic with 643 transitions.
RANDOM walk for 40000 steps (524 resets) in 1658 ms. (24 steps per ms) remains 10/21 properties
BEST_FIRST walk for 40004 steps (63 resets) in 175 ms. (227 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (61 resets) in 105 ms. (377 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (61 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (60 resets) in 64 ms. (615 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (62 resets) in 49 ms. (800 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (61 resets) in 92 ms. (430 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (58 resets) in 83 ms. (476 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (60 resets) in 108 ms. (367 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (63 resets) in 85 ms. (465 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40003 steps (61 resets) in 37 ms. (1052 steps per ms) remains 8/9 properties
[2024-05-31 19:04:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 438/455 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 41/496 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/496 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 643/1139 variables, 496/508 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1139 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/1139 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1139/1139 variables, and 508 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1130 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 438/455 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 19:04:14] [INFO ] Deduced a trap composed of 86 places in 105 ms of which 2 ms to minimize.
[2024-05-31 19:04:14] [INFO ] Deduced a trap composed of 129 places in 200 ms of which 4 ms to minimize.
[2024-05-31 19:04:15] [INFO ] Deduced a trap composed of 124 places in 176 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 41/496 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/496 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 643/1139 variables, 496/511 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1139 variables, 8/519 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 19:04:15] [INFO ] Deduced a trap composed of 96 places in 68 ms of which 1 ms to minimize.
[2024-05-31 19:04:15] [INFO ] Deduced a trap composed of 152 places in 120 ms of which 2 ms to minimize.
[2024-05-31 19:04:15] [INFO ] Deduced a trap composed of 123 places in 116 ms of which 2 ms to minimize.
[2024-05-31 19:04:15] [INFO ] Deduced a trap composed of 101 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1139 variables, 4/523 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 19:04:16] [INFO ] Deduced a trap composed of 29 places in 88 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1139 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1139 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/1139 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1139/1139 variables, and 524 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2286 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 8/8 constraints]
After SMT, in 3433ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 6 properties in 1703 ms.
Support contains 5 out of 496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 496/496 places, 643/643 transitions.
Graph (trivial) has 458 edges and 496 vertex of which 61 / 496 are part of one of the 10 SCC in 13 ms
Free SCC test removed 51 places
Drop transitions (Empty/Sink Transition effects.) removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 445 transition count 531
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 395 transition count 531
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 101 place count 395 transition count 502
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 159 place count 366 transition count 502
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 196 place count 329 transition count 465
Iterating global reduction 2 with 37 rules applied. Total rules applied 233 place count 329 transition count 465
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 235 place count 329 transition count 463
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 235 place count 329 transition count 462
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 237 place count 328 transition count 462
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 249 place count 316 transition count 450
Iterating global reduction 3 with 12 rules applied. Total rules applied 261 place count 316 transition count 450
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 272 place count 316 transition count 439
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 396 place count 254 transition count 377
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 416 place count 254 transition count 357
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 426 place count 244 transition count 347
Iterating global reduction 5 with 10 rules applied. Total rules applied 436 place count 244 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 437 place count 244 transition count 346
Free-agglomeration rule applied 184 times.
Iterating global reduction 6 with 184 rules applied. Total rules applied 621 place count 244 transition count 162
Reduce places removed 184 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Graph (complete) has 163 edges and 60 vertex of which 45 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 265 rules applied. Total rules applied 886 place count 45 transition count 82
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 907 place count 45 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 908 place count 44 transition count 60
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t5.t338.t498.t335.t336.t322 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 33 edges and 42 vertex of which 12 / 42 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Iterating post reduction 8 with 3 rules applied. Total rules applied 911 place count 36 transition count 58
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 923 place count 36 transition count 46
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 8 Pre rules applied. Total rules applied 923 place count 36 transition count 38
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 10 with 16 rules applied. Total rules applied 939 place count 28 transition count 38
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 946 place count 28 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 946 place count 28 transition count 30
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 948 place count 27 transition count 30
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 11 with 12 rules applied. Total rules applied 960 place count 21 transition count 24
Free-agglomeration rule applied 6 times.
Iterating global reduction 11 with 6 rules applied. Total rules applied 966 place count 21 transition count 18
Reduce places removed 9 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 15 rules applied. Total rules applied 981 place count 12 transition count 12
Applied a total of 981 rules in 147 ms. Remains 12 /496 variables (removed 484) and now considering 12/643 (removed 631) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 12/496 places, 12/643 transitions.
RANDOM walk for 77 steps (0 resets) in 4 ms. (15 steps per ms) remains 0/2 properties
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 12 stabilizing places and 12 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 496/496 places, 643/643 transitions.
Graph (trivial) has 462 edges and 496 vertex of which 61 / 496 are part of one of the 10 SCC in 1 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 444 transition count 540
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 394 transition count 540
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 101 place count 394 transition count 511
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 159 place count 365 transition count 511
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 198 place count 326 transition count 472
Iterating global reduction 2 with 39 rules applied. Total rules applied 237 place count 326 transition count 472
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 239 place count 326 transition count 470
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 239 place count 326 transition count 469
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 241 place count 325 transition count 469
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 253 place count 313 transition count 457
Iterating global reduction 3 with 12 rules applied. Total rules applied 265 place count 313 transition count 457
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 276 place count 313 transition count 446
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 398 place count 252 transition count 385
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 401 place count 249 transition count 382
Iterating global reduction 4 with 3 rules applied. Total rules applied 404 place count 249 transition count 382
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 407 place count 249 transition count 379
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 417 place count 249 transition count 369
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 419 place count 247 transition count 367
Applied a total of 419 rules in 137 ms. Remains 247 /496 variables (removed 249) and now considering 367/643 (removed 276) transitions.
[2024-05-31 19:04:18] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
// Phase 1: matrix 348 rows 247 cols
[2024-05-31 19:04:18] [INFO ] Computed 12 invariants in 5 ms
[2024-05-31 19:04:19] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-31 19:04:19] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-31 19:04:19] [INFO ] Invariant cache hit.
[2024-05-31 19:04:19] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2024-05-31 19:04:19] [INFO ] Redundant transitions in 18 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-31 19:04:19] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-31 19:04:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 10/247 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 347/594 variables, 247/259 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/594 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 0/594 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 594/595 variables, and 259 constraints, problems are : Problem set: 0 solved, 174 unsolved in 6396 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 10/247 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 347/594 variables, 247/259 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/594 variables, 174/433 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/594 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 0/594 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 594/595 variables, and 433 constraints, problems are : Problem set: 0 solved, 174 unsolved in 7408 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 0/0 constraints]
After SMT, in 13935ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 13938ms
Starting structural reductions in SI_LTL mode, iteration 1 : 247/496 places, 367/643 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14462 ms. Remains : 247/496 places, 367/643 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLCardinality-02
Product exploration explored 100000 steps with 6005 reset in 496 ms.
Stuttering criterion allowed to conclude after 4644 steps with 278 reset in 20 ms.
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLCardinality-02 finished in 15202 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 496/496 places, 643/643 transitions.
Graph (trivial) has 457 edges and 496 vertex of which 61 / 496 are part of one of the 10 SCC in 1 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 444 transition count 542
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 396 transition count 542
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 97 place count 396 transition count 515
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 151 place count 369 transition count 515
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 187 place count 333 transition count 479
Iterating global reduction 2 with 36 rules applied. Total rules applied 223 place count 333 transition count 479
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 224 place count 333 transition count 478
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 224 place count 333 transition count 477
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 226 place count 332 transition count 477
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 238 place count 320 transition count 465
Iterating global reduction 3 with 12 rules applied. Total rules applied 250 place count 320 transition count 465
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 260 place count 320 transition count 455
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 384 place count 258 transition count 393
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 387 place count 255 transition count 390
Iterating global reduction 4 with 3 rules applied. Total rules applied 390 place count 255 transition count 390
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 393 place count 255 transition count 387
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 403 place count 255 transition count 377
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 405 place count 253 transition count 375
Applied a total of 405 rules in 107 ms. Remains 253 /496 variables (removed 243) and now considering 375/643 (removed 268) transitions.
[2024-05-31 19:04:34] [INFO ] Flow matrix only has 356 transitions (discarded 19 similar events)
// Phase 1: matrix 356 rows 253 cols
[2024-05-31 19:04:34] [INFO ] Computed 12 invariants in 4 ms
[2024-05-31 19:04:34] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-31 19:04:34] [INFO ] Flow matrix only has 356 transitions (discarded 19 similar events)
[2024-05-31 19:04:34] [INFO ] Invariant cache hit.
[2024-05-31 19:04:34] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2024-05-31 19:04:34] [INFO ] Redundant transitions in 5 ms returned []
Running 180 sub problems to find dead transitions.
[2024-05-31 19:04:34] [INFO ] Flow matrix only has 356 transitions (discarded 19 similar events)
[2024-05-31 19:04:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 10/253 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-31 19:04:36] [INFO ] Deduced a trap composed of 96 places in 74 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 355/608 variables, 253/266 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/608 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (OVERLAPS) 0/608 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 608/609 variables, and 266 constraints, problems are : Problem set: 0 solved, 180 unsolved in 7557 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 10/253 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 355/608 variables, 253/266 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/608 variables, 180/446 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/608 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 0/608 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 608/609 variables, and 446 constraints, problems are : Problem set: 0 solved, 180 unsolved in 7476 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 1/1 constraints]
After SMT, in 15134ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 15137ms
Starting structural reductions in SI_LTL mode, iteration 1 : 253/496 places, 375/643 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15585 ms. Remains : 253/496 places, 375/643 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLCardinality-03
Product exploration explored 100000 steps with 6074 reset in 445 ms.
Product exploration explored 100000 steps with 6054 reset in 498 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, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2511 resets) in 755 ms. (52 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (44 resets) in 239 ms. (166 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1679393 steps, run timeout after 3001 ms. (steps per millisecond=559 ) properties seen :0 out of 1
Probabilistic random walk after 1679393 steps, saw 335483 distinct states, run finished after 3004 ms. (steps per millisecond=559 ) properties seen :0
[2024-05-31 19:04:54] [INFO ] Flow matrix only has 356 transitions (discarded 19 similar events)
[2024-05-31 19:04:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 133/137 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 226/363 variables, 137/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 175/538 variables, 74/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 42/580 variables, 7/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/580 variables, 14/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/580 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 28/608 variables, 28/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/608 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/608 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 608/609 variables, and 265 constraints, problems are : Problem set: 0 solved, 1 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 253/253 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 133/137 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 226/363 variables, 137/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 19:04:54] [INFO ] Deduced a trap composed of 96 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 175/538 variables, 74/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 42/580 variables, 7/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/580 variables, 14/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/580 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 28/608 variables, 28/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/608 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/608 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 608/609 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 371ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 128 steps, including 9 resets, run visited all 1 properties in 1 ms. (steps per millisecond=128 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 4 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 375/375 transitions.
Applied a total of 0 rules in 19 ms. Remains 253 /253 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2024-05-31 19:04:54] [INFO ] Flow matrix only has 356 transitions (discarded 19 similar events)
[2024-05-31 19:04:54] [INFO ] Invariant cache hit.
[2024-05-31 19:04:54] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-31 19:04:54] [INFO ] Flow matrix only has 356 transitions (discarded 19 similar events)
[2024-05-31 19:04:54] [INFO ] Invariant cache hit.
[2024-05-31 19:04:54] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2024-05-31 19:04:54] [INFO ] Redundant transitions in 2 ms returned []
Running 180 sub problems to find dead transitions.
[2024-05-31 19:04:54] [INFO ] Flow matrix only has 356 transitions (discarded 19 similar events)
[2024-05-31 19:04:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 10/253 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-31 19:04:56] [INFO ] Deduced a trap composed of 96 places in 76 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 355/608 variables, 253/266 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/608 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (OVERLAPS) 0/608 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 608/609 variables, and 266 constraints, problems are : Problem set: 0 solved, 180 unsolved in 7631 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 10/253 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 355/608 variables, 253/266 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/608 variables, 180/446 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/608 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 0/608 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 608/609 variables, and 446 constraints, problems are : Problem set: 0 solved, 180 unsolved in 7573 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 1/1 constraints]
After SMT, in 15299ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 15301ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15647 ms. Remains : 253/253 places, 375/375 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, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2502 resets) in 235 ms. (169 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (43 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1864724 steps, run timeout after 3001 ms. (steps per millisecond=621 ) properties seen :0 out of 1
Probabilistic random walk after 1864724 steps, saw 362672 distinct states, run finished after 3001 ms. (steps per millisecond=621 ) properties seen :0
[2024-05-31 19:05:13] [INFO ] Flow matrix only has 356 transitions (discarded 19 similar events)
[2024-05-31 19:05:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 133/137 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 226/363 variables, 137/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 175/538 variables, 74/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 42/580 variables, 7/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/580 variables, 14/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/580 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 28/608 variables, 28/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/608 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/608 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 608/609 variables, and 265 constraints, problems are : Problem set: 0 solved, 1 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 253/253 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 133/137 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 226/363 variables, 137/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/363 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 19:05:13] [INFO ] Deduced a trap composed of 96 places in 69 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/363 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/363 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 175/538 variables, 74/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 42/580 variables, 7/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/580 variables, 14/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/580 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 28/608 variables, 28/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/608 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/608 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 608/609 variables, and 267 constraints, problems are : Problem set: 0 solved, 1 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 472ms 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, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6043 reset in 384 ms.
Product exploration explored 100000 steps with 6045 reset in 386 ms.
Support contains 4 out of 253 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 253/253 places, 375/375 transitions.
Applied a total of 0 rules in 12 ms. Remains 253 /253 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2024-05-31 19:05:14] [INFO ] Flow matrix only has 356 transitions (discarded 19 similar events)
[2024-05-31 19:05:14] [INFO ] Invariant cache hit.
[2024-05-31 19:05:15] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-31 19:05:15] [INFO ] Flow matrix only has 356 transitions (discarded 19 similar events)
[2024-05-31 19:05:15] [INFO ] Invariant cache hit.
[2024-05-31 19:05:15] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2024-05-31 19:05:15] [INFO ] Redundant transitions in 1 ms returned []
Running 180 sub problems to find dead transitions.
[2024-05-31 19:05:15] [INFO ] Flow matrix only has 356 transitions (discarded 19 similar events)
[2024-05-31 19:05:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 10/253 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-31 19:05:17] [INFO ] Deduced a trap composed of 96 places in 74 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 355/608 variables, 253/266 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/608 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (OVERLAPS) 0/608 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 608/609 variables, and 266 constraints, problems are : Problem set: 0 solved, 180 unsolved in 7588 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 10/253 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (OVERLAPS) 355/608 variables, 253/266 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/608 variables, 180/446 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/608 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 0/608 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Int declared 608/609 variables, and 446 constraints, problems are : Problem set: 0 solved, 180 unsolved in 7710 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 1/1 constraints]
After SMT, in 15402ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 15404ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15878 ms. Remains : 253/253 places, 375/375 transitions.
Treatment of property FlexibleBarrier-PT-10b-LTLCardinality-03 finished in 56904 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)&&F(G(p1)))))'
Support contains 5 out of 496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 496/496 places, 643/643 transitions.
Graph (trivial) has 459 edges and 496 vertex of which 61 / 496 are part of one of the 10 SCC in 0 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 444 transition count 539
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 393 transition count 539
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 103 place count 393 transition count 510
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 161 place count 364 transition count 510
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 199 place count 326 transition count 472
Iterating global reduction 2 with 38 rules applied. Total rules applied 237 place count 326 transition count 472
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 239 place count 326 transition count 470
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 239 place count 326 transition count 469
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 241 place count 325 transition count 469
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 252 place count 314 transition count 458
Iterating global reduction 3 with 11 rules applied. Total rules applied 263 place count 314 transition count 458
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 273 place count 314 transition count 448
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 393 place count 254 transition count 388
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 396 place count 251 transition count 385
Iterating global reduction 4 with 3 rules applied. Total rules applied 399 place count 251 transition count 385
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 402 place count 251 transition count 382
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 412 place count 251 transition count 372
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 414 place count 249 transition count 370
Applied a total of 414 rules in 65 ms. Remains 249 /496 variables (removed 247) and now considering 370/643 (removed 273) transitions.
[2024-05-31 19:05:30] [INFO ] Flow matrix only has 351 transitions (discarded 19 similar events)
// Phase 1: matrix 351 rows 249 cols
[2024-05-31 19:05:30] [INFO ] Computed 12 invariants in 4 ms
[2024-05-31 19:05:31] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-31 19:05:31] [INFO ] Flow matrix only has 351 transitions (discarded 19 similar events)
[2024-05-31 19:05:31] [INFO ] Invariant cache hit.
[2024-05-31 19:05:31] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2024-05-31 19:05:31] [INFO ] Redundant transitions in 1 ms returned []
Running 176 sub problems to find dead transitions.
[2024-05-31 19:05:31] [INFO ] Flow matrix only has 351 transitions (discarded 19 similar events)
[2024-05-31 19:05:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 10/249 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 350/599 variables, 249/261 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/599 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (OVERLAPS) 0/599 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 599/600 variables, and 261 constraints, problems are : Problem set: 0 solved, 176 unsolved in 6591 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 10/249 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/249 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 350/599 variables, 249/261 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/599 variables, 176/437 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/599 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/599 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 599/600 variables, and 437 constraints, problems are : Problem set: 0 solved, 176 unsolved in 7626 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 0/0 constraints]
After SMT, in 14307ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 14310ms
Starting structural reductions in SI_LTL mode, iteration 1 : 249/496 places, 370/643 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14701 ms. Remains : 249/496 places, 370/643 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLCardinality-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLCardinality-05 finished in 14857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(p0))||G(p1))))'
Support contains 4 out of 496 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 496/496 places, 643/643 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 474 transition count 621
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 474 transition count 621
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 474 transition count 619
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 62 place count 458 transition count 603
Iterating global reduction 1 with 16 rules applied. Total rules applied 78 place count 458 transition count 603
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 87 place count 458 transition count 594
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 92 place count 453 transition count 589
Iterating global reduction 2 with 5 rules applied. Total rules applied 97 place count 453 transition count 589
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 102 place count 453 transition count 584
Applied a total of 102 rules in 25 ms. Remains 453 /496 variables (removed 43) and now considering 584/643 (removed 59) transitions.
// Phase 1: matrix 584 rows 453 cols
[2024-05-31 19:05:45] [INFO ] Computed 12 invariants in 9 ms
[2024-05-31 19:05:45] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-31 19:05:45] [INFO ] Invariant cache hit.
[2024-05-31 19:05:46] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
Running 583 sub problems to find dead transitions.
[2024-05-31 19:05:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 1 (OVERLAPS) 1/453 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 3 (OVERLAPS) 584/1037 variables, 453/465 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1037 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 583 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1037/1037 variables, and 465 constraints, problems are : Problem set: 0 solved, 583 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 453/453 constraints, PredecessorRefiner: 583/583 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 583 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 1 (OVERLAPS) 1/453 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 3 (OVERLAPS) 584/1037 variables, 453/465 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1037 variables, 583/1048 constraints. Problems are: Problem set: 0 solved, 583 unsolved
[2024-05-31 19:06:29] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 3 ms to minimize.
[2024-05-31 19:06:30] [INFO ] Deduced a trap composed of 90 places in 140 ms of which 3 ms to minimize.
[2024-05-31 19:06:31] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 3 ms to minimize.
[2024-05-31 19:06:32] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 3 ms to minimize.
[2024-05-31 19:06:32] [INFO ] Deduced a trap composed of 114 places in 117 ms of which 3 ms to minimize.
[2024-05-31 19:06:33] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 3 ms to minimize.
[2024-05-31 19:06:33] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 3 ms to minimize.
[2024-05-31 19:06:34] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 2 ms to minimize.
[2024-05-31 19:06:35] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 2 ms to minimize.
[2024-05-31 19:06:36] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 2 ms to minimize.
[2024-05-31 19:06:37] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 3 ms to minimize.
[2024-05-31 19:06:39] [INFO ] Deduced a trap composed of 355 places in 133 ms of which 2 ms to minimize.
[2024-05-31 19:06:39] [INFO ] Deduced a trap composed of 358 places in 145 ms of which 3 ms to minimize.
[2024-05-31 19:06:39] [INFO ] Deduced a trap composed of 355 places in 130 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1037 variables, 14/1062 constraints. Problems are: Problem set: 0 solved, 583 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1037/1037 variables, and 1062 constraints, problems are : Problem set: 0 solved, 583 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 453/453 constraints, PredecessorRefiner: 583/583 constraints, Known Traps: 14/14 constraints]
After SMT, in 60294ms problems are : Problem set: 0 solved, 583 unsolved
Search for dead transitions found 0 dead transitions in 60299ms
Starting structural reductions in LTL mode, iteration 1 : 453/496 places, 584/643 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60786 ms. Remains : 453/496 places, 584/643 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLCardinality-06
Stuttering criterion allowed to conclude after 15195 steps with 196 reset in 61 ms.
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLCardinality-06 finished in 60949 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&&F(p1)))))'
Support contains 3 out of 496 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 496/496 places, 643/643 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 475 transition count 622
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 475 transition count 622
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 475 transition count 620
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 60 place count 459 transition count 604
Iterating global reduction 1 with 16 rules applied. Total rules applied 76 place count 459 transition count 604
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 84 place count 459 transition count 596
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 89 place count 454 transition count 591
Iterating global reduction 2 with 5 rules applied. Total rules applied 94 place count 454 transition count 591
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 99 place count 454 transition count 586
Applied a total of 99 rules in 29 ms. Remains 454 /496 variables (removed 42) and now considering 586/643 (removed 57) transitions.
// Phase 1: matrix 586 rows 454 cols
[2024-05-31 19:06:46] [INFO ] Computed 12 invariants in 9 ms
[2024-05-31 19:06:46] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-31 19:06:46] [INFO ] Invariant cache hit.
[2024-05-31 19:06:47] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Running 585 sub problems to find dead transitions.
[2024-05-31 19:06:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 585 unsolved
At refinement iteration 1 (OVERLAPS) 1/454 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 585 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 585 unsolved
At refinement iteration 3 (OVERLAPS) 586/1040 variables, 454/466 constraints. Problems are: Problem set: 0 solved, 585 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1040 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 585 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1040/1040 variables, and 466 constraints, problems are : Problem set: 0 solved, 585 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 454/454 constraints, PredecessorRefiner: 585/585 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 585 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 585 unsolved
At refinement iteration 1 (OVERLAPS) 1/454 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 585 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/454 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 585 unsolved
At refinement iteration 3 (OVERLAPS) 586/1040 variables, 454/466 constraints. Problems are: Problem set: 0 solved, 585 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1040 variables, 585/1051 constraints. Problems are: Problem set: 0 solved, 585 unsolved
[2024-05-31 19:07:29] [INFO ] Deduced a trap composed of 112 places in 158 ms of which 3 ms to minimize.
[2024-05-31 19:07:30] [INFO ] Deduced a trap composed of 87 places in 152 ms of which 2 ms to minimize.
[2024-05-31 19:07:31] [INFO ] Deduced a trap composed of 90 places in 137 ms of which 3 ms to minimize.
[2024-05-31 19:07:32] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 3 ms to minimize.
[2024-05-31 19:07:33] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 2 ms to minimize.
[2024-05-31 19:07:34] [INFO ] Deduced a trap composed of 115 places in 126 ms of which 2 ms to minimize.
[2024-05-31 19:07:34] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 3 ms to minimize.
[2024-05-31 19:07:35] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 3 ms to minimize.
[2024-05-31 19:07:36] [INFO ] Deduced a trap composed of 96 places in 87 ms of which 2 ms to minimize.
[2024-05-31 19:07:37] [INFO ] Deduced a trap composed of 97 places in 90 ms of which 1 ms to minimize.
[2024-05-31 19:07:38] [INFO ] Deduced a trap composed of 97 places in 96 ms of which 2 ms to minimize.
[2024-05-31 19:07:39] [INFO ] Deduced a trap composed of 357 places in 133 ms of which 3 ms to minimize.
[2024-05-31 19:07:39] [INFO ] Deduced a trap composed of 359 places in 136 ms of which 3 ms to minimize.
[2024-05-31 19:07:40] [INFO ] Deduced a trap composed of 356 places in 147 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1040 variables, 14/1065 constraints. Problems are: Problem set: 0 solved, 585 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1040/1040 variables, and 1065 constraints, problems are : Problem set: 0 solved, 585 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 454/454 constraints, PredecessorRefiner: 585/585 constraints, Known Traps: 14/14 constraints]
After SMT, in 60307ms problems are : Problem set: 0 solved, 585 unsolved
Search for dead transitions found 0 dead transitions in 60313ms
Starting structural reductions in LTL mode, iteration 1 : 454/496 places, 586/643 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60818 ms. Remains : 454/496 places, 586/643 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 17419 steps with 223 reset in 33 ms.
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLCardinality-07 finished in 61016 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 496 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 496/496 places, 643/643 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 473 transition count 620
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 473 transition count 620
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 473 transition count 618
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 65 place count 456 transition count 601
Iterating global reduction 1 with 17 rules applied. Total rules applied 82 place count 456 transition count 601
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 456 transition count 592
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 96 place count 451 transition count 587
Iterating global reduction 2 with 5 rules applied. Total rules applied 101 place count 451 transition count 587
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 106 place count 451 transition count 582
Applied a total of 106 rules in 29 ms. Remains 451 /496 variables (removed 45) and now considering 582/643 (removed 61) transitions.
// Phase 1: matrix 582 rows 451 cols
[2024-05-31 19:07:47] [INFO ] Computed 12 invariants in 8 ms
[2024-05-31 19:07:47] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-31 19:07:47] [INFO ] Invariant cache hit.
[2024-05-31 19:07:48] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
Running 581 sub problems to find dead transitions.
[2024-05-31 19:07:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (OVERLAPS) 1/451 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/451 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 3 (OVERLAPS) 582/1033 variables, 451/463 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1033 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 581 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1033/1033 variables, and 463 constraints, problems are : Problem set: 0 solved, 581 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 451/451 constraints, PredecessorRefiner: 581/581 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 581 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/450 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 1 (OVERLAPS) 1/451 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/451 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 3 (OVERLAPS) 582/1033 variables, 451/463 constraints. Problems are: Problem set: 0 solved, 581 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1033 variables, 581/1044 constraints. Problems are: Problem set: 0 solved, 581 unsolved
[2024-05-31 19:08:30] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 4 ms to minimize.
[2024-05-31 19:08:31] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 3 ms to minimize.
[2024-05-31 19:08:32] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 3 ms to minimize.
[2024-05-31 19:08:33] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 3 ms to minimize.
[2024-05-31 19:08:34] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 2 ms to minimize.
[2024-05-31 19:08:35] [INFO ] Deduced a trap composed of 94 places in 133 ms of which 3 ms to minimize.
[2024-05-31 19:08:36] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 2 ms to minimize.
[2024-05-31 19:08:37] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-05-31 19:08:38] [INFO ] Deduced a trap composed of 98 places in 95 ms of which 2 ms to minimize.
[2024-05-31 19:08:39] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2024-05-31 19:08:40] [INFO ] Deduced a trap composed of 355 places in 135 ms of which 3 ms to minimize.
[2024-05-31 19:08:41] [INFO ] Deduced a trap composed of 355 places in 159 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1033 variables, 12/1056 constraints. Problems are: Problem set: 0 solved, 581 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1033/1033 variables, and 1056 constraints, problems are : Problem set: 0 solved, 581 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 451/451 constraints, PredecessorRefiner: 581/581 constraints, Known Traps: 12/12 constraints]
After SMT, in 60276ms problems are : Problem set: 0 solved, 581 unsolved
Search for dead transitions found 0 dead transitions in 60282ms
Starting structural reductions in LTL mode, iteration 1 : 451/496 places, 582/643 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60748 ms. Remains : 451/496 places, 582/643 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLCardinality-09 finished in 60873 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p1))))'
Support contains 3 out of 496 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 496/496 places, 643/643 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 473 transition count 620
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 473 transition count 620
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 473 transition count 619
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 65 place count 455 transition count 601
Iterating global reduction 1 with 18 rules applied. Total rules applied 83 place count 455 transition count 601
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 455 transition count 591
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 98 place count 450 transition count 586
Iterating global reduction 2 with 5 rules applied. Total rules applied 103 place count 450 transition count 586
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 108 place count 450 transition count 581
Applied a total of 108 rules in 26 ms. Remains 450 /496 variables (removed 46) and now considering 581/643 (removed 62) transitions.
// Phase 1: matrix 581 rows 450 cols
[2024-05-31 19:08:48] [INFO ] Computed 12 invariants in 4 ms
[2024-05-31 19:08:48] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-31 19:08:48] [INFO ] Invariant cache hit.
[2024-05-31 19:08:49] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2024-05-31 19:08:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (OVERLAPS) 1/450 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (OVERLAPS) 581/1031 variables, 450/462 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1031 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1031/1031 variables, and 462 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 450/450 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 580 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/449 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 1 (OVERLAPS) 1/450 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 3 (OVERLAPS) 581/1031 variables, 450/462 constraints. Problems are: Problem set: 0 solved, 580 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1031 variables, 580/1042 constraints. Problems are: Problem set: 0 solved, 580 unsolved
[2024-05-31 19:09:31] [INFO ] Deduced a trap composed of 87 places in 145 ms of which 4 ms to minimize.
[2024-05-31 19:09:32] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 2 ms to minimize.
[2024-05-31 19:09:32] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 3 ms to minimize.
[2024-05-31 19:09:33] [INFO ] Deduced a trap composed of 92 places in 133 ms of which 2 ms to minimize.
[2024-05-31 19:09:34] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 3 ms to minimize.
[2024-05-31 19:09:35] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 2 ms to minimize.
[2024-05-31 19:09:36] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 3 ms to minimize.
[2024-05-31 19:09:36] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 2 ms to minimize.
[2024-05-31 19:09:37] [INFO ] Deduced a trap composed of 97 places in 84 ms of which 1 ms to minimize.
[2024-05-31 19:09:38] [INFO ] Deduced a trap composed of 97 places in 74 ms of which 1 ms to minimize.
[2024-05-31 19:09:39] [INFO ] Deduced a trap composed of 355 places in 125 ms of which 3 ms to minimize.
[2024-05-31 19:09:39] [INFO ] Deduced a trap composed of 354 places in 130 ms of which 3 ms to minimize.
[2024-05-31 19:09:40] [INFO ] Deduced a trap composed of 355 places in 131 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1031 variables, 13/1055 constraints. Problems are: Problem set: 0 solved, 580 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1031/1031 variables, and 1055 constraints, problems are : Problem set: 0 solved, 580 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 450/450 constraints, PredecessorRefiner: 580/580 constraints, Known Traps: 13/13 constraints]
After SMT, in 60263ms problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 60268ms
Starting structural reductions in LTL mode, iteration 1 : 450/496 places, 581/643 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60749 ms. Remains : 450/496 places, 581/643 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 184 ms.
Product exploration explored 100000 steps with 50000 reset in 191 ms.
Computed a total of 12 stabilizing places and 12 stable transitions
Computed a total of 12 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-10b-LTLCardinality-10 finished in 61343 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&&F(p1))))))'
Support contains 3 out of 496 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 496/496 places, 643/643 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 472 transition count 619
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 472 transition count 619
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 472 transition count 617
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 68 place count 454 transition count 599
Iterating global reduction 1 with 18 rules applied. Total rules applied 86 place count 454 transition count 599
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 96 place count 454 transition count 589
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 101 place count 449 transition count 584
Iterating global reduction 2 with 5 rules applied. Total rules applied 106 place count 449 transition count 584
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 111 place count 449 transition count 579
Applied a total of 111 rules in 31 ms. Remains 449 /496 variables (removed 47) and now considering 579/643 (removed 64) transitions.
// Phase 1: matrix 579 rows 449 cols
[2024-05-31 19:09:49] [INFO ] Computed 12 invariants in 7 ms
[2024-05-31 19:09:50] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-31 19:09:50] [INFO ] Invariant cache hit.
[2024-05-31 19:09:50] [INFO ] Implicit Places using invariants and state equation in 394 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
Running 578 sub problems to find dead transitions.
[2024-05-31 19:09:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 1 (OVERLAPS) 1/449 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/449 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 3 (OVERLAPS) 579/1028 variables, 449/461 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1028 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1028/1028 variables, and 461 constraints, problems are : Problem set: 0 solved, 578 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 449/449 constraints, PredecessorRefiner: 578/578 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 578 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 1 (OVERLAPS) 1/449 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/449 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 3 (OVERLAPS) 579/1028 variables, 449/461 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1028 variables, 578/1039 constraints. Problems are: Problem set: 0 solved, 578 unsolved
[2024-05-31 19:10:33] [INFO ] Deduced a trap composed of 87 places in 143 ms of which 3 ms to minimize.
[2024-05-31 19:10:33] [INFO ] Deduced a trap composed of 90 places in 144 ms of which 3 ms to minimize.
[2024-05-31 19:10:34] [INFO ] Deduced a trap composed of 91 places in 143 ms of which 3 ms to minimize.
[2024-05-31 19:10:35] [INFO ] Deduced a trap composed of 92 places in 143 ms of which 3 ms to minimize.
[2024-05-31 19:10:38] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 2 ms to minimize.
[2024-05-31 19:10:38] [INFO ] Deduced a trap composed of 96 places in 87 ms of which 2 ms to minimize.
[2024-05-31 19:10:39] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 3 ms to minimize.
[2024-05-31 19:10:40] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 3 ms to minimize.
[2024-05-31 19:10:42] [INFO ] Deduced a trap composed of 354 places in 133 ms of which 3 ms to minimize.
[2024-05-31 19:10:42] [INFO ] Deduced a trap composed of 357 places in 133 ms of which 3 ms to minimize.
[2024-05-31 19:10:43] [INFO ] Deduced a trap composed of 376 places in 136 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1028 variables, 11/1050 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1028/1028 variables, and 1050 constraints, problems are : Problem set: 0 solved, 578 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 449/449 constraints, PredecessorRefiner: 578/578 constraints, Known Traps: 11/11 constraints]
After SMT, in 60284ms problems are : Problem set: 0 solved, 578 unsolved
Search for dead transitions found 0 dead transitions in 60290ms
Starting structural reductions in LTL mode, iteration 1 : 449/496 places, 579/643 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60876 ms. Remains : 449/496 places, 579/643 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 772 steps with 11 reset in 4 ms.
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLCardinality-12 finished in 61094 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&((p0 U p2) U X(!p3))))'
Support contains 7 out of 496 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 496/496 places, 643/643 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 475 transition count 622
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 475 transition count 622
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 475 transition count 620
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 60 place count 459 transition count 604
Iterating global reduction 1 with 16 rules applied. Total rules applied 76 place count 459 transition count 604
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 85 place count 459 transition count 595
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 89 place count 455 transition count 591
Iterating global reduction 2 with 4 rules applied. Total rules applied 93 place count 455 transition count 591
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 97 place count 455 transition count 587
Applied a total of 97 rules in 24 ms. Remains 455 /496 variables (removed 41) and now considering 587/643 (removed 56) transitions.
// Phase 1: matrix 587 rows 455 cols
[2024-05-31 19:10:51] [INFO ] Computed 12 invariants in 9 ms
[2024-05-31 19:10:51] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-31 19:10:51] [INFO ] Invariant cache hit.
[2024-05-31 19:10:51] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 586 sub problems to find dead transitions.
[2024-05-31 19:10:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 1 (OVERLAPS) 1/455 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 3 (OVERLAPS) 587/1042 variables, 455/467 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1042 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 586 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1042/1042 variables, and 467 constraints, problems are : Problem set: 0 solved, 586 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 455/455 constraints, PredecessorRefiner: 586/586 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 586 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 1 (OVERLAPS) 1/455 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 3 (OVERLAPS) 587/1042 variables, 455/467 constraints. Problems are: Problem set: 0 solved, 586 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1042 variables, 586/1053 constraints. Problems are: Problem set: 0 solved, 586 unsolved
[2024-05-31 19:11:34] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 3 ms to minimize.
[2024-05-31 19:11:35] [INFO ] Deduced a trap composed of 91 places in 146 ms of which 3 ms to minimize.
[2024-05-31 19:11:36] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 2 ms to minimize.
[2024-05-31 19:11:37] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 3 ms to minimize.
[2024-05-31 19:11:38] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 2 ms to minimize.
[2024-05-31 19:11:39] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 2 ms to minimize.
[2024-05-31 19:11:40] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 3 ms to minimize.
[2024-05-31 19:11:40] [INFO ] Deduced a trap composed of 96 places in 92 ms of which 2 ms to minimize.
[2024-05-31 19:11:41] [INFO ] Deduced a trap composed of 98 places in 90 ms of which 2 ms to minimize.
[2024-05-31 19:11:42] [INFO ] Deduced a trap composed of 97 places in 89 ms of which 2 ms to minimize.
[2024-05-31 19:11:44] [INFO ] Deduced a trap composed of 356 places in 132 ms of which 3 ms to minimize.
[2024-05-31 19:11:44] [INFO ] Deduced a trap composed of 360 places in 138 ms of which 2 ms to minimize.
[2024-05-31 19:11:45] [INFO ] Deduced a trap composed of 357 places in 125 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1042 variables, 13/1066 constraints. Problems are: Problem set: 0 solved, 586 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1042/1042 variables, and 1066 constraints, problems are : Problem set: 0 solved, 586 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 455/455 constraints, PredecessorRefiner: 586/586 constraints, Known Traps: 13/13 constraints]
After SMT, in 60288ms problems are : Problem set: 0 solved, 586 unsolved
Search for dead transitions found 0 dead transitions in 60294ms
Starting structural reductions in LTL mode, iteration 1 : 455/496 places, 587/643 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60759 ms. Remains : 455/496 places, 587/643 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p1) p3), true, p3, (NOT p1), (AND (NOT p2) p3), p3, (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLCardinality-13
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLCardinality-13 finished in 61083 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(p1)))'
Support contains 4 out of 496 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 496/496 places, 643/643 transitions.
Graph (trivial) has 458 edges and 496 vertex of which 61 / 496 are part of one of the 10 SCC in 1 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 444 transition count 541
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 99 place count 395 transition count 541
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 99 place count 395 transition count 513
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 155 place count 367 transition count 513
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 191 place count 331 transition count 477
Iterating global reduction 2 with 36 rules applied. Total rules applied 227 place count 331 transition count 477
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 229 place count 331 transition count 475
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 241 place count 319 transition count 463
Iterating global reduction 3 with 12 rules applied. Total rules applied 253 place count 319 transition count 463
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 264 place count 319 transition count 452
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 4 with 126 rules applied. Total rules applied 390 place count 256 transition count 389
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 392 place count 254 transition count 387
Iterating global reduction 4 with 2 rules applied. Total rules applied 394 place count 254 transition count 387
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 396 place count 254 transition count 385
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 406 place count 254 transition count 375
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 408 place count 252 transition count 373
Applied a total of 408 rules in 62 ms. Remains 252 /496 variables (removed 244) and now considering 373/643 (removed 270) transitions.
[2024-05-31 19:11:52] [INFO ] Flow matrix only has 354 transitions (discarded 19 similar events)
// Phase 1: matrix 354 rows 252 cols
[2024-05-31 19:11:52] [INFO ] Computed 12 invariants in 6 ms
[2024-05-31 19:11:52] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-31 19:11:52] [INFO ] Flow matrix only has 354 transitions (discarded 19 similar events)
[2024-05-31 19:11:52] [INFO ] Invariant cache hit.
[2024-05-31 19:11:52] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
[2024-05-31 19:11:52] [INFO ] Redundant transitions in 2 ms returned []
Running 179 sub problems to find dead transitions.
[2024-05-31 19:11:52] [INFO ] Flow matrix only has 354 transitions (discarded 19 similar events)
[2024-05-31 19:11:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 10/252 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-31 19:11:54] [INFO ] Deduced a trap composed of 98 places in 67 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 353/605 variables, 252/265 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/605 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 0/605 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 605/606 variables, and 265 constraints, problems are : Problem set: 0 solved, 179 unsolved in 7388 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 10/252 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 353/605 variables, 252/265 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/605 variables, 179/444 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/605 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 0/605 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 605/606 variables, and 444 constraints, problems are : Problem set: 0 solved, 179 unsolved in 7674 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 1/1 constraints]
After SMT, in 15162ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 15164ms
Starting structural reductions in SI_LTL mode, iteration 1 : 252/496 places, 373/643 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15566 ms. Remains : 252/496 places, 373/643 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLCardinality-15
Stuttering criterion allowed to conclude after 84576 steps with 5118 reset in 357 ms.
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLCardinality-15 finished in 16034 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-05-31 19:12:08] [INFO ] Flatten gal took : 26 ms
[2024-05-31 19:12:08] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-31 19:12:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 496 places, 643 transitions and 1829 arcs took 7 ms.
Total runtime 539025 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717183166097

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name FlexibleBarrier-PT-10b-LTLCardinality-03
ltl formula formula --ltl=/tmp/1276/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 496 places, 643 transitions and 1829 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.140 real 0.030 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1276/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1276/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1276/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1276/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 497 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 497, there are 681 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~376 levels ~10000 states ~25060 transitions
pnml2lts-mc( 2/ 4): ~376 levels ~20000 states ~52148 transitions
pnml2lts-mc( 3/ 4): ~441 levels ~40000 states ~117092 transitions
pnml2lts-mc( 3/ 4): ~558 levels ~80000 states ~260536 transitions
pnml2lts-mc( 3/ 4): ~722 levels ~160000 states ~516728 transitions
pnml2lts-mc( 3/ 4): ~3690 levels ~320000 states ~1119532 transitions
pnml2lts-mc( 3/ 4): ~7296 levels ~640000 states ~2304924 transitions
pnml2lts-mc( 3/ 4): ~7296 levels ~1280000 states ~4744796 transitions
pnml2lts-mc( 3/ 4): ~7296 levels ~2560000 states ~9702344 transitions
pnml2lts-mc( 0/ 4): ~6381 levels ~5120000 states ~20819540 transitions
pnml2lts-mc( 0/ 4): ~34583 levels ~10240000 states ~46010300 transitions
pnml2lts-mc( 0/ 4): ~111742 levels ~20480000 states ~97568396 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 3238863
pnml2lts-mc( 0/ 4): unique states count: 33520903
pnml2lts-mc( 0/ 4): unique transitions count: 159680159
pnml2lts-mc( 0/ 4): - self-loop count: 524948
pnml2lts-mc( 0/ 4): - claim dead count: 64246470
pnml2lts-mc( 0/ 4): - claim found count: 61208194
pnml2lts-mc( 0/ 4): - claim success count: 33520911
pnml2lts-mc( 0/ 4): - cum. max stack depth: 479938
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33520911 states 159680177 transitions, fanout: 4.764
pnml2lts-mc( 0/ 4): Total exploration time 436.810 sec (436.780 sec minimum, 436.797 sec on average)
pnml2lts-mc( 0/ 4): States per second: 76740, Transitions per second: 365560
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 284.7MB, 8.9 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/44.0%
pnml2lts-mc( 0/ 4): Stored 655 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 284.7MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-10b.tgz
mv FlexibleBarrier-PT-10b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;