Execution Chart

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

Trace from the execution

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

--------------------
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 1716418233012

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 22:50:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 22:50:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 22:50:34] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2024-05-22 22:50:34] [INFO ] Transformed 1402 places.
[2024-05-22 22:50:34] [INFO ] Transformed 1613 transitions.
[2024-05-22 22:50:34] [INFO ] Found NUPN structural information;
[2024-05-22 22:50:34] [INFO ] Parsed PT model containing 1402 places and 1613 transitions and 4025 arcs in 232 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 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 240 ms. Remains 496 /1402 variables (removed 906) and now considering 643/1613 (removed 970) transitions.
// Phase 1: matrix 643 rows 496 cols
[2024-05-22 22:50:34] [INFO ] Computed 12 invariants in 26 ms
[2024-05-22 22:50:35] [INFO ] Implicit Places using invariants in 408 ms returned []
[2024-05-22 22:50:35] [INFO ] Invariant cache hit.
[2024-05-22 22:50:35] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
Running 642 sub problems to find dead transitions.
[2024-05-22 22:50:35] [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-22 22:50:49] [INFO ] Deduced a trap composed of 399 places in 207 ms of which 31 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 30031 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-22 22:51:19] [INFO ] Deduced a trap composed of 125 places in 138 ms of which 3 ms to minimize.
[2024-05-22 22:51:20] [INFO ] Deduced a trap composed of 122 places in 128 ms of which 3 ms to minimize.
[2024-05-22 22:51:21] [INFO ] Deduced a trap composed of 88 places in 146 ms of which 4 ms to minimize.
[2024-05-22 22:51:23] [INFO ] Deduced a trap composed of 124 places in 141 ms of which 3 ms to minimize.
[2024-05-22 22:51:24] [INFO ] Deduced a trap composed of 96 places in 150 ms of which 3 ms to minimize.
[2024-05-22 22:51:25] [INFO ] Deduced a trap composed of 99 places in 139 ms of which 3 ms to minimize.
[2024-05-22 22:51:26] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 3 ms to minimize.
[2024-05-22 22:51:27] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 3 ms to minimize.
[2024-05-22 22:51:28] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 3 ms to minimize.
[2024-05-22 22:51:29] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 3 ms to minimize.
[2024-05-22 22:51:30] [INFO ] Deduced a trap composed of 102 places in 103 ms of which 2 ms to minimize.
[2024-05-22 22:51:32] [INFO ] Deduced a trap composed of 101 places in 83 ms of which 2 ms to minimize.
[2024-05-22 22:51:33] [INFO ] Deduced a trap composed of 372 places in 151 ms of which 3 ms to minimize.
[2024-05-22 22:51:33] [INFO ] Deduced a trap composed of 375 places in 142 ms of which 3 ms to minimize.
[2024-05-22 22:51:34] [INFO ] Deduced a trap composed of 372 places in 141 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1139/1139 variables, and 1166 constraints, problems are : Problem set: 0 solved, 642 unsolved in 30020 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 60458ms problems are : Problem set: 0 solved, 642 unsolved
Search for dead transitions found 0 dead transitions in 60479ms
Starting structural reductions in LTL mode, iteration 1 : 496/1402 places, 643/1613 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61584 ms. Remains : 496/1402 places, 643/1613 transitions.
Support contains 40 out of 496 places after structural reductions.
[2024-05-22 22:51:36] [INFO ] Flatten gal took : 77 ms
[2024-05-22 22:51:36] [INFO ] Flatten gal took : 34 ms
[2024-05-22 22:51:36] [INFO ] Input system was already deterministic with 643 transitions.
RANDOM walk for 40000 steps (518 resets) in 1788 ms. (22 steps per ms) remains 10/21 properties
BEST_FIRST walk for 40004 steps (61 resets) in 159 ms. (250 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (59 resets) in 70 ms. (563 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (63 resets) in 114 ms. (347 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (61 resets) in 86 ms. (459 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (63 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (63 resets) in 73 ms. (540 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (60 resets) in 83 ms. (476 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (61 resets) in 59 ms. (666 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (60 resets) in 38 ms. (1025 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40004 steps (59 resets) in 37 ms. (1052 steps per ms) remains 7/7 properties
[2024-05-22 22:51:37] [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, 7 unsolved
At refinement iteration 1 (OVERLAPS) 359/376 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 120/496 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/496 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 643/1139 variables, 496/508 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1139 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/1139 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1139/1139 variables, and 508 constraints, problems are : Problem set: 0 solved, 7 unsolved in 844 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 359/376 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 22:51:38] [INFO ] Deduced a trap composed of 124 places in 105 ms of which 2 ms to minimize.
[2024-05-22 22:51:38] [INFO ] Deduced a trap composed of 125 places in 108 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 120/496 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/496 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 643/1139 variables, 496/510 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1139 variables, 7/517 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1139 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/1139 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1139/1139 variables, and 517 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1045 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 496/496 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints]
After SMT, in 1898ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 6 properties in 585 ms.
Support contains 3 out of 496 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 496/496 places, 643/643 transitions.
Graph (trivial) has 461 edges and 496 vertex of which 61 / 496 are part of one of the 10 SCC in 3 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 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 445 transition count 530
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 394 transition count 530
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 30 Pre rules applied. Total rules applied 103 place count 394 transition count 500
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 163 place count 364 transition count 500
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 202 place count 325 transition count 461
Iterating global reduction 2 with 39 rules applied. Total rules applied 241 place count 325 transition count 461
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 243 place count 325 transition count 459
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 243 place count 325 transition count 458
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 245 place count 324 transition count 458
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 257 place count 312 transition count 446
Iterating global reduction 3 with 12 rules applied. Total rules applied 269 place count 312 transition count 446
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 281 place count 312 transition count 434
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 405 place count 250 transition count 372
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 425 place count 250 transition count 352
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 436 place count 239 transition count 341
Iterating global reduction 5 with 11 rules applied. Total rules applied 447 place count 239 transition count 341
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 449 place count 239 transition count 339
Free-agglomeration rule applied 182 times.
Iterating global reduction 6 with 182 rules applied. Total rules applied 631 place count 239 transition count 157
Reduce places removed 182 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Graph (complete) has 154 edges and 57 vertex of which 32 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 263 rules applied. Total rules applied 894 place count 32 transition count 77
Drop transitions (Empty/Sink Transition effects.) removed 35 transitions
Reduce isomorphic transitions removed 35 transitions.
Iterating post reduction 7 with 35 rules applied. Total rules applied 929 place count 32 transition count 42
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 930 place count 31 transition count 41
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 23 edges and 29 vertex of which 8 / 29 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 3 rules applied. Total rules applied 933 place count 25 transition count 39
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 941 place count 25 transition count 31
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 6 Pre rules applied. Total rules applied 941 place count 25 transition count 25
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 10 with 12 rules applied. Total rules applied 953 place count 19 transition count 25
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 958 place count 19 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 958 place count 19 transition count 19
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 960 place count 18 transition count 19
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 968 place count 14 transition count 15
Free-agglomeration rule applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 972 place count 14 transition count 11
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 11 rules applied. Total rules applied 983 place count 7 transition count 7
Applied a total of 983 rules in 146 ms. Remains 7 /496 variables (removed 489) and now considering 7/643 (removed 636) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 7/496 places, 7/643 transitions.
RANDOM walk for 96 steps (0 resets) in 4 ms. (19 steps per ms) remains 0/1 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 150 ms. Remains 247 /496 variables (removed 249) and now considering 367/643 (removed 276) transitions.
[2024-05-22 22:51:40] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
// Phase 1: matrix 348 rows 247 cols
[2024-05-22 22:51:40] [INFO ] Computed 12 invariants in 6 ms
[2024-05-22 22:51:40] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-22 22:51:40] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-22 22:51:40] [INFO ] Invariant cache hit.
[2024-05-22 22:51:40] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-05-22 22:51:40] [INFO ] Redundant transitions in 20 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-22 22:51:40] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-22 22:51:40] [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 6292 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 7285 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 13686ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 13688ms
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 14185 ms. Remains : 247/496 places, 367/643 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLCardinality-02
Product exploration explored 100000 steps with 6012 reset in 498 ms.
Stuttering criterion allowed to conclude after 3497 steps with 206 reset in 16 ms.
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLCardinality-02 finished in 14918 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 1 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 112 ms. Remains 253 /496 variables (removed 243) and now considering 375/643 (removed 268) transitions.
[2024-05-22 22:51:55] [INFO ] Flow matrix only has 356 transitions (discarded 19 similar events)
// Phase 1: matrix 356 rows 253 cols
[2024-05-22 22:51:55] [INFO ] Computed 12 invariants in 5 ms
[2024-05-22 22:51:55] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-22 22:51:55] [INFO ] Flow matrix only has 356 transitions (discarded 19 similar events)
[2024-05-22 22:51:55] [INFO ] Invariant cache hit.
[2024-05-22 22:51:55] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
[2024-05-22 22:51:55] [INFO ] Redundant transitions in 5 ms returned []
Running 180 sub problems to find dead transitions.
[2024-05-22 22:51:55] [INFO ] Flow matrix only has 356 transitions (discarded 19 similar events)
[2024-05-22 22:51:55] [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-22 22:51:57] [INFO ] Deduced a trap composed of 96 places in 75 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 7595 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 7790 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 15490ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 15492ms
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 16065 ms. Remains : 253/496 places, 375/643 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLCardinality-03
Product exploration explored 100000 steps with 6055 reset in 386 ms.
Product exploration explored 100000 steps with 6055 reset in 387 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 71 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 39090 steps (2439 resets) in 1180 ms. (33 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 108 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 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 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 20 ms. Remains 253 /253 variables (removed 0) and now considering 375/375 (removed 0) transitions.
[2024-05-22 22:52:12] [INFO ] Flow matrix only has 356 transitions (discarded 19 similar events)
[2024-05-22 22:52:12] [INFO ] Invariant cache hit.
[2024-05-22 22:52:13] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-22 22:52:13] [INFO ] Flow matrix only has 356 transitions (discarded 19 similar events)
[2024-05-22 22:52:13] [INFO ] Invariant cache hit.
[2024-05-22 22:52:13] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 508 ms to find 0 implicit places.
[2024-05-22 22:52:13] [INFO ] Redundant transitions in 5 ms returned []
Running 180 sub problems to find dead transitions.
[2024-05-22 22:52:13] [INFO ] Flow matrix only has 356 transitions (discarded 19 similar events)
[2024-05-22 22:52:13] [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-22 22:52:15] [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 7602 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 7822 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 15523ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 15524ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16063 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 71 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 34 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2507 resets) in 274 ms. (145 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (42 resets) in 91 ms. (434 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1636994 steps, run timeout after 3001 ms. (steps per millisecond=545 ) properties seen :0 out of 1
Probabilistic random walk after 1636994 steps, saw 324919 distinct states, run finished after 3008 ms. (steps per millisecond=544 ) properties seen :0
[2024-05-22 22:52:32] [INFO ] Flow matrix only has 356 transitions (discarded 19 similar events)
[2024-05-22 22:52:32] [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 140 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-22 22:52:32] [INFO ] Deduced a trap composed of 96 places in 51 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 219 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 381ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 91 steps, including 6 resets, run visited all 1 properties in 1 ms. (steps per millisecond=91 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 108 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 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6041 reset in 398 ms.
Product exploration explored 100000 steps with 6023 reset in 408 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-22 22:52:33] [INFO ] Flow matrix only has 356 transitions (discarded 19 similar events)
[2024-05-22 22:52:33] [INFO ] Invariant cache hit.
[2024-05-22 22:52:33] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-22 22:52:33] [INFO ] Flow matrix only has 356 transitions (discarded 19 similar events)
[2024-05-22 22:52:33] [INFO ] Invariant cache hit.
[2024-05-22 22:52:34] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2024-05-22 22:52:34] [INFO ] Redundant transitions in 2 ms returned []
Running 180 sub problems to find dead transitions.
[2024-05-22 22:52:34] [INFO ] Flow matrix only has 356 transitions (discarded 19 similar events)
[2024-05-22 22:52: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-22 22:52:35] [INFO ] Deduced a trap composed of 96 places in 72 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 7499 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 7891 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 15488ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 15490ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15934 ms. Remains : 253/253 places, 375/375 transitions.
Treatment of property FlexibleBarrier-PT-10b-LTLCardinality-03 finished in 54283 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 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 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 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 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 67 ms. Remains 249 /496 variables (removed 247) and now considering 370/643 (removed 273) transitions.
[2024-05-22 22:52:49] [INFO ] Flow matrix only has 351 transitions (discarded 19 similar events)
// Phase 1: matrix 351 rows 249 cols
[2024-05-22 22:52:49] [INFO ] Computed 12 invariants in 5 ms
[2024-05-22 22:52:49] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-22 22:52:49] [INFO ] Flow matrix only has 351 transitions (discarded 19 similar events)
[2024-05-22 22:52:49] [INFO ] Invariant cache hit.
[2024-05-22 22:52:50] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2024-05-22 22:52:50] [INFO ] Redundant transitions in 1 ms returned []
Running 176 sub problems to find dead transitions.
[2024-05-22 22:52:50] [INFO ] Flow matrix only has 351 transitions (discarded 19 similar events)
[2024-05-22 22:52:50] [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 6391 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 7304 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 13784ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 13786ms
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 14162 ms. Remains : 249/496 places, 370/643 transitions.
Stuttering acceptance computed with spot in 129 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 1 ms.
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLCardinality-05 finished in 14371 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-22 22:53:04] [INFO ] Computed 12 invariants in 10 ms
[2024-05-22 22:53:04] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-22 22:53:04] [INFO ] Invariant cache hit.
[2024-05-22 22:53:04] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
Running 583 sub problems to find dead transitions.
[2024-05-22 22:53:04] [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
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 1037/1037 variables, and 465 constraints, problems are : Problem set: 0 solved, 583 unsolved in 30022 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-22 22:53:47] [INFO ] Deduced a trap composed of 87 places in 133 ms of which 3 ms to minimize.
[2024-05-22 22:53:48] [INFO ] Deduced a trap composed of 90 places in 156 ms of which 3 ms to minimize.
[2024-05-22 22:53:49] [INFO ] Deduced a trap composed of 92 places in 133 ms of which 3 ms to minimize.
[2024-05-22 22:53:50] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 2 ms to minimize.
[2024-05-22 22:53:51] [INFO ] Deduced a trap composed of 114 places in 110 ms of which 3 ms to minimize.
[2024-05-22 22:53:51] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 2 ms to minimize.
[2024-05-22 22:53:52] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 2 ms to minimize.
[2024-05-22 22:53:53] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 2 ms to minimize.
[2024-05-22 22:53:54] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 3 ms to minimize.
[2024-05-22 22:53:55] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 2 ms to minimize.
[2024-05-22 22:53:55] [INFO ] Deduced a trap composed of 98 places in 107 ms of which 3 ms to minimize.
[2024-05-22 22:53:57] [INFO ] Deduced a trap composed of 355 places in 123 ms of which 3 ms to minimize.
[2024-05-22 22:53:57] [INFO ] Deduced a trap composed of 358 places in 137 ms of which 3 ms to minimize.
[2024-05-22 22:53:58] [INFO ] Deduced a trap composed of 355 places in 124 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 30018 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 60286ms problems are : Problem set: 0 solved, 583 unsolved
Search for dead transitions found 0 dead transitions in 60291ms
Starting structural reductions in LTL mode, iteration 1 : 453/496 places, 584/643 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60843 ms. Remains : 453/496 places, 584/643 transitions.
Stuttering acceptance computed with spot in 78 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 23150 steps with 301 reset in 66 ms.
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLCardinality-06 finished in 61002 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 26 ms. Remains 454 /496 variables (removed 42) and now considering 586/643 (removed 57) transitions.
// Phase 1: matrix 586 rows 454 cols
[2024-05-22 22:54:05] [INFO ] Computed 12 invariants in 6 ms
[2024-05-22 22:54:05] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-22 22:54:05] [INFO ] Invariant cache hit.
[2024-05-22 22:54:05] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
Running 585 sub problems to find dead transitions.
[2024-05-22 22:54:05] [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
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 30019 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-22 22:54:48] [INFO ] Deduced a trap composed of 112 places in 153 ms of which 3 ms to minimize.
[2024-05-22 22:54:48] [INFO ] Deduced a trap composed of 87 places in 133 ms of which 3 ms to minimize.
[2024-05-22 22:54:49] [INFO ] Deduced a trap composed of 90 places in 131 ms of which 3 ms to minimize.
[2024-05-22 22:54:51] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 3 ms to minimize.
[2024-05-22 22:54:51] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 2 ms to minimize.
[2024-05-22 22:54:52] [INFO ] Deduced a trap composed of 115 places in 117 ms of which 2 ms to minimize.
[2024-05-22 22:54:53] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 2 ms to minimize.
[2024-05-22 22:54:53] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2024-05-22 22:54:54] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 2 ms to minimize.
[2024-05-22 22:54:55] [INFO ] Deduced a trap composed of 97 places in 83 ms of which 2 ms to minimize.
[2024-05-22 22:54:56] [INFO ] Deduced a trap composed of 97 places in 77 ms of which 2 ms to minimize.
[2024-05-22 22:54:57] [INFO ] Deduced a trap composed of 357 places in 125 ms of which 2 ms to minimize.
[2024-05-22 22:54:57] [INFO ] Deduced a trap composed of 359 places in 126 ms of which 3 ms to minimize.
[2024-05-22 22:54:58] [INFO ] Deduced a trap composed of 356 places in 121 ms of which 3 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 30020 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 60272ms problems are : Problem set: 0 solved, 585 unsolved
Search for dead transitions found 0 dead transitions in 60277ms
Starting structural reductions in LTL mode, iteration 1 : 454/496 places, 586/643 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60769 ms. Remains : 454/496 places, 586/643 transitions.
Stuttering acceptance computed with spot in 135 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
Product exploration explored 100000 steps with 1294 reset in 217 ms.
Entered a terminal (fully accepting) state of product in 68530 steps with 890 reset in 153 ms.
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLCardinality-07 finished in 61291 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 25 ms. Remains 451 /496 variables (removed 45) and now considering 582/643 (removed 61) transitions.
// Phase 1: matrix 582 rows 451 cols
[2024-05-22 22:55:06] [INFO ] Computed 12 invariants in 5 ms
[2024-05-22 22:55:06] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-22 22:55:06] [INFO ] Invariant cache hit.
[2024-05-22 22:55:06] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Running 581 sub problems to find dead transitions.
[2024-05-22 22:55:06] [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
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
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 30017 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-22 22:55:49] [INFO ] Deduced a trap composed of 87 places in 145 ms of which 4 ms to minimize.
[2024-05-22 22:55:50] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 3 ms to minimize.
[2024-05-22 22:55:50] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 2 ms to minimize.
[2024-05-22 22:55:51] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 3 ms to minimize.
[2024-05-22 22:55:52] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 3 ms to minimize.
[2024-05-22 22:55:53] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 3 ms to minimize.
[2024-05-22 22:55:54] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 4 ms to minimize.
[2024-05-22 22:55:55] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-05-22 22:55:56] [INFO ] Deduced a trap composed of 98 places in 95 ms of which 3 ms to minimize.
[2024-05-22 22:55:57] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 2 ms to minimize.
[2024-05-22 22:55:58] [INFO ] Deduced a trap composed of 355 places in 130 ms of which 3 ms to minimize.
[2024-05-22 22:55:59] [INFO ] Deduced a trap composed of 355 places in 130 ms of which 2 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 30025 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 60286ms problems are : Problem set: 0 solved, 581 unsolved
Search for dead transitions found 0 dead transitions in 60291ms
Starting structural reductions in LTL mode, iteration 1 : 451/496 places, 582/643 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60769 ms. Remains : 451/496 places, 582/643 transitions.
Stuttering acceptance computed with spot in 89 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 42 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLCardinality-09 finished in 60881 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 35 ms. Remains 450 /496 variables (removed 46) and now considering 581/643 (removed 62) transitions.
// Phase 1: matrix 581 rows 450 cols
[2024-05-22 22:56:07] [INFO ] Computed 12 invariants in 5 ms
[2024-05-22 22:56:07] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-22 22:56:07] [INFO ] Invariant cache hit.
[2024-05-22 22:56:07] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
Running 580 sub problems to find dead transitions.
[2024-05-22 22:56:07] [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 30016 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-22 22:56:50] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 2 ms to minimize.
[2024-05-22 22:56:51] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 3 ms to minimize.
[2024-05-22 22:56:51] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 2 ms to minimize.
[2024-05-22 22:56:52] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 2 ms to minimize.
[2024-05-22 22:56:53] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2024-05-22 22:56:54] [INFO ] Deduced a trap composed of 94 places in 94 ms of which 2 ms to minimize.
[2024-05-22 22:56:55] [INFO ] Deduced a trap composed of 95 places in 102 ms of which 2 ms to minimize.
[2024-05-22 22:56:56] [INFO ] Deduced a trap composed of 96 places in 84 ms of which 2 ms to minimize.
[2024-05-22 22:56:56] [INFO ] Deduced a trap composed of 97 places in 83 ms of which 2 ms to minimize.
[2024-05-22 22:56:57] [INFO ] Deduced a trap composed of 97 places in 68 ms of which 2 ms to minimize.
[2024-05-22 22:56:59] [INFO ] Deduced a trap composed of 355 places in 136 ms of which 3 ms to minimize.
[2024-05-22 22:56:59] [INFO ] Deduced a trap composed of 354 places in 131 ms of which 2 ms to minimize.
[2024-05-22 22:56:59] [INFO ] Deduced a trap composed of 355 places in 123 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1031 variables, 13/1055 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 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 60256ms problems are : Problem set: 0 solved, 580 unsolved
Search for dead transitions found 0 dead transitions in 60261ms
Starting structural reductions in LTL mode, iteration 1 : 450/496 places, 581/643 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60764 ms. Remains : 450/496 places, 581/643 transitions.
Stuttering acceptance computed with spot in 77 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 207 ms.
Product exploration explored 100000 steps with 50000 reset in 173 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 13 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 61273 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 23 ms. Remains 449 /496 variables (removed 47) and now considering 579/643 (removed 64) transitions.
// Phase 1: matrix 579 rows 449 cols
[2024-05-22 22:57:08] [INFO ] Computed 12 invariants in 7 ms
[2024-05-22 22:57:08] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-22 22:57:08] [INFO ] Invariant cache hit.
[2024-05-22 22:57:08] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
Running 578 sub problems to find dead transitions.
[2024-05-22 22:57:08] [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 30019 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-22 22:57:51] [INFO ] Deduced a trap composed of 87 places in 143 ms of which 3 ms to minimize.
[2024-05-22 22:57:52] [INFO ] Deduced a trap composed of 90 places in 140 ms of which 3 ms to minimize.
[2024-05-22 22:57:53] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 3 ms to minimize.
[2024-05-22 22:57:54] [INFO ] Deduced a trap composed of 92 places in 141 ms of which 3 ms to minimize.
[2024-05-22 22:57:56] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
[2024-05-22 22:57:57] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-05-22 22:57:58] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 2 ms to minimize.
[2024-05-22 22:57:59] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2024-05-22 22:58:00] [INFO ] Deduced a trap composed of 354 places in 126 ms of which 2 ms to minimize.
[2024-05-22 22:58:00] [INFO ] Deduced a trap composed of 357 places in 121 ms of which 3 ms to minimize.
[2024-05-22 22:58:01] [INFO ] Deduced a trap composed of 376 places in 131 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1028 variables, 11/1050 constraints. Problems are: Problem set: 0 solved, 578 unsolved
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 30019 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 60256ms problems are : Problem set: 0 solved, 578 unsolved
Search for dead transitions found 0 dead transitions in 60261ms
Starting structural reductions in LTL mode, iteration 1 : 449/496 places, 579/643 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60739 ms. Remains : 449/496 places, 579/643 transitions.
Stuttering acceptance computed with spot in 185 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 2200 steps with 35 reset in 8 ms.
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLCardinality-12 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' '!(((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 27 ms. Remains 455 /496 variables (removed 41) and now considering 587/643 (removed 56) transitions.
// Phase 1: matrix 587 rows 455 cols
[2024-05-22 22:58:09] [INFO ] Computed 12 invariants in 7 ms
[2024-05-22 22:58:09] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-22 22:58:09] [INFO ] Invariant cache hit.
[2024-05-22 22:58:09] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
Running 586 sub problems to find dead transitions.
[2024-05-22 22:58:09] [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
(s363 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 1.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 1.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0timeout
)
(s364 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30024 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-22 22:58:53] [INFO ] Deduced a trap composed of 87 places in 131 ms of which 3 ms to minimize.
[2024-05-22 22:58:53] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 3 ms to minimize.
[2024-05-22 22:58:55] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 2 ms to minimize.
[2024-05-22 22:58:56] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 3 ms to minimize.
[2024-05-22 22:58:57] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 3 ms to minimize.
[2024-05-22 22:58:58] [INFO ] Deduced a trap composed of 94 places in 92 ms of which 2 ms to minimize.
[2024-05-22 22:58:59] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 3 ms to minimize.
[2024-05-22 22:59:00] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 2 ms to minimize.
[2024-05-22 22:59:00] [INFO ] Deduced a trap composed of 98 places in 85 ms of which 2 ms to minimize.
[2024-05-22 22:59:01] [INFO ] Deduced a trap composed of 97 places in 87 ms of which 2 ms to minimize.
[2024-05-22 22:59:03] [INFO ] Deduced a trap composed of 356 places in 130 ms of which 3 ms to minimize.
[2024-05-22 22:59:03] [INFO ] Deduced a trap composed of 360 places in 127 ms of which 3 ms to minimize.
[2024-05-22 22:59:04] [INFO ] Deduced a trap composed of 357 places in 127 ms of which 2 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 30022 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 60286ms problems are : Problem set: 0 solved, 586 unsolved
Search for dead transitions found 0 dead transitions in 60291ms
Starting structural reductions in LTL mode, iteration 1 : 455/496 places, 587/643 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60764 ms. Remains : 455/496 places, 587/643 transitions.
Stuttering acceptance computed with spot in 291 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 77 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 61084 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 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 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 0 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 61 ms. Remains 252 /496 variables (removed 244) and now considering 373/643 (removed 270) transitions.
[2024-05-22 22:59:10] [INFO ] Flow matrix only has 354 transitions (discarded 19 similar events)
// Phase 1: matrix 354 rows 252 cols
[2024-05-22 22:59:10] [INFO ] Computed 12 invariants in 5 ms
[2024-05-22 22:59:10] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-22 22:59:10] [INFO ] Flow matrix only has 354 transitions (discarded 19 similar events)
[2024-05-22 22:59:10] [INFO ] Invariant cache hit.
[2024-05-22 22:59:10] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2024-05-22 22:59:10] [INFO ] Redundant transitions in 1 ms returned []
Running 179 sub problems to find dead transitions.
[2024-05-22 22:59:10] [INFO ] Flow matrix only has 354 transitions (discarded 19 similar events)
[2024-05-22 22:59:10] [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-22 22:59:12] [INFO ] Deduced a trap composed of 98 places in 74 ms of which 1 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 7603 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 7710 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 15403ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 15405ms
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 15796 ms. Remains : 252/496 places, 373/643 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLCardinality-15
Product exploration explored 100000 steps with 6016 reset in 415 ms.
Stuttering criterion allowed to conclude after 92294 steps with 5553 reset in 387 ms.
FORMULA FlexibleBarrier-PT-10b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLCardinality-15 finished in 16714 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-22 22:59:27] [INFO ] Flatten gal took : 28 ms
[2024-05-22 22:59:27] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-22 22:59:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 496 places, 643 transitions and 1829 arcs took 9 ms.
Total runtime 533268 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FlexibleBarrier-PT-10b

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 1325
MODEL NAME: /home/mcc/execution/413/model
496 places, 643 transitions.

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

BK_STOP 1716419150491

--------------------
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
MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is FlexibleBarrier-PT-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 r179-tall-171640600700059"
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 ;