About the Execution of ITS-Tools for FlexibleBarrier-PT-10b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3839.619 | 952058.00 | 1770246.00 | 1849.80 | TFFFFFFFFFFFFTFF | normal |
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.r180-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 itstools
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 r180-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 1716420030076
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-22 23:20:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 23:20:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 23:20:31] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2024-05-22 23:20:31] [INFO ] Transformed 1402 places.
[2024-05-22 23:20:31] [INFO ] Transformed 1613 transitions.
[2024-05-22 23:20:31] [INFO ] Found NUPN structural information;
[2024-05-22 23:20:31] [INFO ] Parsed PT model containing 1402 places and 1613 transitions and 4025 arcs in 240 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 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 248 ms. Remains 490 /1402 variables (removed 912) and now considering 635/1613 (removed 978) transitions.
// Phase 1: matrix 635 rows 490 cols
[2024-05-22 23:20:31] [INFO ] Computed 12 invariants in 22 ms
[2024-05-22 23:20:32] [INFO ] Implicit Places using invariants in 395 ms returned []
[2024-05-22 23:20:32] [INFO ] Invariant cache hit.
[2024-05-22 23:20:32] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 815 ms to find 0 implicit places.
Running 634 sub problems to find dead transitions.
[2024-05-22 23:20: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
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.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 0.0)
(s153 0.0)
(s154 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
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 30039 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-22 23:21:16] [INFO ] Deduced a trap composed of 124 places in 166 ms of which 24 ms to minimize.
[2024-05-22 23:21:18] [INFO ] Deduced a trap composed of 225 places in 185 ms of which 4 ms to minimize.
[2024-05-22 23:21:18] [INFO ] Deduced a trap composed of 89 places in 156 ms of which 3 ms to minimize.
[2024-05-22 23:21:19] [INFO ] Deduced a trap composed of 93 places in 150 ms of which 3 ms to minimize.
[2024-05-22 23:21:20] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 3 ms to minimize.
[2024-05-22 23:21:21] [INFO ] Deduced a trap composed of 95 places in 146 ms of which 3 ms to minimize.
[2024-05-22 23:21:22] [INFO ] Deduced a trap composed of 95 places in 139 ms of which 2 ms to minimize.
[2024-05-22 23:21:24] [INFO ] Deduced a trap composed of 125 places in 130 ms of which 3 ms to minimize.
[2024-05-22 23:21:27] [INFO ] Deduced a trap composed of 99 places in 107 ms of which 2 ms to minimize.
[2024-05-22 23:21:28] [INFO ] Deduced a trap composed of 100 places in 84 ms of which 2 ms to minimize.
[2024-05-22 23:21:29] [INFO ] Deduced a trap composed of 125 places in 84 ms of which 2 ms to minimize.
[2024-05-22 23:21:30] [INFO ] Deduced a trap composed of 124 places in 128 ms of which 3 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 30020 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 60451ms problems are : Problem set: 0 solved, 634 unsolved
Search for dead transitions found 0 dead transitions in 60472ms
Starting structural reductions in LTL mode, iteration 1 : 490/1402 places, 635/1613 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61559 ms. Remains : 490/1402 places, 635/1613 transitions.
Support contains 36 out of 490 places after structural reductions.
[2024-05-22 23:21:33] [INFO ] Flatten gal took : 62 ms
[2024-05-22 23:21:33] [INFO ] Flatten gal took : 30 ms
[2024-05-22 23:21: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 (520 resets) in 2436 ms. (16 steps per ms) remains 16/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
[2024-05-22 23:21:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 357/376 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-22 23:21:34] [INFO ] Deduced a trap composed of 79 places in 59 ms of which 1 ms to minimize.
[2024-05-22 23:21:34] [INFO ] Deduced a trap composed of 124 places in 109 ms of which 3 ms to minimize.
[2024-05-22 23:21:34] [INFO ] Deduced a trap composed of 127 places in 105 ms of which 3 ms to minimize.
[2024-05-22 23:21:34] [INFO ] Deduced a trap composed of 122 places in 104 ms of which 2 ms to minimize.
[2024-05-22 23:21:34] [INFO ] Deduced a trap composed of 123 places in 104 ms of which 3 ms to minimize.
[2024-05-22 23:21:35] [INFO ] Deduced a trap composed of 154 places in 105 ms of which 3 ms to minimize.
[2024-05-22 23:21:35] [INFO ] Deduced a trap composed of 125 places in 128 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 114/490 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 635/1125 variables, 490/509 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-22 23:21:36] [INFO ] Deduced a trap composed of 151 places in 113 ms of which 3 ms to minimize.
[2024-05-22 23:21:36] [INFO ] Deduced a trap composed of 125 places in 108 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1125 variables, 2/511 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1125 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/1125 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1125/1125 variables, and 511 constraints, problems are : Problem set: 0 solved, 16 unsolved in 3186 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 490/490 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 357/376 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 114/490 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-22 23:21:37] [INFO ] Deduced a trap composed of 130 places in 136 ms of which 3 ms to minimize.
[2024-05-22 23:21:38] [INFO ] Deduced a trap composed of 199 places in 136 ms of which 2 ms to minimize.
[2024-05-22 23:21:38] [INFO ] Deduced a trap composed of 124 places in 114 ms of which 2 ms to minimize.
[2024-05-22 23:21:38] [INFO ] Deduced a trap composed of 98 places in 67 ms of which 1 ms to minimize.
[2024-05-22 23:21:38] [INFO ] Deduced a trap composed of 177 places in 128 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-22 23:21:38] [INFO ] Deduced a trap composed of 95 places in 75 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 635/1125 variables, 490/517 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1125 variables, 16/533 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-05-22 23:21:39] [INFO ] Deduced a trap composed of 125 places in 115 ms of which 2 ms to minimize.
[2024-05-22 23:21:39] [INFO ] Deduced a trap composed of 79 places in 86 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1125 variables, 2/535 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1125 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 0/1125 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1125/1125 variables, and 535 constraints, problems are : Problem set: 0 solved, 16 unsolved in 2907 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 490/490 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 17/17 constraints]
After SMT, in 6101ms problems are : Problem set: 0 solved, 16 unsolved
Parikh walk visited 15 properties in 3044 ms.
Support contains 2 out of 490 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 4 ms
Free SCC test removed 51 places
Drop transitions (Empty/Sink Transition effects.) removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 439 transition count 521
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 105 place count 387 transition count 521
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 387 transition count 496
Deduced a syphon composed of 25 places in 7 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 155 place count 362 transition count 496
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 191 place count 326 transition count 460
Iterating global reduction 2 with 36 rules applied. Total rules applied 227 place count 326 transition count 460
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 326 transition count 459
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 228 place count 326 transition count 458
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 230 place count 325 transition count 458
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 242 place count 313 transition count 446
Iterating global reduction 3 with 12 rules applied. Total rules applied 254 place count 313 transition count 446
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 313 transition count 435
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 4 with 126 rules applied. Total rules applied 391 place count 250 transition count 372
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 411 place count 250 transition count 352
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 422 place count 239 transition count 341
Iterating global reduction 5 with 11 rules applied. Total rules applied 433 place count 239 transition count 341
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 434 place count 239 transition count 340
Free-agglomeration rule applied 184 times.
Iterating global reduction 6 with 184 rules applied. Total rules applied 618 place count 239 transition count 156
Reduce places removed 184 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Graph (complete) has 150 edges and 55 vertex of which 20 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.1 ms
Discarding 35 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 266 rules applied. Total rules applied 884 place count 20 transition count 75
Drop transitions (Empty/Sink Transition effects.) removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 7 with 49 rules applied. Total rules applied 933 place count 20 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 934 place count 19 transition count 25
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 15 edges and 18 vertex of which 6 / 18 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 2 rules applied. Total rules applied 936 place count 15 transition count 25
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 942 place count 15 transition count 19
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 3 Pre rules applied. Total rules applied 942 place count 15 transition count 16
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 948 place count 12 transition count 16
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 951 place count 12 transition count 13
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 957 place count 9 transition count 10
Free-agglomeration rule applied 3 times.
Iterating global reduction 11 with 3 rules applied. Total rules applied 960 place count 9 transition count 7
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 968 place count 4 transition count 4
Applied a total of 968 rules in 162 ms. Remains 4 /490 variables (removed 486) and now considering 4/635 (removed 631) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 4/490 places, 4/635 transitions.
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
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 58 ms. Remains 452 /490 variables (removed 38) and now considering 583/635 (removed 52) transitions.
// Phase 1: matrix 583 rows 452 cols
[2024-05-22 23:21:44] [INFO ] Computed 12 invariants in 10 ms
[2024-05-22 23:21:44] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-22 23:21:44] [INFO ] Invariant cache hit.
[2024-05-22 23:21:44] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 471 ms to find 0 implicit places.
Running 582 sub problems to find dead transitions.
[2024-05-22 23:21:44] [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 "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 1035/1035 variables, and 464 constraints, problems are : Problem set: 0 solved, 582 unsolved in 30020 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-22 23:22:26] [INFO ] Deduced a trap composed of 87 places in 146 ms of which 3 ms to minimize.
[2024-05-22 23:22:27] [INFO ] Deduced a trap composed of 90 places in 136 ms of which 3 ms to minimize.
[2024-05-22 23:22:28] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 3 ms to minimize.
[2024-05-22 23:22:29] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 3 ms to minimize.
[2024-05-22 23:22:31] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 3 ms to minimize.
[2024-05-22 23:22:32] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 2 ms to minimize.
[2024-05-22 23:22:33] [INFO ] Deduced a trap composed of 96 places in 89 ms of which 1 ms to minimize.
[2024-05-22 23:22:34] [INFO ] Deduced a trap composed of 97 places in 78 ms of which 2 ms to minimize.
[2024-05-22 23:22:34] [INFO ] Deduced a trap composed of 98 places in 78 ms of which 2 ms to minimize.
[2024-05-22 23:22:36] [INFO ] Deduced a trap composed of 355 places in 132 ms of which 2 ms to minimize.
[2024-05-22 23:22:36] [INFO ] Deduced a trap composed of 355 places in 145 ms of which 4 ms to minimize.
[2024-05-22 23:22:37] [INFO ] Deduced a trap composed of 355 places in 120 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
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 30028 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 60301ms problems are : Problem set: 0 solved, 582 unsolved
Search for dead transitions found 0 dead transitions in 60306ms
Starting structural reductions in LTL mode, iteration 1 : 452/490 places, 583/635 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60836 ms. Remains : 452/490 places, 583/635 transitions.
Stuttering acceptance computed with spot in 369 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 246 ms.
Product exploration explored 100000 steps with 50000 reset in 198 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 20 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 61748 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 1 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 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 90 ms. Remains 248 /490 variables (removed 242) and now considering 378/635 (removed 257) transitions.
[2024-05-22 23:22:45] [INFO ] Flow matrix only has 350 transitions (discarded 28 similar events)
// Phase 1: matrix 350 rows 248 cols
[2024-05-22 23:22:45] [INFO ] Computed 12 invariants in 3 ms
[2024-05-22 23:22:45] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-22 23:22:45] [INFO ] Flow matrix only has 350 transitions (discarded 28 similar events)
[2024-05-22 23:22:45] [INFO ] Invariant cache hit.
[2024-05-22 23:22:46] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2024-05-22 23:22:46] [INFO ] Redundant transitions in 19 ms returned []
Running 265 sub problems to find dead transitions.
[2024-05-22 23:22:46] [INFO ] Flow matrix only has 350 transitions (discarded 28 similar events)
[2024-05-22 23:22:46] [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 9453 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 12114 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 21792ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 21795ms
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 22247 ms. Remains : 248/490 places, 378/635 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-01 finished in 22401 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 97 ms. Remains 245 /490 variables (removed 245) and now considering 364/635 (removed 271) transitions.
[2024-05-22 23:23:08] [INFO ] Flow matrix only has 345 transitions (discarded 19 similar events)
// Phase 1: matrix 345 rows 245 cols
[2024-05-22 23:23:08] [INFO ] Computed 12 invariants in 3 ms
[2024-05-22 23:23:08] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-05-22 23:23:08] [INFO ] Flow matrix only has 345 transitions (discarded 19 similar events)
[2024-05-22 23:23:08] [INFO ] Invariant cache hit.
[2024-05-22 23:23:08] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-05-22 23:23:08] [INFO ] Redundant transitions in 4 ms returned []
Running 172 sub problems to find dead transitions.
[2024-05-22 23:23:08] [INFO ] Flow matrix only has 345 transitions (discarded 19 similar events)
[2024-05-22 23:23:08] [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 6092 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 6813 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 13000ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 13002ms
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 13439 ms. Remains : 245/490 places, 364/635 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-02
Stuttering criterion allowed to conclude after 4171 steps with 248 reset in 62 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-02 finished in 13556 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 42 ms. Remains 449 /490 variables (removed 41) and now considering 579/635 (removed 56) transitions.
// Phase 1: matrix 579 rows 449 cols
[2024-05-22 23:23:21] [INFO ] Computed 12 invariants in 7 ms
[2024-05-22 23:23:21] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-22 23:23:21] [INFO ] Invariant cache hit.
[2024-05-22 23:23:22] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Running 578 sub problems to find dead transitions.
[2024-05-22 23:23:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 1 (OVERLAPS) 1/449 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/449 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 3 (OVERLAPS) 579/1028 variables, 449/461 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1028 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1028/1028 variables, and 461 constraints, problems are : Problem set: 0 solved, 578 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 449/449 constraints, PredecessorRefiner: 578/578 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 578 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/448 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 1 (OVERLAPS) 1/449 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/449 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 3 (OVERLAPS) 579/1028 variables, 449/461 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1028 variables, 578/1039 constraints. Problems are: Problem set: 0 solved, 578 unsolved
[2024-05-22 23:24:04] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 3 ms to minimize.
[2024-05-22 23:24:05] [INFO ] Deduced a trap composed of 90 places in 137 ms of which 3 ms to minimize.
[2024-05-22 23:24:06] [INFO ] Deduced a trap composed of 91 places in 145 ms of which 3 ms to minimize.
[2024-05-22 23:24:07] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 3 ms to minimize.
[2024-05-22 23:24:09] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 2 ms to minimize.
[2024-05-22 23:24:10] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 3 ms to minimize.
[2024-05-22 23:24:11] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 3 ms to minimize.
[2024-05-22 23:24:12] [INFO ] Deduced a trap composed of 97 places in 96 ms of which 2 ms to minimize.
[2024-05-22 23:24:13] [INFO ] Deduced a trap composed of 354 places in 136 ms of which 3 ms to minimize.
[2024-05-22 23:24:13] [INFO ] Deduced a trap composed of 357 places in 136 ms of which 4 ms to minimize.
[2024-05-22 23:24:14] [INFO ] Deduced a trap composed of 376 places in 129 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1028 variables, 11/1050 constraints. Problems are: Problem set: 0 solved, 578 unsolved
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 30028 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 60285ms 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 60756 ms. Remains : 449/490 places, 579/635 transitions.
Stuttering acceptance computed with spot in 108 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 930 steps with 11 reset in 5 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-04 finished in 60895 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 1 ms
Free SCC test removed 51 places
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 52 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 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 1 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 85 ms. Remains 249 /490 variables (removed 241) and now considering 370/635 (removed 265) transitions.
[2024-05-22 23:24:22] [INFO ] Flow matrix only has 351 transitions (discarded 19 similar events)
// Phase 1: matrix 351 rows 249 cols
[2024-05-22 23:24:22] [INFO ] Computed 12 invariants in 6 ms
[2024-05-22 23:24:22] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-22 23:24:22] [INFO ] Flow matrix only has 351 transitions (discarded 19 similar events)
[2024-05-22 23:24:22] [INFO ] Invariant cache hit.
[2024-05-22 23:24:22] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2024-05-22 23:24:22] [INFO ] Redundant transitions in 2 ms returned []
Running 176 sub problems to find dead transitions.
[2024-05-22 23:24:22] [INFO ] Flow matrix only has 351 transitions (discarded 19 similar events)
[2024-05-22 23:24:22] [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 6377 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 7220 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 13693ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 13695ms
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 14128 ms. Remains : 249/490 places, 370/635 transitions.
Stuttering acceptance computed with spot in 128 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 6009 reset in 501 ms.
Product exploration explored 100000 steps with 6032 reset in 561 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 109 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 142 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2500 resets) in 1081 ms. (36 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (42 resets) in 65 ms. (606 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (43 resets) in 62 ms. (634 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (43 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
[2024-05-22 23:24:38] [INFO ] Flow matrix only has 351 transitions (discarded 19 similar events)
[2024-05-22 23:24:38] [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 273 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 237 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 515ms 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 2 ms. (steps per millisecond=5 )
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 15 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 158 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 16739 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 34 ms. Remains 453 /490 variables (removed 37) and now considering 585/635 (removed 50) transitions.
// Phase 1: matrix 585 rows 453 cols
[2024-05-22 23:24:39] [INFO ] Computed 12 invariants in 6 ms
[2024-05-22 23:24:39] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-22 23:24:39] [INFO ] Invariant cache hit.
[2024-05-22 23:24:39] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Running 584 sub problems to find dead transitions.
[2024-05-22 23:24:39] [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
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 30019 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-22 23:25:22] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 3 ms to minimize.
[2024-05-22 23:25:22] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 2 ms to minimize.
[2024-05-22 23:25:22] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 2 ms to minimize.
[2024-05-22 23:25:22] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 2 ms to minimize.
[2024-05-22 23:25:22] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 4 ms to minimize.
[2024-05-22 23:25:22] [INFO ] Deduced a trap composed of 96 places in 99 ms of which 3 ms to minimize.
[2024-05-22 23:25:22] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-05-22 23:25:23] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 2 ms to minimize.
[2024-05-22 23:25:24] [INFO ] Deduced a trap composed of 90 places in 146 ms of which 3 ms to minimize.
[2024-05-22 23:25:25] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 3 ms to minimize.
[2024-05-22 23:25:26] [INFO ] Deduced a trap composed of 93 places in 155 ms of which 4 ms to minimize.
[2024-05-22 23:25:27] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 6 ms to minimize.
[2024-05-22 23:25:29] [INFO ] Deduced a trap composed of 96 places in 85 ms of which 1 ms to minimize.
[2024-05-22 23:25:30] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 2 ms to minimize.
[2024-05-22 23:25:31] [INFO ] Deduced a trap composed of 97 places in 100 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
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
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 30033 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 60281ms problems are : Problem set: 0 solved, 584 unsolved
Search for dead transitions found 0 dead transitions in 60288ms
Starting structural reductions in LTL mode, iteration 1 : 453/490 places, 585/635 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60778 ms. Remains : 453/490 places, 585/635 transitions.
Stuttering acceptance computed with spot in 185 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 0 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-06 finished in 60981 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 1 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 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 1 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 68 ms. Remains 247 /490 variables (removed 243) and now considering 367/635 (removed 268) transitions.
[2024-05-22 23:25:40] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
// Phase 1: matrix 348 rows 247 cols
[2024-05-22 23:25:40] [INFO ] Computed 12 invariants in 6 ms
[2024-05-22 23:25:40] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-22 23:25:40] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-22 23:25:40] [INFO ] Invariant cache hit.
[2024-05-22 23:25:40] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 531 ms to find 0 implicit places.
[2024-05-22 23:25:40] [INFO ] Redundant transitions in 1 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-22 23:25:40] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-22 23:25:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 10/247 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/247 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 347/594 variables, 247/259 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/594 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 0/594 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 594/595 variables, and 259 constraints, problems are : Problem set: 0 solved, 174 unsolved in 6418 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 7252 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 13762ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 13764ms
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 14375 ms. Remains : 247/490 places, 367/635 transitions.
Stuttering acceptance computed with spot in 37 ms :[false]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-07
Product exploration explored 100000 steps with 6139 reset in 400 ms.
Product exploration explored 100000 steps with 6180 reset in 481 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 112 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 29 ms :[false]
RANDOM walk for 33904 steps (2093 resets) in 312 ms. (108 steps per ms) remains 0/4 properties
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 218 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 37 ms :[false]
Stuttering acceptance computed with spot in 38 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 10 ms. Remains 247 /247 variables (removed 0) and now considering 367/367 (removed 0) transitions.
[2024-05-22 23:25:56] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-22 23:25:56] [INFO ] Invariant cache hit.
[2024-05-22 23:25:56] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-22 23:25:56] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-22 23:25:56] [INFO ] Invariant cache hit.
[2024-05-22 23:25:56] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
[2024-05-22 23:25:56] [INFO ] Redundant transitions in 1 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-22 23:25:56] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-22 23:25:56] [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 6294 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 7255 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 13655ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 13656ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14102 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 104 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 34 ms :[false]
RANDOM walk for 40000 steps (2474 resets) in 467 ms. (85 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (45 resets) in 81 ms. (487 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (45 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
[2024-05-22 23:26:10] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-22 23:26:10] [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 208 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 178 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 418ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 21 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=21 )
Parikh walk visited 2 properties in 1 ms.
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 214 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 35 ms :[false]
Stuttering acceptance computed with spot in 34 ms :[false]
Stuttering acceptance computed with spot in 31 ms :[false]
Product exploration explored 100000 steps with 6152 reset in 410 ms.
Product exploration explored 100000 steps with 6119 reset in 447 ms.
Built C files in :
/tmp/ltsmin15393416146853573033
[2024-05-22 23:26:12] [INFO ] Computing symmetric may disable matrix : 367 transitions.
[2024-05-22 23:26:12] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:26:12] [INFO ] Computing symmetric may enable matrix : 367 transitions.
[2024-05-22 23:26:12] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:26:12] [INFO ] Computing Do-Not-Accords matrix : 367 transitions.
[2024-05-22 23:26:12] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:26:12] [INFO ] Built C files in 222ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15393416146853573033
Running compilation step : cd /tmp/ltsmin15393416146853573033;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1030 ms.
Running link step : cd /tmp/ltsmin15393416146853573033;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin15393416146853573033;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15818177848204092079.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 11 ms. Remains 247 /247 variables (removed 0) and now considering 367/367 (removed 0) transitions.
[2024-05-22 23:26:27] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-22 23:26:27] [INFO ] Invariant cache hit.
[2024-05-22 23:26:27] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-22 23:26:27] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-22 23:26:27] [INFO ] Invariant cache hit.
[2024-05-22 23:26:27] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-05-22 23:26:27] [INFO ] Redundant transitions in 1 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-22 23:26:27] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-22 23:26:27] [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 6350 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 7189 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 13619ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 13620ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13948 ms. Remains : 247/247 places, 367/367 transitions.
Built C files in :
/tmp/ltsmin12370354331817739025
[2024-05-22 23:26:41] [INFO ] Computing symmetric may disable matrix : 367 transitions.
[2024-05-22 23:26:41] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:26:41] [INFO ] Computing symmetric may enable matrix : 367 transitions.
[2024-05-22 23:26:41] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:26:41] [INFO ] Computing Do-Not-Accords matrix : 367 transitions.
[2024-05-22 23:26:41] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:26:41] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12370354331817739025
Running compilation step : cd /tmp/ltsmin12370354331817739025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 856 ms.
Running link step : cd /tmp/ltsmin12370354331817739025;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin12370354331817739025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13370069284782240831.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 23:26:56] [INFO ] Flatten gal took : 17 ms
[2024-05-22 23:26:56] [INFO ] Flatten gal took : 16 ms
[2024-05-22 23:26:56] [INFO ] Time to serialize gal into /tmp/LTL9887869362285145893.gal : 5 ms
[2024-05-22 23:26:56] [INFO ] Time to serialize properties into /tmp/LTL6724800495894276743.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9887869362285145893.gal' '-t' 'CGAL' '-hoa' '/tmp/aut922381768288963054.hoa' '-atoms' '/tmp/LTL6724800495894276743.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL6724800495894276743.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut922381768288963054.hoa
Detected timeout of ITS tools.
[2024-05-22 23:27:11] [INFO ] Flatten gal took : 14 ms
[2024-05-22 23:27:11] [INFO ] Flatten gal took : 14 ms
[2024-05-22 23:27:11] [INFO ] Time to serialize gal into /tmp/LTL3078780793555795718.gal : 3 ms
[2024-05-22 23:27:11] [INFO ] Time to serialize properties into /tmp/LTL14400857194276415307.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3078780793555795718.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14400857194276415307.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((("(p494==1)")||(G("(p552!=1)")))||(G(("(p494==1)")||(X("(p552==1)")))))))
Formula 0 simplified : G(!"(p494==1)" & F!"(p552!=1)" & F(!"(p494==1)" & X!"(p552==1)"))
Detected timeout of ITS tools.
[2024-05-22 23:27:26] [INFO ] Flatten gal took : 15 ms
[2024-05-22 23:27:26] [INFO ] Applying decomposition
[2024-05-22 23:27:26] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13085247151924075851.txt' '-o' '/tmp/graph13085247151924075851.bin' '-w' '/tmp/graph13085247151924075851.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13085247151924075851.bin' '-l' '-1' '-v' '-w' '/tmp/graph13085247151924075851.weights' '-q' '0' '-e' '0.001'
[2024-05-22 23:27:26] [INFO ] Decomposing Gal with order
[2024-05-22 23:27:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 23:27:27] [INFO ] Removed a total of 161 redundant transitions.
[2024-05-22 23:27:27] [INFO ] Flatten gal took : 128 ms
[2024-05-22 23:27:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 10 ms.
[2024-05-22 23:27:27] [INFO ] Time to serialize gal into /tmp/LTL11874752885955255418.gal : 5 ms
[2024-05-22 23:27:27] [INFO ] Time to serialize properties into /tmp/LTL5849744797256864849.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11874752885955255418.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5849744797256864849.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((("(i4.u14.p494==1)")||(G("(i5.u18.p552!=1)")))||(G(("(i4.u14.p494==1)")||(X("(i5.u18.p552==1)")))))))
Formula 0 simplified : G(!"(i4.u14.p494==1)" & F!"(i5.u18.p552!=1)" & F(!"(i4.u14.p494==1)" & X!"(i5.u18.p552==1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2.49754e+13 deadlock states
Detected timeout of ITS tools.
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-07 finished in 121930 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 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 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 0 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 108 ms. Remains 248 /490 variables (removed 242) and now considering 369/635 (removed 266) transitions.
[2024-05-22 23:27:42] [INFO ] Flow matrix only has 350 transitions (discarded 19 similar events)
// Phase 1: matrix 350 rows 248 cols
[2024-05-22 23:27:42] [INFO ] Computed 12 invariants in 6 ms
[2024-05-22 23:27:42] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-05-22 23:27:42] [INFO ] Flow matrix only has 350 transitions (discarded 19 similar events)
[2024-05-22 23:27:42] [INFO ] Invariant cache hit.
[2024-05-22 23:27:42] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
[2024-05-22 23:27:42] [INFO ] Redundant transitions in 1 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-22 23:27:42] [INFO ] Flow matrix only has 350 transitions (discarded 19 similar events)
[2024-05-22 23:27:42] [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 6386 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 7125 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 13590ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 13592ms
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 14208 ms. Remains : 248/490 places, 369/635 transitions.
Stuttering acceptance computed with spot in 101 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 1 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-08 finished in 14328 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 0 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 1 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 1 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 1 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 69 ms. Remains 246 /490 variables (removed 244) and now considering 376/635 (removed 259) transitions.
[2024-05-22 23:27:56] [INFO ] Flow matrix only has 358 transitions (discarded 18 similar events)
// Phase 1: matrix 358 rows 246 cols
[2024-05-22 23:27:56] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 23:27:56] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-22 23:27:56] [INFO ] Flow matrix only has 358 transitions (discarded 18 similar events)
[2024-05-22 23:27:56] [INFO ] Invariant cache hit.
[2024-05-22 23:27:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 23:27:56] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2024-05-22 23:27:56] [INFO ] Redundant transitions in 1 ms returned []
Running 292 sub problems to find dead transitions.
[2024-05-22 23:27:56] [INFO ] Flow matrix only has 358 transitions (discarded 18 similar events)
[2024-05-22 23:27:56] [INFO ] Invariant cache hit.
[2024-05-22 23:27:56] [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 13028 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 19097 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 32263ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 32269ms
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 32715 ms. Remains : 246/490 places, 376/635 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-09
Stuttering criterion allowed to conclude after 3 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 32774 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 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 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 0 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 61 ms. Remains 247 /490 variables (removed 243) and now considering 367/635 (removed 268) transitions.
[2024-05-22 23:28:29] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
// Phase 1: matrix 348 rows 247 cols
[2024-05-22 23:28:29] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 23:28:29] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-22 23:28:29] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-22 23:28:29] [INFO ] Invariant cache hit.
[2024-05-22 23:28:29] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2024-05-22 23:28:29] [INFO ] Redundant transitions in 1 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-22 23:28:29] [INFO ] Flow matrix only has 348 transitions (discarded 19 similar events)
[2024-05-22 23:28:29] [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 6147 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 7276 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 13506ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 13514ms
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 13936 ms. Remains : 247/490 places, 367/635 transitions.
Stuttering acceptance computed with spot in 118 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 14080 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 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 0 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 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
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 68 ms. Remains 246 /490 variables (removed 244) and now considering 365/635 (removed 270) transitions.
[2024-05-22 23:28:43] [INFO ] Flow matrix only has 347 transitions (discarded 18 similar events)
// Phase 1: matrix 347 rows 246 cols
[2024-05-22 23:28:43] [INFO ] Computed 12 invariants in 2 ms
[2024-05-22 23:28:43] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-22 23:28:43] [INFO ] Flow matrix only has 347 transitions (discarded 18 similar events)
[2024-05-22 23:28:43] [INFO ] Invariant cache hit.
[2024-05-22 23:28:43] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
[2024-05-22 23:28:43] [INFO ] Redundant transitions in 1 ms returned []
Running 173 sub problems to find dead transitions.
[2024-05-22 23:28:43] [INFO ] Flow matrix only has 347 transitions (discarded 18 similar events)
[2024-05-22 23:28:43] [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 6400 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 7030 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 13528ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 13530ms
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 14106 ms. Remains : 246/490 places, 365/635 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10b-LTLFireability-11
Stuttering criterion allowed to conclude after 4708 steps with 285 reset in 21 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-11 finished in 14194 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 38 ms. Remains 453 /490 variables (removed 37) and now considering 585/635 (removed 50) transitions.
// Phase 1: matrix 585 rows 453 cols
[2024-05-22 23:28:57] [INFO ] Computed 12 invariants in 9 ms
[2024-05-22 23:28:57] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-22 23:28:57] [INFO ] Invariant cache hit.
[2024-05-22 23:28:58] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
Running 584 sub problems to find dead transitions.
[2024-05-22 23:28:58] [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
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 30032 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-22 23:29:39] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 3 ms to minimize.
[2024-05-22 23:29:39] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2024-05-22 23:29:40] [INFO ] Deduced a trap composed of 87 places in 143 ms of which 2 ms to minimize.
[2024-05-22 23:29:41] [INFO ] Deduced a trap composed of 90 places in 138 ms of which 3 ms to minimize.
[2024-05-22 23:29:41] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 3 ms to minimize.
[2024-05-22 23:29:42] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 3 ms to minimize.
[2024-05-22 23:29:43] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 2 ms to minimize.
[2024-05-22 23:29:44] [INFO ] Deduced a trap composed of 94 places in 119 ms of which 3 ms to minimize.
[2024-05-22 23:29:45] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 2 ms to minimize.
[2024-05-22 23:29:46] [INFO ] Deduced a trap composed of 96 places in 93 ms of which 2 ms to minimize.
[2024-05-22 23:29:46] [INFO ] Deduced a trap composed of 116 places in 84 ms of which 2 ms to minimize.
[2024-05-22 23:29:46] [INFO ] Deduced a trap composed of 97 places in 89 ms of which 2 ms to minimize.
[2024-05-22 23:29:47] [INFO ] Deduced a trap composed of 98 places in 80 ms of which 2 ms to minimize.
[2024-05-22 23:29:49] [INFO ] Deduced a trap composed of 356 places in 134 ms of which 3 ms to minimize.
[2024-05-22 23:29:49] [INFO ] Deduced a trap composed of 356 places in 137 ms of which 3 ms to minimize.
[2024-05-22 23:29:49] [INFO ] Deduced a trap composed of 356 places in 121 ms of which 2 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 30024 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 60249ms problems are : Problem set: 0 solved, 584 unsolved
Search for dead transitions found 0 dead transitions in 60255ms
Starting structural reductions in LTL mode, iteration 1 : 453/490 places, 585/635 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60769 ms. Remains : 453/490 places, 585/635 transitions.
Stuttering acceptance computed with spot in 164 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 290 steps with 3 reset in 1 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-12 finished in 60966 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 30 ms. Remains 452 /490 variables (removed 38) and now considering 583/635 (removed 52) transitions.
// Phase 1: matrix 583 rows 452 cols
[2024-05-22 23:29:58] [INFO ] Computed 12 invariants in 12 ms
[2024-05-22 23:29:58] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-22 23:29:58] [INFO ] Invariant cache hit.
[2024-05-22 23:29:59] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
Running 582 sub problems to find dead transitions.
[2024-05-22 23:29:59] [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 30016 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-22 23:30:41] [INFO ] Deduced a trap composed of 87 places in 140 ms of which 3 ms to minimize.
[2024-05-22 23:30:42] [INFO ] Deduced a trap composed of 90 places in 141 ms of which 3 ms to minimize.
[2024-05-22 23:30:43] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 2 ms to minimize.
[2024-05-22 23:30:44] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 3 ms to minimize.
[2024-05-22 23:30:45] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 3 ms to minimize.
[2024-05-22 23:30:46] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 2 ms to minimize.
[2024-05-22 23:30:47] [INFO ] Deduced a trap composed of 96 places in 81 ms of which 2 ms to minimize.
[2024-05-22 23:30:48] [INFO ] Deduced a trap composed of 97 places in 90 ms of which 2 ms to minimize.
[2024-05-22 23:30:49] [INFO ] Deduced a trap composed of 98 places in 81 ms of which 1 ms to minimize.
[2024-05-22 23:30:50] [INFO ] Deduced a trap composed of 355 places in 136 ms of which 2 ms to minimize.
[2024-05-22 23:30:51] [INFO ] Deduced a trap composed of 358 places in 130 ms of which 3 ms to minimize.
[2024-05-22 23:30:51] [INFO ] Deduced a trap composed of 355 places in 127 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
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 30023 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 60262ms problems are : Problem set: 0 solved, 582 unsolved
Search for dead transitions found 0 dead transitions in 60266ms
Starting structural reductions in LTL mode, iteration 1 : 452/490 places, 583/635 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60751 ms. Remains : 452/490 places, 583/635 transitions.
Stuttering acceptance computed with spot in 96 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 141 ms.
Product exploration explored 100000 steps with 50000 reset in 144 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 21 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 28 ms. Remains 452 /490 variables (removed 38) and now considering 584/635 (removed 51) transitions.
// Phase 1: matrix 584 rows 452 cols
[2024-05-22 23:30:59] [INFO ] Computed 12 invariants in 7 ms
[2024-05-22 23:30:59] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-22 23:30:59] [INFO ] Invariant cache hit.
[2024-05-22 23:31:00] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Running 583 sub problems to find dead transitions.
[2024-05-22 23:31:00] [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
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 1036/1036 variables, and 464 constraints, problems are : Problem set: 0 solved, 583 unsolved in 30016 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-22 23:31:42] [INFO ] Deduced a trap composed of 87 places in 185 ms of which 3 ms to minimize.
[2024-05-22 23:31:43] [INFO ] Deduced a trap composed of 91 places in 83 ms of which 1 ms to minimize.
[2024-05-22 23:31:44] [INFO ] Deduced a trap composed of 91 places in 139 ms of which 3 ms to minimize.
[2024-05-22 23:31:45] [INFO ] Deduced a trap composed of 92 places in 142 ms of which 3 ms to minimize.
[2024-05-22 23:31:46] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 3 ms to minimize.
[2024-05-22 23:31:47] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 2 ms to minimize.
[2024-05-22 23:31:48] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 2 ms to minimize.
[2024-05-22 23:31:48] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 2 ms to minimize.
[2024-05-22 23:31:49] [INFO ] Deduced a trap composed of 98 places in 82 ms of which 2 ms to minimize.
[2024-05-22 23:31:50] [INFO ] Deduced a trap composed of 97 places in 81 ms of which 2 ms to minimize.
[2024-05-22 23:31:51] [INFO ] Deduced a trap composed of 355 places in 135 ms of which 3 ms to minimize.
[2024-05-22 23:31:52] [INFO ] Deduced a trap composed of 359 places in 133 ms of which 3 ms to minimize.
[2024-05-22 23:31:52] [INFO ] Deduced a trap composed of 356 places in 130 ms of which 3 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 30017 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 60273ms problems are : Problem set: 0 solved, 583 unsolved
Search for dead transitions found 0 dead transitions in 60278ms
Starting structural reductions in LTL mode, iteration 1 : 452/490 places, 584/635 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60764 ms. Remains : 452/490 places, 584/635 transitions.
Stuttering acceptance computed with spot in 147 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 0 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-14 finished in 60929 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 28 ms. Remains 455 /490 variables (removed 35) and now considering 588/635 (removed 47) transitions.
// Phase 1: matrix 588 rows 455 cols
[2024-05-22 23:32:00] [INFO ] Computed 12 invariants in 7 ms
[2024-05-22 23:32:00] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-22 23:32:00] [INFO ] Invariant cache hit.
[2024-05-22 23:32:01] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
Running 587 sub problems to find dead transitions.
[2024-05-22 23:32:01] [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
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 1043/1043 variables, and 467 constraints, problems are : Problem set: 0 solved, 587 unsolved in 30019 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-22 23:32:44] [INFO ] Deduced a trap composed of 87 places in 192 ms of which 3 ms to minimize.
[2024-05-22 23:32:45] [INFO ] Deduced a trap composed of 90 places in 154 ms of which 2 ms to minimize.
[2024-05-22 23:32:46] [INFO ] Deduced a trap composed of 91 places in 165 ms of which 3 ms to minimize.
[2024-05-22 23:32:46] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 3 ms to minimize.
[2024-05-22 23:32:47] [INFO ] Deduced a trap composed of 93 places in 154 ms of which 2 ms to minimize.
[2024-05-22 23:32:48] [INFO ] Deduced a trap composed of 96 places in 150 ms of which 3 ms to minimize.
[2024-05-22 23:32:49] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 3 ms to minimize.
[2024-05-22 23:32:50] [INFO ] Deduced a trap composed of 97 places in 147 ms of which 3 ms to minimize.
[2024-05-22 23:32:51] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 2 ms to minimize.
[2024-05-22 23:32:52] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 2 ms to minimize.
[2024-05-22 23:32:54] [INFO ] Deduced a trap composed of 357 places in 126 ms of which 3 ms to minimize.
[2024-05-22 23:32:54] [INFO ] Deduced a trap composed of 357 places in 149 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 30024 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 60260ms problems are : Problem set: 0 solved, 587 unsolved
Search for dead transitions found 0 dead transitions in 60269ms
Starting structural reductions in LTL mode, iteration 1 : 455/490 places, 588/635 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60746 ms. Remains : 455/490 places, 588/635 transitions.
Stuttering acceptance computed with spot in 554 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 0 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10b-LTLFireability-15 finished in 61327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1)||G((p0||X(!p1))))))'
[2024-05-22 23:33:02] [INFO ] Flatten gal took : 21 ms
Using solver Z3 to compute partial order matrices.
[2024-05-22 23:33:02] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin6957504333369502160
[2024-05-22 23:33:02] [INFO ] Computing symmetric may disable matrix : 635 transitions.
[2024-05-22 23:33:02] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:33:02] [INFO ] Flatten gal took : 41 ms
[2024-05-22 23:33:02] [INFO ] Computing symmetric may enable matrix : 635 transitions.
[2024-05-22 23:33:02] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2332860063875858609.txt' '-o' '/tmp/graph2332860063875858609.bin' '-w' '/tmp/graph2332860063875858609.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2332860063875858609.bin' '-l' '-1' '-v' '-w' '/tmp/graph2332860063875858609.weights' '-q' '0' '-e' '0.001'
[2024-05-22 23:33:02] [INFO ] Decomposing Gal with order
[2024-05-22 23:33:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 23:33:02] [INFO ] Computing Do-Not-Accords matrix : 635 transitions.
[2024-05-22 23:33:02] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 23:33:02] [INFO ] Built C files in 193ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6957504333369502160
Running compilation step : cd /tmp/ltsmin6957504333369502160;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-22 23:33:02] [INFO ] Removed a total of 252 redundant transitions.
[2024-05-22 23:33:02] [INFO ] Flatten gal took : 125 ms
[2024-05-22 23:33:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 14 ms.
[2024-05-22 23:33:02] [INFO ] Time to serialize gal into /tmp/LTLFireability12314367715681649412.gal : 29 ms
[2024-05-22 23:33:02] [INFO ] Time to serialize properties into /tmp/LTLFireability231442653685537563.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12314367715681649412.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability231442653685537563.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((("(i6.i1.i1.u55.p494==1)")||(G("(i8.u70.p552!=1)")))||(G(("(i6.i1.i1.u55.p494==1)")||(X("(i8.u70.p552==1)")))))))
Formula 0 simplified : G(!"(i6.i1.i1.u55.p494==1)" & F!"(i8.u70.p552!=1)" & F(!"(i6.i1.i1.u55.p494==1)" & X!"(i8.u70.p552==1)"))
Compilation finished in 2168 ms.
Running link step : cd /tmp/ltsmin6957504333369502160;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin6957504333369502160;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((LTLAPp0==true)||[]((LTLAPp1==true))||[](((LTLAPp0==true)||X(!(LTLAPp1==true))))))' '--buchi-type=spotba'
LTSmin run took 197225 ms.
FORMULA FlexibleBarrier-PT-10b-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 950907 ms.
BK_STOP 1716420982134
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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:
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="itstools"
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 itstools"
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 r180-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 '
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 ;