Execution Chart

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

Trace from the execution

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

--------------------
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-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-10b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717182210161

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-10b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 19:03:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 19:03:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:03:31] [INFO ] Load time of PNML (sax parser for PT used): 123 ms
[2024-05-31 19:03:31] [INFO ] Transformed 1402 places.
[2024-05-31 19:03:31] [INFO ] Transformed 1613 transitions.
[2024-05-31 19:03:31] [INFO ] Found NUPN structural information;
[2024-05-31 19:03:31] [INFO ] Parsed PT model containing 1402 places and 1613 transitions and 4025 arcs in 238 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 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 236 places :
Symmetric choice reduction at 0 with 236 rule applications. Total rules 1296 place count 636 transition count 847
Iterating global reduction 0 with 236 rules applied. Total rules applied 1532 place count 636 transition count 847
Discarding 146 places :
Symmetric choice reduction at 0 with 146 rule applications. Total rules 1678 place count 490 transition count 701
Iterating global reduction 0 with 146 rules applied. Total rules applied 1824 place count 490 transition count 701
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Iterating post reduction 0 with 66 rules applied. Total rules applied 1890 place count 490 transition count 635
Applied a total of 1890 rules in 226 ms. Remains 490 /1402 variables (removed 912) and now considering 635/1613 (removed 978) transitions.
// Phase 1: matrix 635 rows 490 cols
[2024-05-31 19:03:32] [INFO ] Computed 12 invariants in 29 ms
[2024-05-31 19:03:32] [INFO ] Implicit Places using invariants in 405 ms returned []
[2024-05-31 19:03:32] [INFO ] Invariant cache hit.
[2024-05-31 19:03:32] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 809 ms to find 0 implicit places.
Running 634 sub problems to find dead transitions.
[2024-05-31 19:03:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 1 (OVERLAPS) 1/490 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/490 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 3 (OVERLAPS) 635/1125 variables, 490/502 constraints. Problems are: Problem set: 0 solved, 634 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1125/1125 variables, and 502 constraints, problems are : Problem set: 0 solved, 634 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 490/490 constraints, PredecessorRefiner: 634/634 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 634 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 1 (OVERLAPS) 1/490 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/490 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 3 (OVERLAPS) 635/1125 variables, 490/502 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1125 variables, 634/1136 constraints. Problems are: Problem set: 0 solved, 634 unsolved
[2024-05-31 19:04:16] [INFO ] Deduced a trap composed of 124 places in 167 ms of which 27 ms to minimize.
[2024-05-31 19:04:18] [INFO ] Deduced a trap composed of 225 places in 179 ms of which 4 ms to minimize.
[2024-05-31 19:04:18] [INFO ] Deduced a trap composed of 89 places in 162 ms of which 4 ms to minimize.
[2024-05-31 19:04:19] [INFO ] Deduced a trap composed of 93 places in 142 ms of which 3 ms to minimize.
[2024-05-31 19:04:20] [INFO ] Deduced a trap composed of 95 places in 144 ms of which 3 ms to minimize.
[2024-05-31 19:04:21] [INFO ] Deduced a trap composed of 95 places in 147 ms of which 3 ms to minimize.
[2024-05-31 19:04:23] [INFO ] Deduced a trap composed of 95 places in 147 ms of which 3 ms to minimize.
[2024-05-31 19:04:24] [INFO ] Deduced a trap composed of 125 places in 136 ms of which 4 ms to minimize.
[2024-05-31 19:04:27] [INFO ] Deduced a trap composed of 99 places in 116 ms of which 2 ms to minimize.
[2024-05-31 19:04:28] [INFO ] Deduced a trap composed of 100 places in 73 ms of which 2 ms to minimize.
[2024-05-31 19:04:29] [INFO ] Deduced a trap composed of 125 places in 92 ms of which 2 ms to minimize.
[2024-05-31 19:04:30] [INFO ] Deduced a trap composed of 124 places in 132 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1125/1125 variables, and 1148 constraints, problems are : Problem set: 0 solved, 634 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 490/490 constraints, PredecessorRefiner: 634/634 constraints, Known Traps: 12/12 constraints]
After SMT, in 60463ms problems are : Problem set: 0 solved, 634 unsolved
Search for dead transitions found 0 dead transitions in 60600ms
Starting structural reductions in LTL mode, iteration 1 : 490/1402 places, 635/1613 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61667 ms. Remains : 490/1402 places, 635/1613 transitions.
Support contains 36 out of 490 places after structural reductions.
[2024-05-31 19:04:33] [INFO ] Flatten gal took : 62 ms
[2024-05-31 19:04:33] [INFO ] Flatten gal took : 30 ms
[2024-05-31 19:04:33] [INFO ] Input system was already deterministic with 635 transitions.
Support contains 34 out of 490 places (down from 36) after GAL structural reductions.
RANDOM walk for 40000 steps (524 resets) in 2673 ms. (14 steps per ms) remains 17/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
[2024-05-31 19:04:34] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 320/338 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-31 19:04:34] [INFO ] Deduced a trap composed of 79 places in 49 ms of which 1 ms to minimize.
[2024-05-31 19:04:34] [INFO ] Deduced a trap composed of 124 places in 107 ms of which 2 ms to minimize.
[2024-05-31 19:04:35] [INFO ] Deduced a trap composed of 127 places in 111 ms of which 2 ms to minimize.
[2024-05-31 19:04:35] [INFO ] Deduced a trap composed of 122 places in 100 ms of which 2 ms to minimize.
[2024-05-31 19:04:35] [INFO ] Deduced a trap composed of 125 places in 108 ms of which 2 ms to minimize.
[2024-05-31 19:04:35] [INFO ] Deduced a trap composed of 125 places in 104 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 152/490 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 635/1125 variables, 490/508 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1125 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/1125 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1125/1125 variables, and 508 constraints, problems are : Problem set: 0 solved, 17 unsolved in 1779 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 490/490 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 320/338 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 152/490 variables, 5/18 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-31 19:04:36] [INFO ] Deduced a trap composed of 150 places in 119 ms of which 3 ms to minimize.
[2024-05-31 19:04:37] [INFO ] Deduced a trap composed of 127 places in 136 ms of which 3 ms to minimize.
[2024-05-31 19:04:37] [INFO ] Deduced a trap composed of 125 places in 138 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 635/1125 variables, 490/511 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1125 variables, 17/528 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-31 19:04:37] [INFO ] Deduced a trap composed of 79 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1125 variables, 1/529 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1125 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 0/1125 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1125/1125 variables, and 529 constraints, problems are : Problem set: 0 solved, 17 unsolved in 2345 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 490/490 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 10/10 constraints]
After SMT, in 4135ms problems are : Problem set: 0 solved, 17 unsolved
Finished Parikh walk after 25039 steps, including 338 resets, run visited all 1 properties in 42 ms. (steps per millisecond=596 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 17 properties in 1593 ms.
Computed a total of 13 stabilizing places and 13 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' '!(((p0 U X(p1))||X((X(F(p3))||p2))))'
Support contains 4 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 635/635 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 471 transition count 616
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 471 transition count 616
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 471 transition count 615
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 53 place count 457 transition count 601
Iterating global reduction 1 with 14 rules applied. Total rules applied 67 place count 457 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 76 place count 457 transition count 592
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 452 transition count 587
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 452 transition count 587
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 90 place count 452 transition count 583
Applied a total of 90 rules in 59 ms. Remains 452 /490 variables (removed 38) and now considering 583/635 (removed 52) transitions.
// Phase 1: matrix 583 rows 452 cols
[2024-05-31 19:04:40] [INFO ] Computed 12 invariants in 12 ms
[2024-05-31 19:04:41] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-31 19:04:41] [INFO ] Invariant cache hit.
[2024-05-31 19:04:41] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
Running 582 sub problems to find dead transitions.
[2024-05-31 19:04:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 1 (OVERLAPS) 1/452 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 3 (OVERLAPS) 583/1035 variables, 452/464 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1035/1035 variables, and 464 constraints, problems are : Problem set: 0 solved, 582 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 452/452 constraints, PredecessorRefiner: 582/582 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 1 (OVERLAPS) 1/452 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 3 (OVERLAPS) 583/1035 variables, 452/464 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 582/1046 constraints. Problems are: Problem set: 0 solved, 582 unsolved
[2024-05-31 19:05:23] [INFO ] Deduced a trap composed of 87 places in 142 ms of which 4 ms to minimize.
[2024-05-31 19:05:24] [INFO ] Deduced a trap composed of 90 places in 141 ms of which 4 ms to minimize.
[2024-05-31 19:05:25] [INFO ] Deduced a trap composed of 93 places in 87 ms of which 2 ms to minimize.
[2024-05-31 19:05:26] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 5 ms to minimize.
[2024-05-31 19:05:27] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 2 ms to minimize.
[2024-05-31 19:05:28] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 2 ms to minimize.
[2024-05-31 19:05:29] [INFO ] Deduced a trap composed of 96 places in 87 ms of which 2 ms to minimize.
[2024-05-31 19:05:30] [INFO ] Deduced a trap composed of 97 places in 71 ms of which 1 ms to minimize.
[2024-05-31 19:05:31] [INFO ] Deduced a trap composed of 98 places in 82 ms of which 2 ms to minimize.
[2024-05-31 19:05:32] [INFO ] Deduced a trap composed of 355 places in 138 ms of which 3 ms to minimize.
[2024-05-31 19:05:32] [INFO ] Deduced a trap composed of 355 places in 144 ms of which 3 ms to minimize.
[2024-05-31 19:05:33] [INFO ] Deduced a trap composed of 355 places in 132 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1035 variables, 12/1058 constraints. Problems are: Problem set: 0 solved, 582 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 1)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 1)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 1)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 1)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 1)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 timeout
0)
(s277 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1035/1035 variables, and 1058 constraints, problems are : Problem set: 0 solved, 582 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 452/452 constraints, PredecessorRefiner: 582/582 constraints, Known Traps: 12/12 constraints]
After SMT, in 60312ms problems are : Problem set: 0 solved, 582 unsolved
Search for dead transitions found 0 dead transitions in 60318ms
Starting structural reductions in LTL mode, iteration 1 : 452/490 places, 583/635 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60856 ms. Remains : 452/490 places, 583/635 transitions.
Stuttering acceptance computed with spot in 400 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 284 ms.
Product exploration explored 100000 steps with 50000 reset in 188 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) (NOT p3) p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT p0)), (X p1), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 24 ms. Reduced automaton from 6 states, 9 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-10b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-00 finished in 61844 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 2 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 635/635 transitions.
Graph (trivial) has 373 edges and 490 vertex of which 61 / 490 are part of one of the 10 SCC in 2 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 438 transition count 532
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 388 transition count 532
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 101 place count 388 transition count 506
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 153 place count 362 transition count 506
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 190 place count 325 transition count 469
Iterating global reduction 2 with 37 rules applied. Total rules applied 227 place count 325 transition count 469
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 228 place count 325 transition count 468
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 240 place count 313 transition count 456
Iterating global reduction 3 with 12 rules applied. Total rules applied 252 place count 313 transition count 456
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 264 place count 313 transition count 444
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 388 place count 251 transition count 382
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 389 place count 250 transition count 381
Iterating global reduction 4 with 1 rules applied. Total rules applied 390 place count 250 transition count 381
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 391 place count 250 transition count 380
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 393 place count 248 transition count 378
Applied a total of 393 rules in 143 ms. Remains 248 /490 variables (removed 242) and now considering 378/635 (removed 257) transitions.
[2024-05-31 19:05:42] [INFO ] Flow matrix only has 350 transitions (discarded 28 similar events)
// Phase 1: matrix 350 rows 248 cols
[2024-05-31 19:05:42] [INFO ] Computed 12 invariants in 3 ms
[2024-05-31 19:05:43] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-31 19:05:43] [INFO ] Flow matrix only has 350 transitions (discarded 28 similar events)
[2024-05-31 19:05:43] [INFO ] Invariant cache hit.
[2024-05-31 19:05:43] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2024-05-31 19:05:43] [INFO ] Redundant transitions in 18 ms returned []
Running 265 sub problems to find dead transitions.
[2024-05-31 19:05:43] [INFO ] Flow matrix only has 350 transitions (discarded 28 similar events)
[2024-05-31 19:05:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (OVERLAPS) 1/248 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (OVERLAPS) 349/597 variables, 248/260 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/597 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (OVERLAPS) 0/597 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 597/598 variables, and 260 constraints, problems are : Problem set: 0 solved, 265 unsolved in 9802 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/247 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/247 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (OVERLAPS) 1/248 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (OVERLAPS) 349/597 variables, 248/260 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/597 variables, 265/525 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 0/597 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Int declared 597/598 variables, and 525 constraints, problems are : Problem set: 0 solved, 265 unsolved in 12095 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 0/0 constraints]
After SMT, in 22157ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 22160ms
Starting structural reductions in SI_LTL mode, iteration 1 : 248/490 places, 378/635 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22841 ms. Remains : 248/490 places, 378/635 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-01 finished in 23004 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 635/635 transitions.
Graph (trivial) has 456 edges and 490 vertex of which 61 / 490 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 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 438 transition count 530
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 105 place count 386 transition count 530
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 105 place count 386 transition count 504
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 157 place count 360 transition count 504
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 195 place count 322 transition count 466
Iterating global reduction 2 with 38 rules applied. Total rules applied 233 place count 322 transition count 466
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 234 place count 322 transition count 465
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 234 place count 322 transition count 464
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 236 place count 321 transition count 464
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 249 place count 308 transition count 451
Iterating global reduction 3 with 13 rules applied. Total rules applied 262 place count 308 transition count 451
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 275 place count 308 transition count 438
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 395 place count 248 transition count 378
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 396 place count 247 transition count 377
Iterating global reduction 4 with 1 rules applied. Total rules applied 397 place count 247 transition count 377
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 398 place count 247 transition count 376
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 408 place count 247 transition count 366
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 410 place count 245 transition count 364
Applied a total of 410 rules in 132 ms. Remains 245 /490 variables (removed 245) and now considering 364/635 (removed 271) transitions.
[2024-05-31 19:06:05] [INFO ] Flow matrix only has 345 transitions (discarded 19 similar events)
// Phase 1: matrix 345 rows 245 cols
[2024-05-31 19:06:05] [INFO ] Computed 12 invariants in 4 ms
[2024-05-31 19:06:05] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-31 19:06:05] [INFO ] Flow matrix only has 345 transitions (discarded 19 similar events)
[2024-05-31 19:06:05] [INFO ] Invariant cache hit.
[2024-05-31 19:06:06] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
[2024-05-31 19:06:06] [INFO ] Redundant transitions in 22 ms returned []
Running 172 sub problems to find dead transitions.
[2024-05-31 19:06:06] [INFO ] Flow matrix only has 345 transitions (discarded 19 similar events)
[2024-05-31 19:06:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 10/245 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 344/589 variables, 245/257 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/589 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 0/589 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 589/590 variables, and 257 constraints, problems are : Problem set: 0 solved, 172 unsolved in 6171 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 10/245 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 344/589 variables, 245/257 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/589 variables, 172/429 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/589 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 0/589 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 589/590 variables, and 429 constraints, problems are : Problem set: 0 solved, 172 unsolved in 6830 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 0/0 constraints]
After SMT, in 13102ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 13104ms
Starting structural reductions in SI_LTL mode, iteration 1 : 245/490 places, 364/635 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13688 ms. Remains : 245/490 places, 364/635 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-02
Stuttering criterion allowed to conclude after 368 steps with 21 reset in 5 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-02 finished in 13762 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 1 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 635/635 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 470 transition count 615
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 470 transition count 615
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 470 transition count 614
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 56 place count 455 transition count 599
Iterating global reduction 1 with 15 rules applied. Total rules applied 71 place count 455 transition count 599
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 80 place count 455 transition count 590
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 86 place count 449 transition count 584
Iterating global reduction 2 with 6 rules applied. Total rules applied 92 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 97 place count 449 transition count 579
Applied a total of 97 rules in 53 ms. Remains 449 /490 variables (removed 41) and now considering 579/635 (removed 56) transitions.
// Phase 1: matrix 579 rows 449 cols
[2024-05-31 19:06:19] [INFO ] Computed 12 invariants in 11 ms
[2024-05-31 19:06:19] [INFO ] Implicit Places using invariants in 519 ms returned []
[2024-05-31 19:06:19] [INFO ] Invariant cache hit.
[2024-05-31 19:06:20] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 807 ms to find 0 implicit places.
Running 578 sub problems to find dead transitions.
[2024-05-31 19:06:20] [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
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 1028/1028 variables, and 461 constraints, problems are : Problem set: 0 solved, 578 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 449/449 constraints, PredecessorRefiner: 578/578 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 578 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 1 (OVERLAPS) 1/449 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/449 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 3 (OVERLAPS) 579/1028 variables, 449/461 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1028 variables, 578/1039 constraints. Problems are: Problem set: 0 solved, 578 unsolved
[2024-05-31 19:07:02] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 3 ms to minimize.
[2024-05-31 19:07:03] [INFO ] Deduced a trap composed of 90 places in 134 ms of which 3 ms to minimize.
[2024-05-31 19:07:04] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 3 ms to minimize.
[2024-05-31 19:07:05] [INFO ] Deduced a trap composed of 92 places in 137 ms of which 3 ms to minimize.
[2024-05-31 19:07:08] [INFO ] Deduced a trap composed of 95 places in 146 ms of which 2 ms to minimize.
[2024-05-31 19:07:09] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 3 ms to minimize.
[2024-05-31 19:07:09] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 2 ms to minimize.
[2024-05-31 19:07:10] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 2 ms to minimize.
[2024-05-31 19:07:12] [INFO ] Deduced a trap composed of 354 places in 131 ms of which 3 ms to minimize.
[2024-05-31 19:07:12] [INFO ] Deduced a trap composed of 357 places in 133 ms of which 3 ms to minimize.
[2024-05-31 19:07:13] [INFO ] Deduced a trap composed of 376 places in 135 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 30022 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 60279ms problems are : Problem set: 0 solved, 578 unsolved
Search for dead transitions found 0 dead transitions in 60289ms
Starting structural reductions in LTL mode, iteration 1 : 449/490 places, 579/635 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61153 ms. Remains : 449/490 places, 579/635 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1456 steps with 18 reset in 3 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-04 finished in 61280 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(p0)||(p0&&G(p1)))))'
Support contains 2 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 635/635 transitions.
Graph (trivial) has 455 edges and 490 vertex of which 61 / 490 are part of one of the 10 SCC in 0 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 438 transition count 531
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 387 transition count 531
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 103 place count 387 transition count 506
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 153 place count 362 transition count 506
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 189 place count 326 transition count 470
Iterating global reduction 2 with 36 rules applied. Total rules applied 225 place count 326 transition count 470
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 226 place count 326 transition count 469
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 226 place count 326 transition count 468
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 228 place count 325 transition count 468
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 240 place count 313 transition count 456
Iterating global reduction 3 with 12 rules applied. Total rules applied 252 place count 313 transition count 456
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 263 place count 313 transition count 445
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 385 place count 252 transition count 384
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 386 place count 251 transition count 383
Iterating global reduction 4 with 1 rules applied. Total rules applied 387 place count 251 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 388 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 398 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 400 place count 249 transition count 370
Applied a total of 400 rules in 82 ms. Remains 249 /490 variables (removed 241) and now considering 370/635 (removed 265) transitions.
[2024-05-31 19:07:20] [INFO ] Flow matrix only has 351 transitions (discarded 19 similar events)
// Phase 1: matrix 351 rows 249 cols
[2024-05-31 19:07:20] [INFO ] Computed 12 invariants in 3 ms
[2024-05-31 19:07:20] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-31 19:07:20] [INFO ] Flow matrix only has 351 transitions (discarded 19 similar events)
[2024-05-31 19:07:20] [INFO ] Invariant cache hit.
[2024-05-31 19:07:21] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
[2024-05-31 19:07:21] [INFO ] Redundant transitions in 1 ms returned []
Running 176 sub problems to find dead transitions.
[2024-05-31 19:07:21] [INFO ] Flow matrix only has 351 transitions (discarded 19 similar events)
[2024-05-31 19:07:21] [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 6455 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 6951 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 13522ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 13528ms
Starting structural reductions in SI_LTL mode, iteration 1 : 249/490 places, 370/635 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13996 ms. Remains : 249/490 places, 370/635 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-05
Product exploration explored 100000 steps with 6027 reset in 497 ms.
Product exploration explored 100000 steps with 6018 reset in 548 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 138 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2493 resets) in 1362 ms. (29 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (43 resets) in 113 ms. (350 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (42 resets) in 141 ms. (281 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (44 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
[2024-05-31 19:07:36] [INFO ] Flow matrix only has 351 transitions (discarded 19 similar events)
[2024-05-31 19:07:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 99/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 185/286 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 223/509 variables, 94/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 54/563 variables, 9/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/563 variables, 18/225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/563 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 36/599 variables, 36/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/599 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/599 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 599/600 variables, and 261 constraints, problems are : Problem set: 0 solved, 3 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 99/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 185/286 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 223/509 variables, 94/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/509 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 54/563 variables, 9/210 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/563 variables, 18/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/563 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 36/599 variables, 36/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/599 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/599 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 599/600 variables, and 264 constraints, problems are : Problem set: 0 solved, 3 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 249/249 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 501ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 11 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=11 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p1 p0))), (F (NOT (OR p1 (NOT p0)))), (F (NOT p1)), (F (NOT p0)), (F (NOT (AND p1 p0))), (F (NOT (OR (NOT p1) p0)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p1 p0)))
Knowledge based reduction with 13 factoid took 164 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-10b-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-05 finished in 16697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 2 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 635/635 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 472 transition count 617
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 472 transition count 617
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 472 transition count 616
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 50 place count 459 transition count 603
Iterating global reduction 1 with 13 rules applied. Total rules applied 63 place count 459 transition count 603
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 70 place count 459 transition count 596
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 76 place count 453 transition count 590
Iterating global reduction 2 with 6 rules applied. Total rules applied 82 place count 453 transition count 590
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 87 place count 453 transition count 585
Applied a total of 87 rules in 30 ms. Remains 453 /490 variables (removed 37) and now considering 585/635 (removed 50) transitions.
// Phase 1: matrix 585 rows 453 cols
[2024-05-31 19:07:37] [INFO ] Computed 12 invariants in 7 ms
[2024-05-31 19:07:37] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-31 19:07:37] [INFO ] Invariant cache hit.
[2024-05-31 19:07:37] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
Running 584 sub problems to find dead transitions.
[2024-05-31 19:07:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (OVERLAPS) 1/453 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 3 (OVERLAPS) 585/1038 variables, 453/465 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1038 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 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 1.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.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 0.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)
(s177timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1038/1038 variables, and 465 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 453/453 constraints, PredecessorRefiner: 584/584 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 584 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (OVERLAPS) 1/453 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 3 (OVERLAPS) 585/1038 variables, 453/465 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1038 variables, 584/1049 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-05-31 19:08:20] [INFO ] Deduced a trap composed of 32 places in 117 ms of which 2 ms to minimize.
[2024-05-31 19:08:20] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 3 ms to minimize.
[2024-05-31 19:08:20] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2024-05-31 19:08:20] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2024-05-31 19:08:20] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 3 ms to minimize.
[2024-05-31 19:08:21] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 3 ms to minimize.
[2024-05-31 19:08:21] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
[2024-05-31 19:08:21] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 3 ms to minimize.
[2024-05-31 19:08:22] [INFO ] Deduced a trap composed of 90 places in 141 ms of which 5 ms to minimize.
[2024-05-31 19:08:24] [INFO ] Deduced a trap composed of 93 places in 145 ms of which 3 ms to minimize.
[2024-05-31 19:08:25] [INFO ] Deduced a trap composed of 93 places in 149 ms of which 3 ms to minimize.
[2024-05-31 19:08:26] [INFO ] Deduced a trap composed of 95 places in 132 ms of which 5 ms to minimize.
[2024-05-31 19:08:27] [INFO ] Deduced a trap composed of 96 places in 79 ms of which 2 ms to minimize.
[2024-05-31 19:08:28] [INFO ] Deduced a trap composed of 97 places in 92 ms of which 2 ms to minimize.
[2024-05-31 19:08:29] [INFO ] Deduced a trap composed of 97 places in 91 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1038 variables, 15/1064 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1038/1038 variables, and 1064 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 453/453 constraints, PredecessorRefiner: 584/584 constraints, Known Traps: 15/15 constraints]
After SMT, in 60288ms problems are : Problem set: 0 solved, 584 unsolved
Search for dead transitions found 0 dead transitions in 60294ms
Starting structural reductions in LTL mode, iteration 1 : 453/490 places, 585/635 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60788 ms. Remains : 453/490 places, 585/635 transitions.
Stuttering acceptance computed with spot in 292 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-06 finished in 61092 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||G(p1)||G((p0||X(!p1))))))'
Support contains 2 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 635/635 transitions.
Graph (trivial) has 455 edges and 490 vertex of which 61 / 490 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 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 438 transition count 530
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 105 place count 386 transition count 530
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 105 place count 386 transition count 504
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 157 place count 360 transition count 504
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 194 place count 323 transition count 467
Iterating global reduction 2 with 37 rules applied. Total rules applied 231 place count 323 transition count 467
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 232 place count 323 transition count 466
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 232 place count 323 transition count 465
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 234 place count 322 transition count 465
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 247 place count 309 transition count 452
Iterating global reduction 3 with 13 rules applied. Total rules applied 260 place count 309 transition count 452
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 273 place count 309 transition count 439
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 249 transition count 379
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 403 place count 249 transition count 369
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 405 place count 247 transition count 367
Applied a total of 405 rules in 116 ms. Remains 247 /490 variables (removed 243) and now considering 367/635 (removed 268) transitions.
[2024-05-31 19:08:38] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
// Phase 1: matrix 348 rows 247 cols
[2024-05-31 19:08:38] [INFO ] Computed 12 invariants in 9 ms
[2024-05-31 19:08:38] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-31 19:08:38] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-31 19:08:38] [INFO ] Invariant cache hit.
[2024-05-31 19:08:38] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2024-05-31 19:08:38] [INFO ] Redundant transitions in 1 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-31 19:08:38] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-31 19:08:38] [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 6444 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 6999 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 13521ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 13523ms
Starting structural reductions in SI_LTL mode, iteration 1 : 247/490 places, 367/635 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14012 ms. Remains : 247/490 places, 367/635 transitions.
Stuttering acceptance computed with spot in 40 ms :[false]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-07
Product exploration explored 100000 steps with 6164 reset in 377 ms.
Product exploration explored 100000 steps with 6147 reset in 446 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[false]
RANDOM walk for 40000 steps (2493 resets) in 226 ms. (176 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (43 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (43 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
[2024-05-31 19:08:53] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-31 19:08:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 72/107 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 309/416 variables, 66/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 146/562 variables, 9/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/562 variables, 114/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/562 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 32/594 variables, 32/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/594 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/594 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 594/595 variables, and 259 constraints, problems are : Problem set: 0 solved, 2 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 33/35 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 72/107 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 309/416 variables, 66/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 146/562 variables, 9/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/562 variables, 114/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/562 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 32/594 variables, 32/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/594 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/594 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 594/595 variables, and 261 constraints, problems are : Problem set: 0 solved, 2 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 247/247 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 380ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 16 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=8 )
Parikh walk visited 2 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 203 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[false]
Stuttering acceptance computed with spot in 35 ms :[false]
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 367/367 transitions.
Applied a total of 0 rules in 13 ms. Remains 247 /247 variables (removed 0) and now considering 367/367 (removed 0) transitions.
[2024-05-31 19:08:54] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-31 19:08:54] [INFO ] Invariant cache hit.
[2024-05-31 19:08:54] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-31 19:08:54] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-31 19:08:54] [INFO ] Invariant cache hit.
[2024-05-31 19:08:54] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-05-31 19:08:54] [INFO ] Redundant transitions in 1 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-31 19:08:54] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-31 19:08:54] [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 6389 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 7372 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 13846ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 13848ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14180 ms. Remains : 247/247 places, 367/367 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 130 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[false]
RANDOM walk for 31064 steps (1924 resets) in 234 ms. (132 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 268 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[false]
Stuttering acceptance computed with spot in 41 ms :[false]
Stuttering acceptance computed with spot in 43 ms :[false]
Product exploration explored 100000 steps with 6164 reset in 397 ms.
Product exploration explored 100000 steps with 6154 reset in 408 ms.
Support contains 2 out of 247 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 247/247 places, 367/367 transitions.
Applied a total of 0 rules in 8 ms. Remains 247 /247 variables (removed 0) and now considering 367/367 (removed 0) transitions.
[2024-05-31 19:09:10] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-31 19:09:10] [INFO ] Invariant cache hit.
[2024-05-31 19:09:10] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-31 19:09:10] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-31 19:09:10] [INFO ] Invariant cache hit.
[2024-05-31 19:09:10] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2024-05-31 19:09:10] [INFO ] Redundant transitions in 1 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-31 19:09:10] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-31 19:09:10] [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 6447 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 7216 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 13756ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 13758ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14103 ms. Remains : 247/247 places, 367/367 transitions.
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-07 finished in 45777 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1))))'
Support contains 2 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 635/635 transitions.
Graph (trivial) has 456 edges and 490 vertex of which 61 / 490 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 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 438 transition count 530
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 105 place count 386 transition count 530
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 105 place count 386 transition count 505
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 155 place count 361 transition count 505
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 191 place count 325 transition count 469
Iterating global reduction 2 with 36 rules applied. Total rules applied 227 place count 325 transition count 469
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 228 place count 325 transition count 468
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 228 place count 325 transition count 467
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 230 place count 324 transition count 467
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 242 place count 312 transition count 455
Iterating global reduction 3 with 12 rules applied. Total rules applied 254 place count 312 transition count 455
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 265 place count 312 transition count 444
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 387 place count 251 transition count 383
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 388 place count 250 transition count 382
Iterating global reduction 4 with 1 rules applied. Total rules applied 389 place count 250 transition count 382
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 390 place count 250 transition count 381
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 400 place count 250 transition count 371
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 402 place count 248 transition count 369
Applied a total of 402 rules in 58 ms. Remains 248 /490 variables (removed 242) and now considering 369/635 (removed 266) transitions.
[2024-05-31 19:09:24] [INFO ] Flow matrix only has 350 transitions (discarded 19 similar events)
// Phase 1: matrix 350 rows 248 cols
[2024-05-31 19:09:24] [INFO ] Computed 12 invariants in 2 ms
[2024-05-31 19:09:24] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-05-31 19:09:24] [INFO ] Flow matrix only has 350 transitions (discarded 19 similar events)
[2024-05-31 19:09:24] [INFO ] Invariant cache hit.
[2024-05-31 19:09:24] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
[2024-05-31 19:09:24] [INFO ] Redundant transitions in 1 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-31 19:09:24] [INFO ] Flow matrix only has 350 transitions (discarded 19 similar events)
[2024-05-31 19:09:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 10/248 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 349/597 variables, 248/260 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/597 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 0/597 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 597/598 variables, and 260 constraints, problems are : Problem set: 0 solved, 175 unsolved in 6577 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 10/248 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 349/597 variables, 248/260 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/597 variables, 175/435 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 0/597 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 597/598 variables, and 435 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7432 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 248/248 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 0/0 constraints]
After SMT, in 14103ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 14105ms
Starting structural reductions in SI_LTL mode, iteration 1 : 248/490 places, 369/635 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14672 ms. Remains : 248/490 places, 369/635 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-08 finished in 14758 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 635/635 transitions.
Graph (trivial) has 447 edges and 490 vertex of which 55 / 490 are part of one of the 9 SCC in 1 ms
Free SCC test removed 46 places
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 443 transition count 535
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 105 place count 391 transition count 535
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 105 place count 391 transition count 508
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 159 place count 364 transition count 508
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 195 place count 328 transition count 472
Iterating global reduction 2 with 36 rules applied. Total rules applied 231 place count 328 transition count 472
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 232 place count 328 transition count 471
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 232 place count 328 transition count 470
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 234 place count 327 transition count 470
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 247 place count 314 transition count 457
Iterating global reduction 3 with 13 rules applied. Total rules applied 260 place count 314 transition count 457
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 273 place count 314 transition count 444
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 4 with 128 rules applied. Total rules applied 401 place count 250 transition count 380
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 402 place count 249 transition count 379
Iterating global reduction 4 with 1 rules applied. Total rules applied 403 place count 249 transition count 379
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 404 place count 249 transition count 378
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 408 place count 247 transition count 389
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 420 place count 247 transition count 377
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 421 place count 246 transition count 376
Applied a total of 421 rules in 74 ms. Remains 246 /490 variables (removed 244) and now considering 376/635 (removed 259) transitions.
[2024-05-31 19:09:39] [INFO ] Flow matrix only has 358 transitions (discarded 18 similar events)
// Phase 1: matrix 358 rows 246 cols
[2024-05-31 19:09:39] [INFO ] Computed 12 invariants in 7 ms
[2024-05-31 19:09:39] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-31 19:09:39] [INFO ] Flow matrix only has 358 transitions (discarded 18 similar events)
[2024-05-31 19:09:39] [INFO ] Invariant cache hit.
[2024-05-31 19:09:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 19:09:39] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2024-05-31 19:09:39] [INFO ] Redundant transitions in 1 ms returned []
Running 292 sub problems to find dead transitions.
[2024-05-31 19:09:39] [INFO ] Flow matrix only has 358 transitions (discarded 18 similar events)
[2024-05-31 19:09:39] [INFO ] Invariant cache hit.
[2024-05-31 19:09:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/246 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 357/603 variables, 246/258 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/603 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (OVERLAPS) 1/604 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/604 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (OVERLAPS) 0/604 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 259 constraints, problems are : Problem set: 0 solved, 292 unsolved in 13088 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 246/246 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/246 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 357/603 variables, 246/258 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/603 variables, 292/550 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/603 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (OVERLAPS) 1/604 variables, 1/551 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/604 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (OVERLAPS) 0/604 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Int declared 604/604 variables, and 551 constraints, problems are : Problem set: 0 solved, 292 unsolved in 19666 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 246/246 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 0/0 constraints]
After SMT, in 32907ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 32910ms
Starting structural reductions in SI_LTL mode, iteration 1 : 246/490 places, 376/635 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 33374 ms. Remains : 246/490 places, 376/635 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-09
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-09 finished in 33438 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 2 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 635/635 transitions.
Graph (trivial) has 455 edges and 490 vertex of which 61 / 490 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 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 438 transition count 530
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 105 place count 386 transition count 530
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 105 place count 386 transition count 505
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 155 place count 361 transition count 505
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 192 place count 324 transition count 468
Iterating global reduction 2 with 37 rules applied. Total rules applied 229 place count 324 transition count 468
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 230 place count 324 transition count 467
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 230 place count 324 transition count 466
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 232 place count 323 transition count 466
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 244 place count 311 transition count 454
Iterating global reduction 3 with 12 rules applied. Total rules applied 256 place count 311 transition count 454
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 267 place count 311 transition count 443
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 387 place count 251 transition count 383
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 389 place count 249 transition count 381
Iterating global reduction 4 with 2 rules applied. Total rules applied 391 place count 249 transition count 381
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 393 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 403 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 405 place count 247 transition count 367
Applied a total of 405 rules in 64 ms. Remains 247 /490 variables (removed 243) and now considering 367/635 (removed 268) transitions.
[2024-05-31 19:10:12] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
// Phase 1: matrix 348 rows 247 cols
[2024-05-31 19:10:12] [INFO ] Computed 12 invariants in 6 ms
[2024-05-31 19:10:12] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-31 19:10:12] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-31 19:10:12] [INFO ] Invariant cache hit.
[2024-05-31 19:10:12] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
[2024-05-31 19:10:12] [INFO ] Redundant transitions in 1 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-31 19:10:12] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-31 19:10:12] [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 6366 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 7218 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 13694ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 13696ms
Starting structural reductions in SI_LTL mode, iteration 1 : 247/490 places, 367/635 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14217 ms. Remains : 247/490 places, 367/635 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-10 finished in 14391 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 490 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 490/490 places, 635/635 transitions.
Graph (trivial) has 456 edges and 490 vertex of which 61 / 490 are part of one of the 10 SCC in 0 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 438 transition count 531
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 387 transition count 531
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 103 place count 387 transition count 505
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 155 place count 361 transition count 505
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 193 place count 323 transition count 467
Iterating global reduction 2 with 38 rules applied. Total rules applied 231 place count 323 transition count 467
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 232 place count 323 transition count 466
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 232 place count 323 transition count 465
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 234 place count 322 transition count 465
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 247 place count 309 transition count 452
Iterating global reduction 3 with 13 rules applied. Total rules applied 260 place count 309 transition count 452
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 273 place count 309 transition count 439
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 249 transition count 379
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 394 place count 248 transition count 378
Iterating global reduction 4 with 1 rules applied. Total rules applied 395 place count 248 transition count 378
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 396 place count 248 transition count 377
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 248 transition count 367
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 407 place count 248 transition count 367
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 409 place count 246 transition count 365
Applied a total of 409 rules in 73 ms. Remains 246 /490 variables (removed 244) and now considering 365/635 (removed 270) transitions.
[2024-05-31 19:10:26] [INFO ] Flow matrix only has 347 transitions (discarded 18 similar events)
// Phase 1: matrix 347 rows 246 cols
[2024-05-31 19:10:26] [INFO ] Computed 12 invariants in 7 ms
[2024-05-31 19:10:27] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-31 19:10:27] [INFO ] Flow matrix only has 347 transitions (discarded 18 similar events)
[2024-05-31 19:10:27] [INFO ] Invariant cache hit.
[2024-05-31 19:10:27] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2024-05-31 19:10:27] [INFO ] Redundant transitions in 1 ms returned []
Running 173 sub problems to find dead transitions.
[2024-05-31 19:10:27] [INFO ] Flow matrix only has 347 transitions (discarded 18 similar events)
[2024-05-31 19:10:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 10/246 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 346/592 variables, 246/258 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/592 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (OVERLAPS) 0/592 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 592/593 variables, and 258 constraints, problems are : Problem set: 0 solved, 173 unsolved in 6466 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 10/246 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 346/592 variables, 246/258 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/592 variables, 173/431 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/592 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 0/592 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 592/593 variables, and 431 constraints, problems are : Problem set: 0 solved, 173 unsolved in 6990 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints]
After SMT, in 13554ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 13556ms
Starting structural reductions in SI_LTL mode, iteration 1 : 246/490 places, 365/635 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13967 ms. Remains : 246/490 places, 365/635 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-11
Stuttering criterion allowed to conclude after 3870 steps with 232 reset in 15 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-11 finished in 14029 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&(p1||F(G(p2))))))'
Support contains 2 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 635/635 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 472 transition count 617
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 472 transition count 617
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 472 transition count 616
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 51 place count 458 transition count 602
Iterating global reduction 1 with 14 rules applied. Total rules applied 65 place count 458 transition count 602
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 73 place count 458 transition count 594
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 78 place count 453 transition count 589
Iterating global reduction 2 with 5 rules applied. Total rules applied 83 place count 453 transition count 589
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 87 place count 453 transition count 585
Applied a total of 87 rules in 43 ms. Remains 453 /490 variables (removed 37) and now considering 585/635 (removed 50) transitions.
// Phase 1: matrix 585 rows 453 cols
[2024-05-31 19:10:40] [INFO ] Computed 12 invariants in 3 ms
[2024-05-31 19:10:41] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-31 19:10:41] [INFO ] Invariant cache hit.
[2024-05-31 19:10:41] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
Running 584 sub problems to find dead transitions.
[2024-05-31 19:10:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (OVERLAPS) 1/453 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 3 (OVERLAPS) 585/1038 variables, 453/465 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1038 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 584 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 1038/1038 variables, and 465 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 453/453 constraints, PredecessorRefiner: 584/584 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 584 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (OVERLAPS) 1/453 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/453 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 3 (OVERLAPS) 585/1038 variables, 453/465 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1038 variables, 584/1049 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2024-05-31 19:11:23] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 1 ms to minimize.
[2024-05-31 19:11:23] [INFO ] Deduced a trap composed of 32 places in 108 ms of which 2 ms to minimize.
[2024-05-31 19:11:24] [INFO ] Deduced a trap composed of 87 places in 145 ms of which 3 ms to minimize.
[2024-05-31 19:11:25] [INFO ] Deduced a trap composed of 90 places in 161 ms of which 3 ms to minimize.
[2024-05-31 19:11:25] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 3 ms to minimize.
[2024-05-31 19:11:26] [INFO ] Deduced a trap composed of 92 places in 142 ms of which 3 ms to minimize.
[2024-05-31 19:11:27] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 2 ms to minimize.
[2024-05-31 19:11:28] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 2 ms to minimize.
[2024-05-31 19:11:29] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 2 ms to minimize.
[2024-05-31 19:11:30] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 2 ms to minimize.
[2024-05-31 19:11:31] [INFO ] Deduced a trap composed of 116 places in 108 ms of which 2 ms to minimize.
[2024-05-31 19:11:31] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 2 ms to minimize.
[2024-05-31 19:11:32] [INFO ] Deduced a trap composed of 98 places in 79 ms of which 1 ms to minimize.
[2024-05-31 19:11:33] [INFO ] Deduced a trap composed of 356 places in 138 ms of which 2 ms to minimize.
[2024-05-31 19:11:33] [INFO ] Deduced a trap composed of 356 places in 144 ms of which 2 ms to minimize.
[2024-05-31 19:11:34] [INFO ] Deduced a trap composed of 356 places in 141 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1038 variables, 16/1065 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1038/1038 variables, and 1065 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 453/453 constraints, PredecessorRefiner: 584/584 constraints, Known Traps: 16/16 constraints]
After SMT, in 60288ms problems are : Problem set: 0 solved, 584 unsolved
Search for dead transitions found 0 dead transitions in 60294ms
Starting structural reductions in LTL mode, iteration 1 : 453/490 places, 585/635 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60933 ms. Remains : 453/490 places, 585/635 transitions.
Stuttering acceptance computed with spot in 180 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-12
Stuttering criterion allowed to conclude after 76 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-12 finished in 61141 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 2 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 635/635 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 471 transition count 616
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 471 transition count 616
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 471 transition count 615
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 53 place count 457 transition count 601
Iterating global reduction 1 with 14 rules applied. Total rules applied 67 place count 457 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 76 place count 457 transition count 592
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 452 transition count 587
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 452 transition count 587
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 90 place count 452 transition count 583
Applied a total of 90 rules in 32 ms. Remains 452 /490 variables (removed 38) and now considering 583/635 (removed 52) transitions.
// Phase 1: matrix 583 rows 452 cols
[2024-05-31 19:11:42] [INFO ] Computed 12 invariants in 9 ms
[2024-05-31 19:11:42] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-31 19:11:42] [INFO ] Invariant cache hit.
[2024-05-31 19:11:42] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
Running 582 sub problems to find dead transitions.
[2024-05-31 19:11:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 1 (OVERLAPS) 1/452 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 3 (OVERLAPS) 583/1035 variables, 452/464 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 582 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1035/1035 variables, and 464 constraints, problems are : Problem set: 0 solved, 582 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 452/452 constraints, PredecessorRefiner: 582/582 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 1 (OVERLAPS) 1/452 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 3 (OVERLAPS) 583/1035 variables, 452/464 constraints. Problems are: Problem set: 0 solved, 582 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1035 variables, 582/1046 constraints. Problems are: Problem set: 0 solved, 582 unsolved
[2024-05-31 19:12:25] [INFO ] Deduced a trap composed of 87 places in 136 ms of which 3 ms to minimize.
[2024-05-31 19:12:26] [INFO ] Deduced a trap composed of 90 places in 129 ms of which 2 ms to minimize.
[2024-05-31 19:12:26] [INFO ] Deduced a trap composed of 91 places in 134 ms of which 3 ms to minimize.
[2024-05-31 19:12:27] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 3 ms to minimize.
[2024-05-31 19:12:28] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 3 ms to minimize.
[2024-05-31 19:12:30] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 3 ms to minimize.
[2024-05-31 19:12:31] [INFO ] Deduced a trap composed of 96 places in 78 ms of which 2 ms to minimize.
[2024-05-31 19:12:32] [INFO ] Deduced a trap composed of 97 places in 78 ms of which 1 ms to minimize.
[2024-05-31 19:12:32] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 1 ms to minimize.
[2024-05-31 19:12:34] [INFO ] Deduced a trap composed of 355 places in 146 ms of which 2 ms to minimize.
[2024-05-31 19:12:34] [INFO ] Deduced a trap composed of 358 places in 137 ms of which 4 ms to minimize.
[2024-05-31 19:12:35] [INFO ] Deduced a trap composed of 355 places in 144 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1035 variables, 12/1058 constraints. Problems are: Problem set: 0 solved, 582 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1035/1035 variables, and 1058 constraints, problems are : Problem set: 0 solved, 582 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 452/452 constraints, PredecessorRefiner: 582/582 constraints, Known Traps: 12/12 constraints]
After SMT, in 60254ms problems are : Problem set: 0 solved, 582 unsolved
Search for dead transitions found 0 dead transitions in 60259ms
Starting structural reductions in LTL mode, iteration 1 : 452/490 places, 583/635 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60771 ms. Remains : 452/490 places, 583/635 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 157 ms.
Product exploration explored 100000 steps with 50000 reset in 151 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 p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 16 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-10b-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-13 finished in 61191 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((F(p1)&&p0))))'
Support contains 6 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 635/635 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 471 transition count 616
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 471 transition count 616
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 471 transition count 615
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 52 place count 458 transition count 602
Iterating global reduction 1 with 13 rules applied. Total rules applied 65 place count 458 transition count 602
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 72 place count 458 transition count 595
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 78 place count 452 transition count 589
Iterating global reduction 2 with 6 rules applied. Total rules applied 84 place count 452 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 89 place count 452 transition count 584
Applied a total of 89 rules in 40 ms. Remains 452 /490 variables (removed 38) and now considering 584/635 (removed 51) transitions.
// Phase 1: matrix 584 rows 452 cols
[2024-05-31 19:12:43] [INFO ] Computed 12 invariants in 3 ms
[2024-05-31 19:12:43] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-31 19:12:43] [INFO ] Invariant cache hit.
[2024-05-31 19:12:43] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Running 583 sub problems to find dead transitions.
[2024-05-31 19:12:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/451 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 1 (OVERLAPS) 1/452 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 3 (OVERLAPS) 584/1036 variables, 452/464 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1036 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 583 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1036/1036 variables, and 464 constraints, problems are : Problem set: 0 solved, 583 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 452/452 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/451 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 1 (OVERLAPS) 1/452 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/452 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 3 (OVERLAPS) 584/1036 variables, 452/464 constraints. Problems are: Problem set: 0 solved, 583 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1036 variables, 583/1047 constraints. Problems are: Problem set: 0 solved, 583 unsolved
[2024-05-31 19:13:26] [INFO ] Deduced a trap composed of 87 places in 143 ms of which 3 ms to minimize.
[2024-05-31 19:13:27] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 2 ms to minimize.
[2024-05-31 19:13:28] [INFO ] Deduced a trap composed of 91 places in 140 ms of which 3 ms to minimize.
[2024-05-31 19:13:29] [INFO ] Deduced a trap composed of 92 places in 147 ms of which 3 ms to minimize.
[2024-05-31 19:13:30] [INFO ] Deduced a trap composed of 94 places in 133 ms of which 3 ms to minimize.
[2024-05-31 19:13:31] [INFO ] Deduced a trap composed of 94 places in 125 ms of which 2 ms to minimize.
[2024-05-31 19:13:31] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 2 ms to minimize.
[2024-05-31 19:13:32] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 2 ms to minimize.
[2024-05-31 19:13:33] [INFO ] Deduced a trap composed of 98 places in 88 ms of which 2 ms to minimize.
[2024-05-31 19:13:34] [INFO ] Deduced a trap composed of 97 places in 91 ms of which 2 ms to minimize.
[2024-05-31 19:13:35] [INFO ] Deduced a trap composed of 355 places in 141 ms of which 2 ms to minimize.
[2024-05-31 19:13:36] [INFO ] Deduced a trap composed of 359 places in 142 ms of which 3 ms to minimize.
[2024-05-31 19:13:36] [INFO ] Deduced a trap composed of 356 places in 141 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1036 variables, 13/1060 constraints. Problems are: Problem set: 0 solved, 583 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1036/1036 variables, and 1060 constraints, problems are : Problem set: 0 solved, 583 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 452/452 constraints, PredecessorRefiner: 583/583 constraints, Known Traps: 13/13 constraints]
After SMT, in 60298ms problems are : Problem set: 0 solved, 583 unsolved
Search for dead transitions found 0 dead transitions in 60309ms
Starting structural reductions in LTL mode, iteration 1 : 452/490 places, 584/635 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60868 ms. Remains : 452/490 places, 584/635 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-14 finished in 61005 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(p0)||X(G(p1))) U X(X(p2))))'
Support contains 5 out of 490 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 490/490 places, 635/635 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 473 transition count 618
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 473 transition count 618
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 47 place count 460 transition count 605
Iterating global reduction 0 with 13 rules applied. Total rules applied 60 place count 460 transition count 605
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 68 place count 460 transition count 597
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 73 place count 455 transition count 592
Iterating global reduction 1 with 5 rules applied. Total rules applied 78 place count 455 transition count 592
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 82 place count 455 transition count 588
Applied a total of 82 rules in 27 ms. Remains 455 /490 variables (removed 35) and now considering 588/635 (removed 47) transitions.
// Phase 1: matrix 588 rows 455 cols
[2024-05-31 19:13:44] [INFO ] Computed 12 invariants in 5 ms
[2024-05-31 19:13:44] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-31 19:13:44] [INFO ] Invariant cache hit.
[2024-05-31 19:13:44] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
Running 587 sub problems to find dead transitions.
[2024-05-31 19:13:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 1 (OVERLAPS) 1/455 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 3 (OVERLAPS) 588/1043 variables, 455/467 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1043 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1043/1043 variables, and 467 constraints, problems are : Problem set: 0 solved, 587 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 455/455 constraints, PredecessorRefiner: 587/587 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 587 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 1 (OVERLAPS) 1/455 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 3 (OVERLAPS) 588/1043 variables, 455/467 constraints. Problems are: Problem set: 0 solved, 587 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1043 variables, 587/1054 constraints. Problems are: Problem set: 0 solved, 587 unsolved
[2024-05-31 19:14:27] [INFO ] Deduced a trap composed of 87 places in 136 ms of which 3 ms to minimize.
[2024-05-31 19:14:28] [INFO ] Deduced a trap composed of 90 places in 147 ms of which 3 ms to minimize.
[2024-05-31 19:14:29] [INFO ] Deduced a trap composed of 91 places in 139 ms of which 3 ms to minimize.
[2024-05-31 19:14:30] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 3 ms to minimize.
[2024-05-31 19:14:31] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 2 ms to minimize.
[2024-05-31 19:14:32] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 3 ms to minimize.
[2024-05-31 19:14:33] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 2 ms to minimize.
[2024-05-31 19:14:33] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 3 ms to minimize.
[2024-05-31 19:14:34] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 3 ms to minimize.
[2024-05-31 19:14:35] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 3 ms to minimize.
[2024-05-31 19:14:37] [INFO ] Deduced a trap composed of 357 places in 133 ms of which 3 ms to minimize.
[2024-05-31 19:14:37] [INFO ] Deduced a trap composed of 357 places in 135 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1043 variables, 12/1066 constraints. Problems are: Problem set: 0 solved, 587 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1043/1043 variables, and 1066 constraints, problems are : Problem set: 0 solved, 587 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 455/455 constraints, PredecessorRefiner: 587/587 constraints, Known Traps: 12/12 constraints]
After SMT, in 60282ms problems are : Problem set: 0 solved, 587 unsolved
Search for dead transitions found 0 dead transitions in 60287ms
Starting structural reductions in LTL mode, iteration 1 : 455/490 places, 588/635 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60798 ms. Remains : 455/490 places, 588/635 transitions.
Stuttering acceptance computed with spot in 651 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), (NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (NOT p2), (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p1), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-15 finished in 61471 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||G(p1)||G((p0||X(!p1))))))'
[2024-05-31 19:14:45] [INFO ] Flatten gal took : 27 ms
[2024-05-31 19:14:45] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-31 19:14:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 490 places, 635 transitions and 1805 arcs took 4 ms.
Total runtime 674545 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA FlexibleBarrier-PT-10b-LTLFireability-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717182930998

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name FlexibleBarrier-PT-10b-LTLFireability-07
ltl formula formula --ltl=/tmp/1532/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 490 places, 635 transitions and 1805 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1532/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1532/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1532/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1532/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 491 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 491, there are 661 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~91 levels ~10000 states ~19464 transitions
pnml2lts-mc( 2/ 4): ~112 levels ~20000 states ~47560 transitions
pnml2lts-mc( 1/ 4): ~201 levels ~40000 states ~103824 transitions
pnml2lts-mc( 1/ 4): ~203 levels ~80000 states ~212760 transitions
pnml2lts-mc( 1/ 4): ~203 levels ~160000 states ~431232 transitions
pnml2lts-mc( 1/ 4): ~324 levels ~320000 states ~915096 transitions
pnml2lts-mc( 0/ 4): ~405 levels ~640000 states ~1719704 transitions
pnml2lts-mc( 0/ 4): ~405 levels ~1280000 states ~3451848 transitions
pnml2lts-mc( 0/ 4): ~720 levels ~2560000 states ~6882380 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~1175!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2932937
pnml2lts-mc( 0/ 4): unique states count: 3837898
pnml2lts-mc( 0/ 4): unique transitions count: 12668700
pnml2lts-mc( 0/ 4): - self-loop count: 61077
pnml2lts-mc( 0/ 4): - claim dead count: 7635972
pnml2lts-mc( 0/ 4): - claim found count: 1105321
pnml2lts-mc( 0/ 4): - claim success count: 3837926
pnml2lts-mc( 0/ 4): - cum. max stack depth: 11420
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 3837926 states 12668768 transitions, fanout: 3.301
pnml2lts-mc( 0/ 4): Total exploration time 44.230 sec (44.230 sec minimum, 44.230 sec on average)
pnml2lts-mc( 0/ 4): States per second: 86772, Transitions per second: 286429
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 33.0MB, 9.0 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 11.0%/5.0%
pnml2lts-mc( 0/ 4): Stored 647 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 33.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FlexibleBarrier-PT-10b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r496-tall-171640602600060"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;