fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r180-tall-171640602700140
Last Updated
July 7, 2024

About the Execution of ITS-Tools for FlexibleBarrier-PT-20b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16205.348 3600000.00 8419337.00 7941.80 F?TFFFFFFFF?FT?F 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-171640602700140.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-20b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640602700140
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.6K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 08:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 13 08:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 13 08:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 13 08:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 1.5M 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-20b-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-20b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716431509058

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-20b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-23 02:31:50] [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-23 02:31:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:31:50] [INFO ] Load time of PNML (sax parser for PT used): 243 ms
[2024-05-23 02:31:50] [INFO ] Transformed 5372 places.
[2024-05-23 02:31:50] [INFO ] Transformed 6193 transitions.
[2024-05-23 02:31:50] [INFO ] Found NUPN structural information;
[2024-05-23 02:31:50] [INFO ] Parsed PT model containing 5372 places and 6193 transitions and 15575 arcs in 398 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-20b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 5372 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5372/5372 places, 6193/6193 transitions.
Discarding 2256 places :
Symmetric choice reduction at 0 with 2256 rule applications. Total rules 2256 place count 3116 transition count 3937
Iterating global reduction 0 with 2256 rules applied. Total rules applied 4512 place count 3116 transition count 3937
Discarding 1077 places :
Symmetric choice reduction at 0 with 1077 rule applications. Total rules 5589 place count 2039 transition count 2860
Iterating global reduction 0 with 1077 rules applied. Total rules applied 6666 place count 2039 transition count 2860
Discarding 700 places :
Symmetric choice reduction at 0 with 700 rule applications. Total rules 7366 place count 1339 transition count 2160
Iterating global reduction 0 with 700 rules applied. Total rules applied 8066 place count 1339 transition count 2160
Ensure Unique test removed 341 transitions
Reduce isomorphic transitions removed 341 transitions.
Iterating post reduction 0 with 341 rules applied. Total rules applied 8407 place count 1339 transition count 1819
Applied a total of 8407 rules in 1277 ms. Remains 1339 /5372 variables (removed 4033) and now considering 1819/6193 (removed 4374) transitions.
// Phase 1: matrix 1819 rows 1339 cols
[2024-05-23 02:31:52] [INFO ] Computed 22 invariants in 60 ms
[2024-05-23 02:31:53] [INFO ] Implicit Places using invariants in 1082 ms returned []
[2024-05-23 02:31:53] [INFO ] Invariant cache hit.
[2024-05-23 02:31:54] [INFO ] Implicit Places using invariants and state equation in 1583 ms returned []
Implicit Place search using SMT with State Equation took 2759 ms to find 0 implicit places.
Running 1818 sub problems to find dead transitions.
[2024-05-23 02:31:54] [INFO ] Invariant cache hit.
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 1338/3158 variables, and 0 constraints, problems are : Problem set: 0 solved, 1818 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1339 constraints, PredecessorRefiner: 1818/1818 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1818 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1338/3158 variables, and 0 constraints, problems are : Problem set: 0 solved, 1818 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1339 constraints, PredecessorRefiner: 0/1818 constraints, Known Traps: 0/0 constraints]
After SMT, in 63073ms problems are : Problem set: 0 solved, 1818 unsolved
Search for dead transitions found 0 dead transitions in 63110ms
Starting structural reductions in LTL mode, iteration 1 : 1339/5372 places, 1819/6193 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67180 ms. Remains : 1339/5372 places, 1819/6193 transitions.
Support contains 40 out of 1339 places after structural reductions.
[2024-05-23 02:32:58] [INFO ] Flatten gal took : 136 ms
[2024-05-23 02:32:58] [INFO ] Flatten gal took : 86 ms
[2024-05-23 02:32:58] [INFO ] Input system was already deterministic with 1819 transitions.
RANDOM walk for 40000 steps (293 resets) in 1823 ms. (21 steps per ms) remains 27/33 properties
BEST_FIRST walk for 4003 steps (7 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (6 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (7 resets) in 21 ms. (182 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (6 resets) in 25 ms. (154 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (7 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (7 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (7 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (7 resets) in 13 ms. (285 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (7 resets) in 17 ms. (222 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 27/27 properties
[2024-05-23 02:32:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 1 (OVERLAPS) 1074/1109 variables, 16/16 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1109 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 230/1339 variables, 6/22 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1339 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 1819/3158 variables, 1339/1361 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3158 variables, 0/1361 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 0/3158 variables, 0/1361 constraints. Problems are: Problem set: 1 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3158/3158 variables, and 1361 constraints, problems are : Problem set: 1 solved, 26 unsolved in 3446 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 1339/1339 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 1076/1109 variables, 16/16 constraints. Problems are: Problem set: 1 solved, 26 unsolved
[2024-05-23 02:33:03] [INFO ] Deduced a trap composed of 418 places in 441 ms of which 66 ms to minimize.
[2024-05-23 02:33:04] [INFO ] Deduced a trap composed of 416 places in 398 ms of which 8 ms to minimize.
[2024-05-23 02:33:04] [INFO ] Deduced a trap composed of 415 places in 382 ms of which 7 ms to minimize.
[2024-05-23 02:33:05] [INFO ] Deduced a trap composed of 416 places in 395 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1109 variables, 4/20 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1109 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 230/1339 variables, 6/26 constraints. Problems are: Problem set: 1 solved, 26 unsolved
[2024-05-23 02:33:06] [INFO ] Deduced a trap composed of 428 places in 478 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1339 variables, 1/27 constraints. Problems are: Problem set: 1 solved, 26 unsolved
[2024-05-23 02:33:07] [INFO ] Deduced a trap composed of 99 places in 110 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 1)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 1)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 1)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 1)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 1)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 1)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 1)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 1)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 1)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 1)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 1)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 0)
(s557 0)
(s558 0)
(s559 0)
(s560 0)
(s561 0)
(s562 0)
(s563 0)
(s564 0)
(s565 0)
(s566 0)
(s567 0)
(s568 0)
(s569 0)
(s570 0)
(s571 0)
(s572 0)
(s573 0)
(s574 0)
(s575 0)
(s576 0)
(s577 0)
(s578 0)
(s579 0)
(s580 0)
(s581 0)
(s582 0)
(s583 0)
(s584 0)
(s585 0)
(s586 0)
(s587 0)
(s588 0)
(s589 0)
(s590 0)
(s591 0)
(s592 0)
(s593 0)
(s594 0)
(s595 0)
(s596 0)
(s597 0)
(s598 0)
(s599 0)
(s600 0)
(s601 0)
(s602 0)
(s603 0)
(s604 0)
(s605 0)
(s606 0)
(s607 0)
(s608 0)
(s609 0)
(s610 0)
(s611 0)
(s612 0)
(s613 0)
(s614 0)
(s615 0)
(s616 0)
(s617 0)
(s618 0)
(s619 0)
(s620 0)
(s621 0)
(s622 0)
(s623 0)
(s624 0)
(s625 0)
(s626 1)
(s627 0)
(s628 0)
(s629 0)
(s630 0)
(s631 0)
(s632 0)
(s633 0)
(s634 0)
(s635 0)
(s636 0)
(s637 0)
(s638 0)
(s639 0)
(s640 0)
(s641 0)
(s642 0)
(s643 0)
(s644 0)
(s645 0)
(s646 0)
(s647 0)
(s648 0)
(s649 0)
(s650 0)
(s651 0)
(s652 0)
(s653 0)
(s654 0)
(s655 0)
(s656 0)
(s657 0)
(s658 0)
(s659 0)
(s660 0)
(s661 0)
(s662 0)
(s663 0)
(s664 0)
(s665 0)
(s666 1)
(s667 0)
(s668 0)
(s669 0)
(s670 0)
(s671 0)
(s672 0)
(s673 0)
(s674 0)
(s675 0)
(s676 0)
(s677 0)
(s678 0)
(s679 0)
(s680 0)
(s681 0)
(s682 0)
(s683 0)
(s684 0)
(s685 0)
(s686 0)
(s687 0)
(s688 0)
(s689 0)
(s690 0)
(s691 0)
(s692 0)
(s693 0)
(s694 0)
(s695 0)
(s696 0)
(s697 0)
(s698 0)
(s699 0)
(s700 0)
(s701 0)
(s702 0)
(s703 0)
(s704 0)
(s705 0)
(s706 0)
(s707 0)
(s708 0)
(s709 0)
(s710 0)
(s711 0)
(s712 0)
(s713 0)
(s714 0)
(s715 0)
(s716 0)
(s717 0)
(s718 0)
(s719 0)
(s720 1)
(s721 0)
(s722 0)
(s723 0)
(s724 0)
(s725 0)
(s726 1)
(s727 0)
(s728 0)
(s729 0)
(s730 0)
(s731 0)
(s732 0)
(s733 0)
(s734 0)
(s735 0)
(s736 0)
(s737 0)
(s738 0)
(s739 0)
(s740 0)
(s741 0)
(s742 0)
(s743 0)
(s744 0)
(s745 0)
(s746 0)
(s747 0)
(s748 0)
(s749 0)
(s750 0)
(s751 0)
(s752 0)
(s753 0)
(s754 0)
(s755 0)
(s756 0)
(s757 0)
(s758 0)
(s759 0)
(s760 0)
(s761 0)
(s762 0)
(s763 0)
(s764 0)
(s765 0)
(s766 0)
(s767 0)
(s768 0)
(s769 0)
(s770 0)
(s771 0)
(s772 0)
(s773 0)
(s774 0)
(s775 0)
(s776 0)
(s777 0)
(s778 0)
(s779 0)
(s780 0)
(s781 0)
(s782 0)
(s783 0)
(s784 0)
(s785 0)
(s786 0)
(s787 0)
(s788 0)
(s789 0)
(s790 0)
(s791 0)
(s792 0)
(s793 0)
(s794 0)
(s795 0)
(s796 0)
(s797 0)
(s798 0)
(s799 0)
(s800 0)
(s801 0)
(s802 0)
(s803 0)
(s804 0)
(s805 0)
(s806 0)
(s807 0)
(s808 0)
(s809 0)
(s810 0)
(s811 0)
(s812 0)
(s813 1)
(s814 0)
(s815 0)
(s816 0)
(s817 0)
(s818 0)
(s819 0)
(s820 0)
(s821 0)
(s822 0)
(s823 0)
(s824 0)
(s825 0)
(s826 0)
(s827 0)
(s828 0)
(s829 0)
(s830 1)
(s831 0)
(s832 0)
(s833 0)
(s834 0)
(s835 0)
(s836 0)
(s837 0)
(s838 0)
(s839 0)
(s840 0)
(s841 0)
(s842 0)
(s843 0)
(s844 0)
(s845 0)
(s846 0)
(s847 0)
(s848 0)
(s849 0)
(s850 0)
(s851 0)
(s852 0)
(s853 0)
(s854 0)
(s855 0)
(s856 0)
(s857 0)
(s858 0)
(s859 0)
(s860 0)
(s861 0)
(s862 0)
(s863 0)
(s864 0)
(s865 0)
(s866 0)
(s867 0)
(s868 0)
(s869 1)
(s870 0)
(s871 0)
(s872 0)
(s873 0)
(s874 0)
(s875 0)
(s876 0)
(s877 0)
(s878 0)
(s879 0)
(s880 0)
(s881 0)
(s882 0)
(s883 0)
(s884 0)
(s885 0)
(s886 0)
(s887 0)
(s888 0)
(s889 0)
(s890 0)
(s891 0)
(s892 0)
(s893 0)
(s894 0)
(s895 0)
(s896 0)
(s897 0)
(s898 0)
(s899 0)
(s900 0)
(s901 0)
(s902 0)
(s903 0)
(s904 0)
(s905 0)
(s906 0)
(s907 0)
(s908 0)
(s909 0)
(s910 0)
(s911 0)
(s912 0)
(s913 0)
(s914 0)
(s915 0)
(s916 0)
(s917 0)
(s918 0)
(s919 0)
(s920 0)
(s921 0)
(s922 0)
(s923 0)
(s924 0)
(s925 0)
(s926 0)
(s927 0)
(s928 0)
(s929 0)
(s930 0)
(s931 0)
(s932 0)
(s933 0)
(s934 0)
(s935 0)
(s936 0)
(s937 0)
(s938 0)
(s939 0)
(s940 0)
(s941 0)
(s942 0)
(s943 0)
(s944 0)
(s945 0)
(s946 0)
(s947 0)
(s948 0)
(s949 0)
(s950 0)
(s951 0)
(s952 0)
(s953 0)
(s954 0)
(s955 0)
(s956 0)
(s957 1)
(s958 0)
(s959 0)
(s960 0)
(s961 0)
(s962 0)
(s963 0)
(s964 0)
(s965 0)
(s966 0)
(s967 0)
(s968 0)
(s969 0)
(s970 0)
(s971 0)
(s972 0)
(s973 0)
(s974 0)
(s975 0)
(s976 0)
(s977 0)
(s978 0)
(s979 0)
(s980 0)
(s981 0)
(s982 0)
(s983 0)
(s984 0)
(s985 0)
(s986 0)
(s987 0)
(s988 0)
(s989 0)
(s990 0)
(s991 0)
(s992 0)
(s993 0)
(s994 0)
(s995 0)
(s996 0)
(s997 0)
(s998 0)
(s999 0)
(s1000 0)
(s1001 0)
(s1002 0)
(s1003 0)
(s1004 0)
(s1005 0)
(s1006 0)
(s1007 0)
(s1008 0)
(s1009 0)
(s1010 0)
(s1011 0)
(s1012 0)
(s1013 0)
(s1014 0)
(s1015 0)
(s1016 0)
(s1017 0)
(s1018 0)
(s1019 0)
(s1020 0)
(s1021 0)
(s1022 0)
(s1023 0)
(s1024 0)
(s1025 0)
(s1026 0)
(s1027 0)
(s1028 0)
(s1029 0)
(s1030 0)
(s1031 0)
(s1032 0)
(s1033 0)
(s1034 0)
(s1035 0)
(s1036 0)
(s1037 0)
(s1038 0)
(s1039 0)
(s1040 0)
(s1041 0)
(s1042 0)
(s1043 0)
(s1044 0)
(s1045 0)
(s1046 0)
(s1047 0)
(s1048 0)
(s1049 0)
(s1050 0)
(s1051 0)
(s1052 0)
(s1053 0)
(s1054 0)
(s1055 0)
(s1056 0)
(s1057 0)
(s1058 0)
(s1059 0)
(s1060 0)
(s1061 0)
(s1062 0)
(s1063 0)
(s1064 0)
(s1065 0)
(s1066 0)
(s1067 0)
(s1068 0)
(s1069 0)
(s1070 0)
(s1071 0)
(s1072 0)
(s1073 0)
(s1074 0)
(s1075 0)
(s1076 0)
(s1077 0)
(s1078 0)
(s1079 0)
(s1080 0)
(s1081 0)
(s1082 0)
(s1083 1)
(s1084 0)
(s1085 0)
(s1086 0)
(s1087 0)
(s1088 0)
(s1089 0)
(s1090 0)
(s1091 0)
(s1092 0)
(s1093 0)
(s1094 0)
(s1095 0)
(s1096 0)
(s1097 0)
(s1098 0)
(s1099 0)
(s1100 0)
(s1101 0)
(s1102 0)
(s1103 0)
(s1104 0)
(s1105 0)
(s1106 0)
(s1107 0)
(s1108 0)
(s1109 0)
(s1110 0)
(s1111 0)
(s1112 0)
(s1113 0)
(s1114 0)
(s1115 0)
(s1116 0)
(s1117 0)
(s1118 0)
(s1119 0)
(s1120 0)
(s1121 0)
(s1122 0)
(s1123 0)
(s1124 0)
(s1125 0)
(s1126 0)
(s1127 0)
(s1128 0)
(s1129 0)
(s1130 0)
(s1131 0)
(s1132 0)
(s1133 0)
(s1134 0)
(s1135 0)
(s1136 0)
(s1137 0)
(s1138 0)
(s1139 0)
(s1140 0)
(s1141 0)
(s1142 0)
(s1143 0)
(s1144 0)
(s1145 0)
(s1146 0)
(s1147 0)
(s1148 0)
(s1149 0)
(s1150 0)
(s1151 0)
(s1152 0)
(s1153 0)
(s1154 0)
(s1155 0)
(s1156 0)
(s1157 0)
(s1158 0)
(s1159 0)
(s1160 0)
(s1161 0)
(s1162 0)
(s1163 0)
(s1164 0)
(s1165 0)
(s1166 0)
(s1167 0)
(s1168 0)
(s1169 0)
(s1170 0)
(s1171 0)
(s1172 0)
(s1173 0)
(s1174 0)
(s1175 0)
(s1176 0)
(s1177 0)
(s1178 0)
(s1179 0)
(s1180 0)
(s1181 0)
(s1182 0)
(s1183 0)
(s1184 0)
(s1185 0)
(s1186 0)
(s1187 0)
(s1188 0)
(s1189 0)
(s1190 0)
(s1191 0)
(s1192 0)
(s1193 0)
(s1194 0)
(s1195 0)
(s1196 0)
(s1197 0)
(s1198 0)
(s1199 0)
(s1200 0)
(s1201 0)
(s1202 0)
(s1203 0)
(s1204 0)
(s1205 0)
(s1206 0)
(s1207 0)
(s1208 0)
(s1209 0)
(s1210 0)
(s1211 0)
(s1212 0)
(s1213 0)
(s1214 0)
(s1215 0)
(s1216 0)
(s1217 0)
(s1218 0)
(s1219 0)
(s1220 0)
(s1221 0)
(s1222 0)
(s1223 0)
(s1224 0)
(s1225 0)
(s1226 0)
(s1227 0)
(s1228 0)
(s1229 0)
(s1230 0)
(s1231 0)
(s1232 0)
(s1233 0)
(s1234 0)
(s1235 0)
(s1236 0)
(s1237 0)
(s1238 0)
(s1239 0)
(s1240 0)
(s1241 0)
(s1242 0)
(s1243 0)
(s1244 0)
(s1245 0)
(s1246 0)
(s1247 0)
(s1248 0)
(s1249 0)
(s1250 0)
(s1251 0)
(s1252 0)
(s1253 0)
(s1254 0)
(s1255 0)
(s1256 0)
(s1257 0)
(s1258 0)
(s1259 0)
(s1260 0)
(s1261 0)
(s1262 0)
(s1263 0)
(s1264 0)
(s1265 0)
(s1266 0)
(s1267 0)
(s1268 0)
(s1269 0)
(s1270 0)
(s1271 0)
(s1272 0)
(s1273 0)
(s1274 0)
(s1275 0)
(s1276 0)
(s1277 0)
(s1278 0)
(s1279 0)
(s1280 0)
(s1281 0)
(s1282 0)
(s1283 0)
(s1284 0)
(s1285 0)
(s1286 0)
(s1287 0)
(s1288 0)
(s1289 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1339/3158 variables, and 28 constraints, problems are : Problem set: 1 solved, 26 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/1339 constraints, PredecessorRefiner: 0/27 constraints, Known Traps: 6/6 constraints]
After SMT, in 8504ms problems are : Problem set: 1 solved, 26 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 33 out of 1339 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1339/1339 places, 1819/1819 transitions.
Graph (trivial) has 860 edges and 1339 vertex of which 115 / 1339 are part of one of the 19 SCC in 8 ms
Free SCC test removed 96 places
Drop transitions (Empty/Sink Transition effects.) removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 93 rules applied. Total rules applied 94 place count 1243 transition count 1610
Reduce places removed 93 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 94 rules applied. Total rules applied 188 place count 1150 transition count 1609
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 189 place count 1149 transition count 1609
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 189 place count 1149 transition count 1568
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 271 place count 1108 transition count 1568
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 308 place count 1071 transition count 1531
Iterating global reduction 3 with 37 rules applied. Total rules applied 345 place count 1071 transition count 1531
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 353 place count 1063 transition count 1523
Iterating global reduction 3 with 8 rules applied. Total rules applied 361 place count 1063 transition count 1523
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 362 place count 1063 transition count 1522
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 4 with 254 rules applied. Total rules applied 616 place count 936 transition count 1395
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 636 place count 936 transition count 1375
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 656 place count 916 transition count 1355
Iterating global reduction 5 with 20 rules applied. Total rules applied 676 place count 916 transition count 1355
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 678 place count 915 transition count 1355
Free-agglomeration rule applied 395 times.
Iterating global reduction 5 with 395 rules applied. Total rules applied 1073 place count 915 transition count 960
Reduce places removed 395 places and 0 transitions.
Iterating post reduction 5 with 395 rules applied. Total rules applied 1468 place count 520 transition count 960
Discarding 82 places :
Symmetric choice reduction at 6 with 82 rule applications. Total rules 1550 place count 438 transition count 878
Iterating global reduction 6 with 82 rules applied. Total rules applied 1632 place count 438 transition count 878
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Iterating post reduction 6 with 82 rules applied. Total rules applied 1714 place count 438 transition count 796
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 1724 place count 438 transition count 786
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1725 place count 438 transition count 786
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1726 place count 437 transition count 785
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 100 edges and 436 vertex of which 38 / 436 are part of one of the 19 SCC in 1 ms
Free SCC test removed 19 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 1728 place count 417 transition count 785
Drop transitions (Empty/Sink Transition effects.) removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 8 with 38 rules applied. Total rules applied 1766 place count 417 transition count 747
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 20 Pre rules applied. Total rules applied 1766 place count 417 transition count 727
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 9 with 40 rules applied. Total rules applied 1806 place count 397 transition count 727
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 9 with 40 rules applied. Total rules applied 1846 place count 377 transition count 707
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1848 place count 376 transition count 707
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1850 place count 376 transition count 705
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 10 with 18 rules applied. Total rules applied 1868 place count 376 transition count 687
Free-agglomeration rule applied 18 times.
Iterating global reduction 10 with 18 rules applied. Total rules applied 1886 place count 376 transition count 669
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 10 with 54 rules applied. Total rules applied 1940 place count 353 transition count 638
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 11 with 20 rules applied. Total rules applied 1960 place count 343 transition count 628
Discarding 71 places :
Symmetric choice reduction at 12 with 71 rule applications. Total rules 2031 place count 272 transition count 557
Iterating global reduction 12 with 71 rules applied. Total rules applied 2102 place count 272 transition count 557
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Iterating post reduction 12 with 71 rules applied. Total rules applied 2173 place count 272 transition count 486
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 13 with 15 rules applied. Total rules applied 2188 place count 272 transition count 471
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 2189 place count 272 transition count 471
Applied a total of 2189 rules in 977 ms. Remains 272 /1339 variables (removed 1067) and now considering 471/1819 (removed 1348) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 977 ms. Remains : 272/1339 places, 471/1819 transitions.
RANDOM walk for 40000 steps (2722 resets) in 1190 ms. (33 steps per ms) remains 0/26 properties
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 22 stabilizing places and 22 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0) U (p1&&F(p2)&&G(p0)&&X(p3)))))'
Support contains 4 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 1819/1819 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1317 transition count 1797
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1317 transition count 1797
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 1317 transition count 1793
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 63 place count 1302 transition count 1778
Iterating global reduction 1 with 15 rules applied. Total rules applied 78 place count 1302 transition count 1778
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 88 place count 1302 transition count 1768
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 91 place count 1299 transition count 1765
Iterating global reduction 2 with 3 rules applied. Total rules applied 94 place count 1299 transition count 1765
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 96 place count 1299 transition count 1763
Applied a total of 96 rules in 176 ms. Remains 1299 /1339 variables (removed 40) and now considering 1763/1819 (removed 56) transitions.
// Phase 1: matrix 1763 rows 1299 cols
[2024-05-23 02:33:09] [INFO ] Computed 22 invariants in 46 ms
[2024-05-23 02:33:10] [INFO ] Implicit Places using invariants in 558 ms returned []
[2024-05-23 02:33:10] [INFO ] Invariant cache hit.
[2024-05-23 02:33:11] [INFO ] Implicit Places using invariants and state equation in 1477 ms returned []
Implicit Place search using SMT with State Equation took 2037 ms to find 0 implicit places.
Running 1762 sub problems to find dead transitions.
[2024-05-23 02:33:11] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1298/3062 variables, and 0 constraints, problems are : Problem set: 0 solved, 1762 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1299 constraints, PredecessorRefiner: 1762/1762 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1762 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1298/3062 variables, and 0 constraints, problems are : Problem set: 0 solved, 1762 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1299 constraints, PredecessorRefiner: 0/1762 constraints, Known Traps: 0/0 constraints]
After SMT, in 63007ms problems are : Problem set: 0 solved, 1762 unsolved
Search for dead transitions found 0 dead transitions in 63025ms
Starting structural reductions in LTL mode, iteration 1 : 1299/1339 places, 1763/1819 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65244 ms. Remains : 1299/1339 places, 1763/1819 transitions.
Stuttering acceptance computed with spot in 526 ms :[(OR (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (NOT p0), (NOT p2), (NOT p0), (NOT p3), true]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-00
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-00 finished in 65848 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((!(p0 U p1)||X(X(p2))||G(X(p0)))))))'
Support contains 2 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 1819/1819 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1315 transition count 1795
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1315 transition count 1795
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 1315 transition count 1791
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 69 place count 1298 transition count 1774
Iterating global reduction 1 with 17 rules applied. Total rules applied 86 place count 1298 transition count 1774
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 96 place count 1298 transition count 1764
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 102 place count 1292 transition count 1758
Iterating global reduction 2 with 6 rules applied. Total rules applied 108 place count 1292 transition count 1758
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 113 place count 1292 transition count 1753
Applied a total of 113 rules in 164 ms. Remains 1292 /1339 variables (removed 47) and now considering 1753/1819 (removed 66) transitions.
// Phase 1: matrix 1753 rows 1292 cols
[2024-05-23 02:34:15] [INFO ] Computed 22 invariants in 34 ms
[2024-05-23 02:34:16] [INFO ] Implicit Places using invariants in 779 ms returned []
[2024-05-23 02:34:16] [INFO ] Invariant cache hit.
[2024-05-23 02:34:17] [INFO ] Implicit Places using invariants and state equation in 1283 ms returned []
Implicit Place search using SMT with State Equation took 2070 ms to find 0 implicit places.
Running 1752 sub problems to find dead transitions.
[2024-05-23 02:34:17] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1291/3045 variables, and 0 constraints, problems are : Problem set: 0 solved, 1752 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1292 constraints, PredecessorRefiner: 1752/1752 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1752 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1291 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1752 unsolved
SMT process timed out in 62943ms, After SMT, problems are : Problem set: 0 solved, 1752 unsolved
Search for dead transitions found 0 dead transitions in 62961ms
Starting structural reductions in LTL mode, iteration 1 : 1292/1339 places, 1753/1819 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65203 ms. Remains : 1292/1339 places, 1753/1819 transitions.
Stuttering acceptance computed with spot in 372 ms :[(AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), false]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-01
Product exploration explored 100000 steps with 734 reset in 415 ms.
Product exploration explored 100000 steps with 732 reset in 369 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 172 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[(AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), false]
RANDOM walk for 40000 steps (294 resets) in 468 ms. (85 steps per ms) remains 11/14 properties
BEST_FIRST walk for 40004 steps (24 resets) in 115 ms. (344 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (23 resets) in 36 ms. (1081 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (23 resets) in 47 ms. (833 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (23 resets) in 42 ms. (930 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (24 resets) in 32 ms. (1212 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (24 resets) in 76 ms. (519 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (26 resets) in 42 ms. (930 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (23 resets) in 42 ms. (930 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (24 resets) in 45 ms. (869 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (25 resets) in 32 ms. (1212 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (23 resets) in 31 ms. (1250 steps per ms) remains 11/11 properties
[2024-05-23 02:35:22] [INFO ] Invariant cache hit.
Problem apf1 is UNSAT
Problem apf9 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 108/110 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1182/1292 variables, 20/22 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-23 02:35:23] [INFO ] Deduced a trap composed of 45 places in 267 ms of which 5 ms to minimize.
[2024-05-23 02:35:24] [INFO ] Deduced a trap composed of 52 places in 242 ms of which 4 ms to minimize.
[2024-05-23 02:35:24] [INFO ] Deduced a trap composed of 50 places in 178 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1292 variables, 3/25 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1292 variables, 0/25 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1753/3045 variables, 1292/1317 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3045 variables, 0/1317 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/3045 variables, 0/1317 constraints. Problems are: Problem set: 2 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3045/3045 variables, and 1317 constraints, problems are : Problem set: 2 solved, 9 unsolved in 3279 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 1292/1292 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 2 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 108/110 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1182/1292 variables, 20/22 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1292 variables, 3/25 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1292 variables, 0/25 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 1753/3045 variables, 1292/1317 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3045 variables, 8/1325 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3045 variables, 0/1325 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/3045 variables, 0/1325 constraints. Problems are: Problem set: 3 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3045/3045 variables, and 1325 constraints, problems are : Problem set: 3 solved, 8 unsolved in 1732 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 1292/1292 constraints, PredecessorRefiner: 8/11 constraints, Known Traps: 3/3 constraints]
After SMT, in 5046ms problems are : Problem set: 3 solved, 8 unsolved
Fused 8 Parikh solutions to 3 different solutions.
Finished Parikh walk after 333 steps, including 1 resets, run visited all 3 properties in 4 ms. (steps per millisecond=83 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 8 properties in 181 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1) (NOT p2))), (G (OR (NOT p0) p1 p2)), (G (OR p0 (NOT p1) (NOT p2)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1) p2))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p2))), (F p1), (F (NOT p2)), (F p0), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 17 factoid took 551 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 359 ms :[(AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (AND p1 (NOT p0) (NOT p2))]
Support contains 2 out of 1292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1292/1292 places, 1753/1753 transitions.
Applied a total of 0 rules in 35 ms. Remains 1292 /1292 variables (removed 0) and now considering 1753/1753 (removed 0) transitions.
[2024-05-23 02:35:29] [INFO ] Invariant cache hit.
[2024-05-23 02:35:30] [INFO ] Implicit Places using invariants in 579 ms returned []
[2024-05-23 02:35:30] [INFO ] Invariant cache hit.
[2024-05-23 02:35:31] [INFO ] Implicit Places using invariants and state equation in 1266 ms returned []
Implicit Place search using SMT with State Equation took 1882 ms to find 0 implicit places.
Running 1752 sub problems to find dead transitions.
[2024-05-23 02:35:31] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1291/3045 variables, and 0 constraints, problems are : Problem set: 0 solved, 1752 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1292 constraints, PredecessorRefiner: 1752/1752 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1752 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1291/3045 variables, and 0 constraints, problems are : Problem set: 0 solved, 1752 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1292 constraints, PredecessorRefiner: 0/1752 constraints, Known Traps: 0/0 constraints]
After SMT, in 63319ms problems are : Problem set: 0 solved, 1752 unsolved
Search for dead transitions found 0 dead transitions in 63335ms
Finished structural reductions in LTL mode , in 1 iterations and 65257 ms. Remains : 1292/1292 places, 1753/1753 transitions.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 151 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (292 resets) in 414 ms. (96 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40003 steps (25 resets) in 35 ms. (1111 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (24 resets) in 29 ms. (1333 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (24 resets) in 216 ms. (184 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (24 resets) in 86 ms. (459 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (24 resets) in 96 ms. (412 steps per ms) remains 5/5 properties
[2024-05-23 02:36:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 108/110 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1182/1292 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1292 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1753/3045 variables, 1292/1314 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3045 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/3045 variables, 0/1314 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3045/3045 variables, and 1314 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1212 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 1292/1292 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 108/110 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1182/1292 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1292 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1753/3045 variables, 1292/1314 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3045 variables, 5/1319 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-23 02:36:37] [INFO ] Deduced a trap composed of 173 places in 181 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/3045 variables, 1/1320 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3045 variables, 0/1320 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/3045 variables, 0/1320 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3045/3045 variables, and 1320 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1634 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 1292/1292 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 2857ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 399 steps, including 2 resets, run visited all 5 properties in 7 ms. (steps per millisecond=57 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 8 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (OR p2 p1) (OR p0 (NOT p1))))), (F (NOT (OR (NOT p2) (NOT p0) p1))), (F p0), (F (NOT (OR p0 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p0)))), (F p1)]
Knowledge based reduction with 13 factoid took 500 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter sensitive) to 7 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 422 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 281 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 281 ms :[(AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 731 reset in 324 ms.
Product exploration explored 100000 steps with 734 reset in 273 ms.
Built C files in :
/tmp/ltsmin12257294008402607035
[2024-05-23 02:36:40] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12257294008402607035
Running compilation step : cd /tmp/ltsmin12257294008402607035;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12257294008402607035;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12257294008402607035;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 1292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1292/1292 places, 1753/1753 transitions.
Applied a total of 0 rules in 33 ms. Remains 1292 /1292 variables (removed 0) and now considering 1753/1753 (removed 0) transitions.
[2024-05-23 02:36:43] [INFO ] Invariant cache hit.
[2024-05-23 02:36:44] [INFO ] Implicit Places using invariants in 468 ms returned []
[2024-05-23 02:36:44] [INFO ] Invariant cache hit.
[2024-05-23 02:36:45] [INFO ] Implicit Places using invariants and state equation in 1368 ms returned []
Implicit Place search using SMT with State Equation took 1840 ms to find 0 implicit places.
Running 1752 sub problems to find dead transitions.
[2024-05-23 02:36:45] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1291/3045 variables, and 0 constraints, problems are : Problem set: 0 solved, 1752 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1292 constraints, PredecessorRefiner: 1752/1752 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1752 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1291 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1752 unsolved
SMT process timed out in 62705ms, After SMT, problems are : Problem set: 0 solved, 1752 unsolved
Search for dead transitions found 0 dead transitions in 62724ms
Finished structural reductions in LTL mode , in 1 iterations and 64602 ms. Remains : 1292/1292 places, 1753/1753 transitions.
Built C files in :
/tmp/ltsmin3746579467281486997
[2024-05-23 02:37:48] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3746579467281486997
Running compilation step : cd /tmp/ltsmin3746579467281486997;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3746579467281486997;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3746579467281486997;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-23 02:37:51] [INFO ] Flatten gal took : 54 ms
[2024-05-23 02:37:51] [INFO ] Flatten gal took : 51 ms
[2024-05-23 02:37:51] [INFO ] Time to serialize gal into /tmp/LTL6041119678793596331.gal : 16 ms
[2024-05-23 02:37:51] [INFO ] Time to serialize properties into /tmp/LTL9958107291694988753.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/LTL6041119678793596331.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9222583640719800820.hoa' '-atoms' '/tmp/LTL9958107291694988753.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...317
Loading property file /tmp/LTL9958107291694988753.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9222583640719800820.hoa
Detected timeout of ITS tools.
[2024-05-23 02:38:06] [INFO ] Flatten gal took : 50 ms
[2024-05-23 02:38:06] [INFO ] Flatten gal took : 42 ms
[2024-05-23 02:38:06] [INFO ] Time to serialize gal into /tmp/LTL924942957308809513.gal : 29 ms
[2024-05-23 02:38:06] [INFO ] Time to serialize properties into /tmp/LTL1202238875408994432.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/LTL924942957308809513.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1202238875408994432.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...274
Read 1 LTL properties
Checking formula 0 : !((G(F(G(((!(("(p1803==1)")U("(p882==1)")))||(X(X("(p882==0)"))))||(G(X("(p1803==1)"))))))))
Formula 0 simplified : GF(("(p1803==1)" U "(p882==1)") & X(X!"(p882==0)" & F!"(p1803==1)"))
Detected timeout of ITS tools.
[2024-05-23 02:38:22] [INFO ] Flatten gal took : 41 ms
[2024-05-23 02:38:22] [INFO ] Applying decomposition
[2024-05-23 02:38:22] [INFO ] Flatten gal took : 58 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/graph12484870714972713476.txt' '-o' '/tmp/graph12484870714972713476.bin' '-w' '/tmp/graph12484870714972713476.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12484870714972713476.bin' '-l' '-1' '-v' '-w' '/tmp/graph12484870714972713476.weights' '-q' '0' '-e' '0.001'
[2024-05-23 02:38:22] [INFO ] Decomposing Gal with order
[2024-05-23 02:38:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 02:38:22] [INFO ] Removed a total of 520 redundant transitions.
[2024-05-23 02:38:22] [INFO ] Flatten gal took : 369 ms
[2024-05-23 02:38:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 27 ms.
[2024-05-23 02:38:22] [INFO ] Time to serialize gal into /tmp/LTL9009703904083751574.gal : 17 ms
[2024-05-23 02:38:22] [INFO ] Time to serialize properties into /tmp/LTL15612109245826332684.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/LTL9009703904083751574.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15612109245826332684.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 : !((G(F(G(((!(("(i9.u105.p1803==1)")U("(i4.u58.p882==1)")))||(X(X("(i4.u58.p882==0)"))))||(G(X("(i9.u105.p1803==1)"))))))))
Formula 0 simplified : GF(("(i9.u105.p1803==1)" U "(i4.u58.p882==1)") & X(X!"(i4.u58.p882==0)" & F!"(i9.u105.p1803==1)"))
Detected timeout of ITS tools.
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-01 finished in 262364 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((p0&&G(F(p1)))))'
Support contains 2 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 1819/1819 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1314 transition count 1794
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1314 transition count 1794
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 1314 transition count 1790
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 71 place count 1297 transition count 1773
Iterating global reduction 1 with 17 rules applied. Total rules applied 88 place count 1297 transition count 1773
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 99 place count 1297 transition count 1762
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 104 place count 1292 transition count 1757
Iterating global reduction 2 with 5 rules applied. Total rules applied 109 place count 1292 transition count 1757
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 113 place count 1292 transition count 1753
Applied a total of 113 rules in 139 ms. Remains 1292 /1339 variables (removed 47) and now considering 1753/1819 (removed 66) transitions.
// Phase 1: matrix 1753 rows 1292 cols
[2024-05-23 02:38:38] [INFO ] Computed 22 invariants in 40 ms
[2024-05-23 02:38:38] [INFO ] Implicit Places using invariants in 665 ms returned []
[2024-05-23 02:38:38] [INFO ] Invariant cache hit.
[2024-05-23 02:38:40] [INFO ] Implicit Places using invariants and state equation in 1380 ms returned []
Implicit Place search using SMT with State Equation took 2051 ms to find 0 implicit places.
Running 1752 sub problems to find dead transitions.
[2024-05-23 02:38:40] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1291/3045 variables, and 0 constraints, problems are : Problem set: 0 solved, 1752 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1292 constraints, PredecessorRefiner: 1752/1752 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1752 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1291/3045 variables, and 0 constraints, problems are : Problem set: 0 solved, 1752 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1292 constraints, PredecessorRefiner: 0/1752 constraints, Known Traps: 0/0 constraints]
After SMT, in 62744ms problems are : Problem set: 0 solved, 1752 unsolved
Search for dead transitions found 0 dead transitions in 62762ms
Starting structural reductions in LTL mode, iteration 1 : 1292/1339 places, 1753/1819 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64959 ms. Remains : 1292/1339 places, 1753/1819 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-04 finished in 65209 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(p0) U (X(G(p0))||(p1&&X((p0&&G(p2)))))))'
Support contains 4 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 1819/1819 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 1317 transition count 1797
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 1317 transition count 1797
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 1317 transition count 1793
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 63 place count 1302 transition count 1778
Iterating global reduction 1 with 15 rules applied. Total rules applied 78 place count 1302 transition count 1778
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 87 place count 1302 transition count 1769
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 92 place count 1297 transition count 1764
Iterating global reduction 2 with 5 rules applied. Total rules applied 97 place count 1297 transition count 1764
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 101 place count 1297 transition count 1760
Applied a total of 101 rules in 155 ms. Remains 1297 /1339 variables (removed 42) and now considering 1760/1819 (removed 59) transitions.
// Phase 1: matrix 1760 rows 1297 cols
[2024-05-23 02:39:43] [INFO ] Computed 22 invariants in 32 ms
[2024-05-23 02:39:43] [INFO ] Implicit Places using invariants in 541 ms returned []
[2024-05-23 02:39:43] [INFO ] Invariant cache hit.
[2024-05-23 02:39:45] [INFO ] Implicit Places using invariants and state equation in 1467 ms returned []
Implicit Place search using SMT with State Equation took 2009 ms to find 0 implicit places.
Running 1759 sub problems to find dead transitions.
[2024-05-23 02:39:45] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1296/3057 variables, and 0 constraints, problems are : Problem set: 0 solved, 1759 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1297 constraints, PredecessorRefiner: 1759/1759 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1759 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1296/3057 variables, and 0 constraints, problems are : Problem set: 0 solved, 1759 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1297 constraints, PredecessorRefiner: 0/1759 constraints, Known Traps: 0/0 constraints]
After SMT, in 63154ms problems are : Problem set: 0 solved, 1759 unsolved
Search for dead transitions found 0 dead transitions in 63176ms
Starting structural reductions in LTL mode, iteration 1 : 1297/1339 places, 1760/1819 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65345 ms. Remains : 1297/1339 places, 1760/1819 transitions.
Stuttering acceptance computed with spot in 270 ms :[true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-05
Product exploration explored 100000 steps with 733 reset in 348 ms.
Product exploration explored 100000 steps with 733 reset in 335 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND p0 p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 117 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter sensitive) to 6 states, 16 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[true, (NOT p0), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (293 resets) in 536 ms. (74 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (24 resets) in 192 ms. (207 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (23 resets) in 303 ms. (131 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (24 resets) in 157 ms. (253 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (23 resets) in 61 ms. (645 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (23 resets) in 141 ms. (281 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (23 resets) in 81 ms. (487 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (24 resets) in 73 ms. (540 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (24 resets) in 86 ms. (459 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (24 resets) in 59 ms. (666 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (24 resets) in 110 ms. (360 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 124470 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :0 out of 10
Probabilistic random walk after 124470 steps, saw 66810 distinct states, run finished after 3006 ms. (steps per millisecond=41 ) properties seen :0
[2024-05-23 02:40:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 425/429 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/429 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 868/1297 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-23 02:40:54] [INFO ] Deduced a trap composed of 58 places in 439 ms of which 9 ms to minimize.
[2024-05-23 02:40:54] [INFO ] Deduced a trap composed of 49 places in 416 ms of which 6 ms to minimize.
[2024-05-23 02:40:55] [INFO ] Deduced a trap composed of 52 places in 393 ms of which 7 ms to minimize.
[2024-05-23 02:40:55] [INFO ] Deduced a trap composed of 49 places in 444 ms of which 6 ms to minimize.
[2024-05-23 02:40:56] [INFO ] Deduced a trap composed of 55 places in 429 ms of which 7 ms to minimize.
[2024-05-23 02:40:56] [INFO ] Deduced a trap composed of 50 places in 366 ms of which 6 ms to minimize.
[2024-05-23 02:40:57] [INFO ] Deduced a trap composed of 520 places in 411 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1297 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1297 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 1760/3057 variables, 1297/1326 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3057 variables, 0/1326 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3057/3057 variables, and 1326 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 1297/1297 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 425/429 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/429 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 868/1297 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1297 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1297 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 1760/3057 variables, 1297/1326 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3057 variables, 10/1336 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3057 variables, 0/1336 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/3057 variables, 0/1336 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3057/3057 variables, and 1336 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2105 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 1297/1297 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 7/7 constraints]
After SMT, in 7128ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 5 different solutions.
Finished Parikh walk after 2516 steps, including 15 resets, run visited all 10 properties in 68 ms. (steps per millisecond=37 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 10 properties in 71 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p2)), (X (AND (NOT p1) p0)), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0 (NOT p2))), (X (NOT (AND p0 p2))), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 p2))), (F (NOT (AND p0 (NOT p1)))), (F p2), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F (NOT p0)), (F p1)]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p2)))
Knowledge based reduction with 19 factoid took 237 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-20b-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-05 finished in 77858 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(F(p0)))))'
Support contains 1 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 1819/1819 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1314 transition count 1794
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1314 transition count 1794
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 1314 transition count 1790
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 71 place count 1297 transition count 1773
Iterating global reduction 1 with 17 rules applied. Total rules applied 88 place count 1297 transition count 1773
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 99 place count 1297 transition count 1762
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 104 place count 1292 transition count 1757
Iterating global reduction 2 with 5 rules applied. Total rules applied 109 place count 1292 transition count 1757
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 114 place count 1292 transition count 1752
Applied a total of 114 rules in 141 ms. Remains 1292 /1339 variables (removed 47) and now considering 1752/1819 (removed 67) transitions.
// Phase 1: matrix 1752 rows 1292 cols
[2024-05-23 02:41:01] [INFO ] Computed 22 invariants in 43 ms
[2024-05-23 02:41:01] [INFO ] Implicit Places using invariants in 552 ms returned []
[2024-05-23 02:41:01] [INFO ] Invariant cache hit.
[2024-05-23 02:41:03] [INFO ] Implicit Places using invariants and state equation in 1369 ms returned []
Implicit Place search using SMT with State Equation took 1923 ms to find 0 implicit places.
Running 1751 sub problems to find dead transitions.
[2024-05-23 02:41:03] [INFO ] Invariant cache hit.
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 1291/3044 variables, and 0 constraints, problems are : Problem set: 0 solved, 1751 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1292 constraints, PredecessorRefiner: 1751/1751 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1751 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1291/3044 variables, and 0 constraints, problems are : Problem set: 0 solved, 1751 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1292 constraints, PredecessorRefiner: 0/1751 constraints, Known Traps: 0/0 constraints]
After SMT, in 63019ms problems are : Problem set: 0 solved, 1751 unsolved
Search for dead transitions found 0 dead transitions in 63038ms
Starting structural reductions in LTL mode, iteration 1 : 1292/1339 places, 1752/1819 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65110 ms. Remains : 1292/1339 places, 1752/1819 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-06
Stuttering criterion allowed to conclude after 136 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-06 finished in 65311 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(F(p0)))))'
Support contains 3 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 1819/1819 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1314 transition count 1794
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1314 transition count 1794
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 1314 transition count 1791
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 71 place count 1296 transition count 1773
Iterating global reduction 1 with 18 rules applied. Total rules applied 89 place count 1296 transition count 1773
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 100 place count 1296 transition count 1762
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 106 place count 1290 transition count 1756
Iterating global reduction 2 with 6 rules applied. Total rules applied 112 place count 1290 transition count 1756
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 117 place count 1290 transition count 1751
Applied a total of 117 rules in 138 ms. Remains 1290 /1339 variables (removed 49) and now considering 1751/1819 (removed 68) transitions.
// Phase 1: matrix 1751 rows 1290 cols
[2024-05-23 02:42:06] [INFO ] Computed 22 invariants in 33 ms
[2024-05-23 02:42:06] [INFO ] Implicit Places using invariants in 547 ms returned []
[2024-05-23 02:42:06] [INFO ] Invariant cache hit.
[2024-05-23 02:42:08] [INFO ] Implicit Places using invariants and state equation in 1304 ms returned []
Implicit Place search using SMT with State Equation took 1861 ms to find 0 implicit places.
Running 1750 sub problems to find dead transitions.
[2024-05-23 02:42:08] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1289/3041 variables, and 0 constraints, problems are : Problem set: 0 solved, 1750 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1290 constraints, PredecessorRefiner: 1750/1750 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1750 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1289 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
SMT process timed out in 62692ms, After SMT, problems are : Problem set: 0 solved, 1750 unsolved
Search for dead transitions found 0 dead transitions in 62710ms
Starting structural reductions in LTL mode, iteration 1 : 1290/1339 places, 1751/1819 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64719 ms. Remains : 1290/1339 places, 1751/1819 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-07
Stuttering criterion allowed to conclude after 127 steps with 0 reset in 2 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-07 finished in 64986 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((p0&&F(((X(G(p0)) U G(p0))||G(F(p1)))))))'
Support contains 2 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 1819/1819 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 1313 transition count 1793
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 1313 transition count 1793
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 56 place count 1313 transition count 1789
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 74 place count 1295 transition count 1771
Iterating global reduction 1 with 18 rules applied. Total rules applied 92 place count 1295 transition count 1771
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 103 place count 1295 transition count 1760
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 109 place count 1289 transition count 1754
Iterating global reduction 2 with 6 rules applied. Total rules applied 115 place count 1289 transition count 1754
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 120 place count 1289 transition count 1749
Applied a total of 120 rules in 156 ms. Remains 1289 /1339 variables (removed 50) and now considering 1749/1819 (removed 70) transitions.
// Phase 1: matrix 1749 rows 1289 cols
[2024-05-23 02:43:11] [INFO ] Computed 22 invariants in 35 ms
[2024-05-23 02:43:11] [INFO ] Implicit Places using invariants in 534 ms returned []
[2024-05-23 02:43:11] [INFO ] Invariant cache hit.
[2024-05-23 02:43:13] [INFO ] Implicit Places using invariants and state equation in 1366 ms returned []
Implicit Place search using SMT with State Equation took 1902 ms to find 0 implicit places.
Running 1748 sub problems to find dead transitions.
[2024-05-23 02:43:13] [INFO ] Invariant cache hit.
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 1288/3038 variables, and 0 constraints, problems are : Problem set: 0 solved, 1748 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1289 constraints, PredecessorRefiner: 1748/1748 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1748 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1288/3038 variables, and 0 constraints, problems are : Problem set: 0 solved, 1748 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1289 constraints, PredecessorRefiner: 0/1748 constraints, Known Traps: 0/0 constraints]
After SMT, in 62696ms problems are : Problem set: 0 solved, 1748 unsolved
Search for dead transitions found 0 dead transitions in 62713ms
Starting structural reductions in LTL mode, iteration 1 : 1289/1339 places, 1749/1819 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64775 ms. Remains : 1289/1339 places, 1749/1819 transitions.
Stuttering acceptance computed with spot in 241 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-09 finished in 65048 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) U p1)||G(F(!p0))))'
Support contains 2 out of 1339 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1339/1339 places, 1819/1819 transitions.
Graph (trivial) has 1252 edges and 1339 vertex of which 115 / 1339 are part of one of the 19 SCC in 2 ms
Free SCC test removed 96 places
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 103 place count 1242 transition count 1619
Reduce places removed 102 places and 0 transitions.
Iterating post reduction 1 with 102 rules applied. Total rules applied 205 place count 1140 transition count 1619
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 205 place count 1140 transition count 1573
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 297 place count 1094 transition count 1573
Discarding 59 places :
Symmetric choice reduction at 2 with 59 rule applications. Total rules 356 place count 1035 transition count 1514
Iterating global reduction 2 with 59 rules applied. Total rules applied 415 place count 1035 transition count 1514
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 419 place count 1035 transition count 1510
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 419 place count 1035 transition count 1508
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 423 place count 1033 transition count 1508
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 436 place count 1020 transition count 1495
Iterating global reduction 3 with 13 rules applied. Total rules applied 449 place count 1020 transition count 1495
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 461 place count 1020 transition count 1483
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 1 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 4 with 250 rules applied. Total rules applied 711 place count 895 transition count 1358
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 714 place count 892 transition count 1355
Iterating global reduction 4 with 3 rules applied. Total rules applied 717 place count 892 transition count 1355
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 720 place count 892 transition count 1352
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 722 place count 891 transition count 1352
Drop transitions (Redundant composition of simpler transitions.) removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 5 with 21 rules applied. Total rules applied 743 place count 891 transition count 1331
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 745 place count 889 transition count 1329
Applied a total of 745 rules in 573 ms. Remains 889 /1339 variables (removed 450) and now considering 1329/1819 (removed 490) transitions.
[2024-05-23 02:44:16] [INFO ] Flow matrix only has 1291 transitions (discarded 38 similar events)
// Phase 1: matrix 1291 rows 889 cols
[2024-05-23 02:44:16] [INFO ] Computed 22 invariants in 31 ms
[2024-05-23 02:44:17] [INFO ] Implicit Places using invariants in 471 ms returned []
[2024-05-23 02:44:17] [INFO ] Flow matrix only has 1291 transitions (discarded 38 similar events)
[2024-05-23 02:44:17] [INFO ] Invariant cache hit.
[2024-05-23 02:44:18] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 1423 ms to find 0 implicit places.
[2024-05-23 02:44:18] [INFO ] Redundant transitions in 75 ms returned []
Running 566 sub problems to find dead transitions.
[2024-05-23 02:44:18] [INFO ] Flow matrix only has 1291 transitions (discarded 38 similar events)
[2024-05-23 02:44:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/869 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/869 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 20/889 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/889 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (OVERLAPS) 1290/2179 variables, 889/911 constraints. Problems are: Problem set: 0 solved, 566 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2179/2180 variables, and 911 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 889/889 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/869 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/869 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 20/889 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/889 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (OVERLAPS) 1290/2179 variables, 889/911 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2179 variables, 566/1477 constraints. Problems are: Problem set: 0 solved, 566 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2179/2180 variables, and 1477 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 889/889 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 0/0 constraints]
After SMT, in 60815ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 60822ms
Starting structural reductions in SI_LTL mode, iteration 1 : 889/1339 places, 1329/1819 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62906 ms. Remains : 889/1339 places, 1329/1819 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-10 finished in 63012 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&&G(p2))))))'
Support contains 2 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 1819/1819 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1315 transition count 1795
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1315 transition count 1795
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 1315 transition count 1791
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 68 place count 1299 transition count 1775
Iterating global reduction 1 with 16 rules applied. Total rules applied 84 place count 1299 transition count 1775
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 93 place count 1299 transition count 1766
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 99 place count 1293 transition count 1760
Iterating global reduction 2 with 6 rules applied. Total rules applied 105 place count 1293 transition count 1760
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 110 place count 1293 transition count 1755
Applied a total of 110 rules in 145 ms. Remains 1293 /1339 variables (removed 46) and now considering 1755/1819 (removed 64) transitions.
// Phase 1: matrix 1755 rows 1293 cols
[2024-05-23 02:45:19] [INFO ] Computed 22 invariants in 25 ms
[2024-05-23 02:45:19] [INFO ] Implicit Places using invariants in 524 ms returned []
[2024-05-23 02:45:20] [INFO ] Invariant cache hit.
[2024-05-23 02:45:21] [INFO ] Implicit Places using invariants and state equation in 1404 ms returned []
Implicit Place search using SMT with State Equation took 1929 ms to find 0 implicit places.
Running 1754 sub problems to find dead transitions.
[2024-05-23 02:45:21] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1292/3048 variables, and 0 constraints, problems are : Problem set: 0 solved, 1754 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1293 constraints, PredecessorRefiner: 1754/1754 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1754 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1292/3048 variables, and 0 constraints, problems are : Problem set: 0 solved, 1754 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1293 constraints, PredecessorRefiner: 0/1754 constraints, Known Traps: 0/0 constraints]
After SMT, in 62674ms problems are : Problem set: 0 solved, 1754 unsolved
Search for dead transitions found 0 dead transitions in 62690ms
Starting structural reductions in LTL mode, iteration 1 : 1293/1339 places, 1755/1819 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64767 ms. Remains : 1293/1339 places, 1755/1819 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-11
Product exploration explored 100000 steps with 735 reset in 307 ms.
Product exploration explored 100000 steps with 734 reset in 398 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 110 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), false, false]
RANDOM walk for 40000 steps (293 resets) in 483 ms. (82 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (24 resets) in 80 ms. (493 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (24 resets) in 137 ms. (289 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (24 resets) in 165 ms. (240 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (23 resets) in 101 ms. (392 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (24 resets) in 135 ms. (294 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (23 resets) in 93 ms. (425 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (23 resets) in 129 ms. (307 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (24 resets) in 139 ms. (285 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (25 resets) in 117 ms. (339 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (22 resets) in 141 ms. (281 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (23 resets) in 121 ms. (327 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 107333 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 11
Probabilistic random walk after 107333 steps, saw 51229 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
[2024-05-23 02:46:28] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
Problem apf3 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 105/107 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1186/1293 variables, 20/22 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-23 02:46:29] [INFO ] Deduced a trap composed of 58 places in 138 ms of which 3 ms to minimize.
[2024-05-23 02:46:29] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1293 variables, 2/24 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1293 variables, 0/24 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1755/3048 variables, 1293/1317 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-05-23 02:46:30] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/3048 variables, 1/1318 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3048 variables, 0/1318 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/3048 variables, 0/1318 constraints. Problems are: Problem set: 2 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3048/3048 variables, and 1318 constraints, problems are : Problem set: 2 solved, 9 unsolved in 2960 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 1293/1293 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 2 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 105/107 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1186/1293 variables, 20/22 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1293 variables, 3/25 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1293 variables, 0/25 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1755/3048 variables, 1293/1318 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3048 variables, 9/1327 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3048 variables, 0/1327 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/3048 variables, 0/1327 constraints. Problems are: Problem set: 2 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3048/3048 variables, and 1327 constraints, problems are : Problem set: 2 solved, 9 unsolved in 1827 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 1293/1293 constraints, PredecessorRefiner: 9/11 constraints, Known Traps: 3/3 constraints]
After SMT, in 4800ms problems are : Problem set: 2 solved, 9 unsolved
Fused 9 Parikh solutions to 5 different solutions.
Finished Parikh walk after 647 steps, including 3 resets, run visited all 9 properties in 8 ms. (steps per millisecond=80 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 9 properties in 10 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X p1)), (G (OR p0 (NOT p2) (NOT p1))), (G (OR (NOT p0) (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (F (NOT (AND (OR p0 p2) (OR p0 p1)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F p2), (F (NOT (OR p0 (NOT p2)))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 p2))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 21 factoid took 418 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 1 out of 1293 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1293/1293 places, 1755/1755 transitions.
Graph (trivial) has 1229 edges and 1293 vertex of which 121 / 1293 are part of one of the 20 SCC in 2 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 1191 transition count 1556
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 193 place count 1095 transition count 1556
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 193 place count 1095 transition count 1514
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 277 place count 1053 transition count 1514
Discarding 39 places :
Symmetric choice reduction at 2 with 39 rule applications. Total rules 316 place count 1014 transition count 1475
Iterating global reduction 2 with 39 rules applied. Total rules applied 355 place count 1014 transition count 1475
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 357 place count 1012 transition count 1473
Iterating global reduction 2 with 2 rules applied. Total rules applied 359 place count 1012 transition count 1473
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 1 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 603 place count 890 transition count 1351
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 2 with 20 rules applied. Total rules applied 623 place count 890 transition count 1331
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 625 place count 888 transition count 1329
Applied a total of 625 rules in 395 ms. Remains 888 /1293 variables (removed 405) and now considering 1329/1755 (removed 426) transitions.
[2024-05-23 02:46:34] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
// Phase 1: matrix 1290 rows 888 cols
[2024-05-23 02:46:34] [INFO ] Computed 22 invariants in 33 ms
[2024-05-23 02:46:35] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-05-23 02:46:35] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2024-05-23 02:46:35] [INFO ] Invariant cache hit.
[2024-05-23 02:46:36] [INFO ] Implicit Places using invariants and state equation in 898 ms returned []
Implicit Place search using SMT with State Equation took 1324 ms to find 0 implicit places.
[2024-05-23 02:46:36] [INFO ] Redundant transitions in 56 ms returned []
Running 545 sub problems to find dead transitions.
[2024-05-23 02:46:36] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2024-05-23 02:46:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 2 (OVERLAPS) 20/888 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/888 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 4 (OVERLAPS) 1289/2177 variables, 888/910 constraints. Problems are: Problem set: 0 solved, 545 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2177/2178 variables, and 910 constraints, problems are : Problem set: 0 solved, 545 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 888/888 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 545 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 2 (OVERLAPS) 20/888 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/888 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 4 (OVERLAPS) 1289/2177 variables, 888/910 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2177 variables, 545/1455 constraints. Problems are: Problem set: 0 solved, 545 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2177/2178 variables, and 1455 constraints, problems are : Problem set: 0 solved, 545 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 888/888 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 0/0 constraints]
After SMT, in 60773ms problems are : Problem set: 0 solved, 545 unsolved
Search for dead transitions found 0 dead transitions in 60780ms
Starting structural reductions in SI_LTL mode, iteration 1 : 888/1293 places, 1329/1755 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62565 ms. Remains : 888/1293 places, 1329/1755 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
RANDOM walk for 40000 steps (1543 resets) in 1746 ms. (22 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 487510 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :0 out of 1
Probabilistic random walk after 487510 steps, saw 122044 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
[2024-05-23 02:47:40] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2024-05-23 02:47:40] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/94 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1243/1337 variables, 97/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1337 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1337 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 764/2101 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2101 variables, 688/834 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2101 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 76/2177 variables, 76/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2177 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2177 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2177/2178 variables, and 910 constraints, problems are : Problem set: 0 solved, 1 unsolved in 432 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 888/888 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/94 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1243/1337 variables, 97/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1337 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1337 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1337 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 764/2101 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2101 variables, 688/835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2101 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 76/2177 variables, 76/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2177 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2177 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2177/2178 variables, and 911 constraints, problems are : Problem set: 0 solved, 1 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 888/888 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 865ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3771 reset in 1207 ms.
Product exploration explored 100000 steps with 3775 reset in 1175 ms.
Built C files in :
/tmp/ltsmin5016494927448012617
[2024-05-23 02:47:44] [INFO ] Computing symmetric may disable matrix : 1329 transitions.
[2024-05-23 02:47:44] [INFO ] Computation of Complete disable matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 02:47:44] [INFO ] Computing symmetric may enable matrix : 1329 transitions.
[2024-05-23 02:47:44] [INFO ] Computation of Complete enable matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 02:47:44] [INFO ] Computing Do-Not-Accords matrix : 1329 transitions.
[2024-05-23 02:47:44] [INFO ] Computation of Completed DNA matrix. took 52 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 02:47:44] [INFO ] Built C files in 486ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5016494927448012617
Running compilation step : cd /tmp/ltsmin5016494927448012617;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5016494927448012617;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5016494927448012617;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 1 out of 888 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 888/888 places, 1329/1329 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 887 transition count 1328
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 886 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 886 transition count 1327
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 886 transition count 1326
Applied a total of 5 rules in 124 ms. Remains 886 /888 variables (removed 2) and now considering 1326/1329 (removed 3) transitions.
[2024-05-23 02:47:47] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
// Phase 1: matrix 1287 rows 886 cols
[2024-05-23 02:47:47] [INFO ] Computed 22 invariants in 32 ms
[2024-05-23 02:47:48] [INFO ] Implicit Places using invariants in 438 ms returned []
[2024-05-23 02:47:48] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
[2024-05-23 02:47:48] [INFO ] Invariant cache hit.
[2024-05-23 02:47:49] [INFO ] Implicit Places using invariants and state equation in 1001 ms returned []
Implicit Place search using SMT with State Equation took 1441 ms to find 0 implicit places.
[2024-05-23 02:47:49] [INFO ] Redundant transitions in 20 ms returned []
Running 543 sub problems to find dead transitions.
[2024-05-23 02:47:49] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
[2024-05-23 02:47:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/866 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/866 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 2 (OVERLAPS) 20/886 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/886 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 4 (OVERLAPS) 1286/2172 variables, 886/908 constraints. Problems are: Problem set: 0 solved, 543 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 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.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 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 1.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2172/2173 variables, and 908 constraints, problems are : Problem set: 0 solved, 543 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 886/886 constraints, PredecessorRefiner: 543/543 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 543 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/866 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/866 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 2 (OVERLAPS) 20/886 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/886 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 4 (OVERLAPS) 1286/2172 variables, 886/908 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2172 variables, 543/1451 constraints. Problems are: Problem set: 0 solved, 543 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2172/2173 variables, and 1451 constraints, problems are : Problem set: 0 solved, 543 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 886/886 constraints, PredecessorRefiner: 543/543 constraints, Known Traps: 0/0 constraints]
After SMT, in 60738ms problems are : Problem set: 0 solved, 543 unsolved
Search for dead transitions found 0 dead transitions in 60743ms
Starting structural reductions in SI_LTL mode, iteration 1 : 886/888 places, 1326/1329 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62339 ms. Remains : 886/888 places, 1326/1329 transitions.
Built C files in :
/tmp/ltsmin8884902998034587024
[2024-05-23 02:48:50] [INFO ] Computing symmetric may disable matrix : 1326 transitions.
[2024-05-23 02:48:50] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 02:48:50] [INFO ] Computing symmetric may enable matrix : 1326 transitions.
[2024-05-23 02:48:50] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 02:48:50] [INFO ] Computing Do-Not-Accords matrix : 1326 transitions.
[2024-05-23 02:48:50] [INFO ] Computation of Completed DNA matrix. took 38 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 02:48:50] [INFO ] Built C files in 392ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8884902998034587024
Running compilation step : cd /tmp/ltsmin8884902998034587024;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8884902998034587024;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8884902998034587024;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-23 02:48:53] [INFO ] Flatten gal took : 41 ms
[2024-05-23 02:48:53] [INFO ] Flatten gal took : 37 ms
[2024-05-23 02:48:53] [INFO ] Time to serialize gal into /tmp/LTL3074383624962672994.gal : 6 ms
[2024-05-23 02:48:53] [INFO ] Time to serialize properties into /tmp/LTL9534091604096050262.prop : 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/LTL3074383624962672994.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2190847700656911015.hoa' '-atoms' '/tmp/LTL9534091604096050262.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...317
Loading property file /tmp/LTL9534091604096050262.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2190847700656911015.hoa
Detected timeout of ITS tools.
[2024-05-23 02:49:08] [INFO ] Flatten gal took : 30 ms
[2024-05-23 02:49:08] [INFO ] Flatten gal took : 27 ms
[2024-05-23 02:49:08] [INFO ] Time to serialize gal into /tmp/LTL9278788168976059789.gal : 5 ms
[2024-05-23 02:49:08] [INFO ] Time to serialize properties into /tmp/LTL5708176964369134890.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/LTL9278788168976059789.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5708176964369134890.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...275
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(p2071==0)"))||(("(p1113==0)")&&(G("(p1113==1)")))))))
Formula 0 simplified : XG(F!"(p2071==0)" & (!"(p1113==0)" | F!"(p1113==1)"))
Detected timeout of ITS tools.
[2024-05-23 02:49:23] [INFO ] Flatten gal took : 28 ms
[2024-05-23 02:49:23] [INFO ] Applying decomposition
[2024-05-23 02:49:23] [INFO ] Flatten gal took : 28 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/graph18433660808195340677.txt' '-o' '/tmp/graph18433660808195340677.bin' '-w' '/tmp/graph18433660808195340677.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18433660808195340677.bin' '-l' '-1' '-v' '-w' '/tmp/graph18433660808195340677.weights' '-q' '0' '-e' '0.001'
[2024-05-23 02:49:24] [INFO ] Decomposing Gal with order
[2024-05-23 02:49:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 02:49:24] [INFO ] Removed a total of 521 redundant transitions.
[2024-05-23 02:49:24] [INFO ] Flatten gal took : 164 ms
[2024-05-23 02:49:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 69 labels/synchronizations in 18 ms.
[2024-05-23 02:49:24] [INFO ] Time to serialize gal into /tmp/LTL7342381070328457829.gal : 13 ms
[2024-05-23 02:49:24] [INFO ] Time to serialize properties into /tmp/LTL1180128211557659702.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/LTL7342381070328457829.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1180128211557659702.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...254
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(i11.u35.p2071==0)"))||(("(u20.p1113==0)")&&(G("(u20.p1113==1)")))))))
Formula 0 simplified : XG(F!"(i11.u35.p2071==0)" & (!"(u20.p1113==0)" | F!"(u20.p1113==1)"))
Detected timeout of ITS tools.
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-11 finished in 260078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&X(G(!p1))) U (p2||X(F(!p0)))))'
Support contains 5 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 1819/1819 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 1315 transition count 1795
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 1315 transition count 1795
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 1315 transition count 1792
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 68 place count 1298 transition count 1775
Iterating global reduction 1 with 17 rules applied. Total rules applied 85 place count 1298 transition count 1775
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 95 place count 1298 transition count 1765
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 101 place count 1292 transition count 1759
Iterating global reduction 2 with 6 rules applied. Total rules applied 107 place count 1292 transition count 1759
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 112 place count 1292 transition count 1754
Applied a total of 112 rules in 142 ms. Remains 1292 /1339 variables (removed 47) and now considering 1754/1819 (removed 65) transitions.
// Phase 1: matrix 1754 rows 1292 cols
[2024-05-23 02:49:39] [INFO ] Computed 22 invariants in 24 ms
[2024-05-23 02:49:40] [INFO ] Implicit Places using invariants in 511 ms returned []
[2024-05-23 02:49:40] [INFO ] Invariant cache hit.
[2024-05-23 02:49:41] [INFO ] Implicit Places using invariants and state equation in 1426 ms returned []
Implicit Place search using SMT with State Equation took 1941 ms to find 0 implicit places.
Running 1753 sub problems to find dead transitions.
[2024-05-23 02:49:41] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1291/3046 variables, and 0 constraints, problems are : Problem set: 0 solved, 1753 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1292 constraints, PredecessorRefiner: 1753/1753 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1753 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 1291/3046 variables, and 0 constraints, problems are : Problem set: 0 solved, 1753 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1292 constraints, PredecessorRefiner: 0/1753 constraints, Known Traps: 0/0 constraints]
After SMT, in 62972ms problems are : Problem set: 0 solved, 1753 unsolved
Search for dead transitions found 0 dead transitions in 62987ms
Starting structural reductions in LTL mode, iteration 1 : 1292/1339 places, 1754/1819 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65076 ms. Remains : 1292/1339 places, 1754/1819 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND p0 p1), (AND p0 (NOT p2)), (OR (AND p0 (NOT p2)) (AND p0 p1)), p0]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-12
Stuttering criterion allowed to conclude after 240 steps with 1 reset in 2 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-12 finished in 65266 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(!p0))||(F(!p0)&&F(G(!p1)))))))'
Support contains 5 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 1819/1819 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1314 transition count 1794
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1314 transition count 1794
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 1314 transition count 1791
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 71 place count 1296 transition count 1773
Iterating global reduction 1 with 18 rules applied. Total rules applied 89 place count 1296 transition count 1773
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 100 place count 1296 transition count 1762
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 106 place count 1290 transition count 1756
Iterating global reduction 2 with 6 rules applied. Total rules applied 112 place count 1290 transition count 1756
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 117 place count 1290 transition count 1751
Applied a total of 117 rules in 147 ms. Remains 1290 /1339 variables (removed 49) and now considering 1751/1819 (removed 68) transitions.
// Phase 1: matrix 1751 rows 1290 cols
[2024-05-23 02:50:44] [INFO ] Computed 22 invariants in 32 ms
[2024-05-23 02:50:45] [INFO ] Implicit Places using invariants in 519 ms returned []
[2024-05-23 02:50:45] [INFO ] Invariant cache hit.
[2024-05-23 02:50:46] [INFO ] Implicit Places using invariants and state equation in 1283 ms returned []
Implicit Place search using SMT with State Equation took 1804 ms to find 0 implicit places.
Running 1750 sub problems to find dead transitions.
[2024-05-23 02:50:46] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1289/3041 variables, and 0 constraints, problems are : Problem set: 0 solved, 1750 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1290 constraints, PredecessorRefiner: 1750/1750 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1750 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1289 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
At refinement iteration 1 (OVERLAPS) 1/1290 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1290/3041 variables, and 22 constraints, problems are : Problem set: 0 solved, 1750 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/1290 constraints, PredecessorRefiner: 0/1750 constraints, Known Traps: 0/0 constraints]
After SMT, in 62907ms problems are : Problem set: 0 solved, 1750 unsolved
Search for dead transitions found 0 dead transitions in 62924ms
Starting structural reductions in LTL mode, iteration 1 : 1290/1339 places, 1751/1819 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64881 ms. Remains : 1290/1339 places, 1751/1819 transitions.
Stuttering acceptance computed with spot in 209 ms :[p0, p0, p0, p0, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-13
Product exploration explored 100000 steps with 733 reset in 277 ms.
Product exploration explored 100000 steps with 734 reset in 306 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND p0 p1), (AND p0 p1)]
RANDOM walk for 40000 steps (293 resets) in 359 ms. (111 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (9 resets) in 25 ms. (1538 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 17 ms. (2222 steps per ms) remains 2/2 properties
[2024-05-23 02:51:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 509/514 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 776/1290 variables, 18/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-23 02:51:51] [INFO ] Deduced a trap composed of 55 places in 171 ms of which 4 ms to minimize.
[2024-05-23 02:51:51] [INFO ] Deduced a trap composed of 48 places in 146 ms of which 3 ms to minimize.
[2024-05-23 02:51:51] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 3 ms to minimize.
[2024-05-23 02:51:51] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1290 variables, 4/26 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1290 variables, 0/26 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1751/3041 variables, 1290/1316 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3041 variables, 0/1316 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/3041 variables, 0/1316 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3041/3041 variables, and 1316 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1320 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 1290/1290 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 421/423 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 867/1290 variables, 20/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1290 variables, 4/26 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1290 variables, 0/26 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1751/3041 variables, 1290/1316 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3041 variables, 1/1317 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3041 variables, 0/1317 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/3041 variables, 0/1317 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3041/3041 variables, and 1317 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1394 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 1290/1290 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 2733ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 54 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=54 )
Parikh walk visited 1 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0))), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p0) p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FlexibleBarrier-PT-20b-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-13 finished in 68763 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p0)||F(p1))))))'
Support contains 2 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1339/1339 places, 1819/1819 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 1314 transition count 1794
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 1314 transition count 1794
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 1314 transition count 1790
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 72 place count 1296 transition count 1772
Iterating global reduction 1 with 18 rules applied. Total rules applied 90 place count 1296 transition count 1772
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 101 place count 1296 transition count 1761
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 107 place count 1290 transition count 1755
Iterating global reduction 2 with 6 rules applied. Total rules applied 113 place count 1290 transition count 1755
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 118 place count 1290 transition count 1750
Applied a total of 118 rules in 137 ms. Remains 1290 /1339 variables (removed 49) and now considering 1750/1819 (removed 69) transitions.
// Phase 1: matrix 1750 rows 1290 cols
[2024-05-23 02:51:53] [INFO ] Computed 22 invariants in 28 ms
[2024-05-23 02:51:54] [INFO ] Implicit Places using invariants in 479 ms returned []
[2024-05-23 02:51:54] [INFO ] Invariant cache hit.
[2024-05-23 02:51:55] [INFO ] Implicit Places using invariants and state equation in 1335 ms returned []
Implicit Place search using SMT with State Equation took 1827 ms to find 0 implicit places.
Running 1749 sub problems to find dead transitions.
[2024-05-23 02:51:55] [INFO ] Invariant cache hit.
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 1289/3040 variables, and 0 constraints, problems are : Problem set: 0 solved, 1749 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1290 constraints, PredecessorRefiner: 1749/1749 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1289 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1749 unsolved
At refinement iteration 1 (OVERLAPS) 1/1290 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 1749 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1290/3040 variables, and 22 constraints, problems are : Problem set: 0 solved, 1749 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 0/1290 constraints, PredecessorRefiner: 0/1749 constraints, Known Traps: 0/0 constraints]
After SMT, in 62754ms problems are : Problem set: 0 solved, 1749 unsolved
Search for dead transitions found 0 dead transitions in 62769ms
Starting structural reductions in LTL mode, iteration 1 : 1290/1339 places, 1750/1819 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64736 ms. Remains : 1290/1339 places, 1750/1819 transitions.
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-14
Product exploration explored 100000 steps with 733 reset in 267 ms.
Product exploration explored 100000 steps with 733 reset in 297 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (292 resets) in 564 ms. (70 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (24 resets) in 81 ms. (487 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (24 resets) in 82 ms. (481 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (25 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 244345 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 3
Probabilistic random walk after 244345 steps, saw 99892 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
[2024-05-23 02:53:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 109/111 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1179/1290 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1290 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1750/3040 variables, 1290/1312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3040 variables, 0/1312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/3040 variables, 0/1312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3040/3040 variables, and 1312 constraints, problems are : Problem set: 0 solved, 3 unsolved in 667 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 1290/1290 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) 109/111 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1179/1290 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1290 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1750/3040 variables, 1290/1312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3040 variables, 3/1315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3040 variables, 0/1315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/3040 variables, 0/1315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3040/3040 variables, and 1315 constraints, problems are : Problem set: 0 solved, 3 unsolved in 832 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 1290/1290 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1508ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 143 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=71 )
Parikh walk visited 3 properties in 73 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p0), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 181 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 1290 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1290/1290 places, 1750/1750 transitions.
Applied a total of 0 rules in 34 ms. Remains 1290 /1290 variables (removed 0) and now considering 1750/1750 (removed 0) transitions.
[2024-05-23 02:53:04] [INFO ] Invariant cache hit.
[2024-05-23 02:53:05] [INFO ] Implicit Places using invariants in 489 ms returned []
[2024-05-23 02:53:05] [INFO ] Invariant cache hit.
[2024-05-23 02:53:06] [INFO ] Implicit Places using invariants and state equation in 1441 ms returned []
Implicit Place search using SMT with State Equation took 1931 ms to find 0 implicit places.
Running 1749 sub problems to find dead transitions.
[2024-05-23 02:53:06] [INFO ] Invariant cache hit.
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 1289/3040 variables, and 0 constraints, problems are : Problem set: 0 solved, 1749 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1290 constraints, PredecessorRefiner: 1749/1749 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1749 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1289 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1749 unsolved
SMT process timed out in 62837ms, After SMT, problems are : Problem set: 0 solved, 1749 unsolved
Search for dead transitions found 0 dead transitions in 62856ms
Finished structural reductions in LTL mode , in 1 iterations and 64826 ms. Remains : 1290/1290 places, 1750/1750 transitions.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (291 resets) in 615 ms. (64 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (23 resets) in 43 ms. (909 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (24 resets) in 26 ms. (1481 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (24 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 224557 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 3
Probabilistic random walk after 224557 steps, saw 95462 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
[2024-05-23 02:54:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 109/111 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1179/1290 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1290 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1750/3040 variables, 1290/1312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3040 variables, 0/1312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/3040 variables, 0/1312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3040/3040 variables, and 1312 constraints, problems are : Problem set: 0 solved, 3 unsolved in 737 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 1290/1290 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) 109/111 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1179/1290 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1290 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1750/3040 variables, 1290/1312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3040 variables, 3/1315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3040 variables, 0/1315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/3040 variables, 0/1315 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3040/3040 variables, and 1315 constraints, problems are : Problem set: 0 solved, 3 unsolved in 880 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 1290/1290 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1627ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 151 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=151 )
Parikh walk visited 3 properties in 88 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p0), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 734 reset in 290 ms.
Product exploration explored 100000 steps with 731 reset in 300 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 1290 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1290/1290 places, 1750/1750 transitions.
Graph (trivial) has 1225 edges and 1290 vertex of which 121 / 1290 are part of one of the 20 SCC in 3 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 1189 transition count 1648
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 58 Pre rules applied. Total rules applied 81 place count 1189 transition count 1648
Deduced a syphon composed of 138 places in 1 ms
Iterating global reduction 1 with 58 rules applied. Total rules applied 139 place count 1189 transition count 1648
Discarding 96 places :
Symmetric choice reduction at 1 with 96 rule applications. Total rules 235 place count 1093 transition count 1552
Deduced a syphon composed of 80 places in 1 ms
Iterating global reduction 1 with 96 rules applied. Total rules applied 331 place count 1093 transition count 1552
Performed 105 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 185 places in 1 ms
Iterating global reduction 1 with 105 rules applied. Total rules applied 436 place count 1093 transition count 1591
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 480 place count 1049 transition count 1547
Deduced a syphon composed of 141 places in 0 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 524 place count 1049 transition count 1547
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 161 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 544 place count 1049 transition count 1587
Deduced a syphon composed of 161 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 1 with 39 rules applied. Total rules applied 583 place count 1049 transition count 1548
Deduced a syphon composed of 161 places in 1 ms
Applied a total of 583 rules in 627 ms. Remains 1049 /1290 variables (removed 241) and now considering 1548/1750 (removed 202) transitions.
[2024-05-23 02:54:17] [INFO ] Redundant transitions in 20 ms returned []
Running 1547 sub problems to find dead transitions.
[2024-05-23 02:54:17] [INFO ] Flow matrix only has 1509 transitions (discarded 39 similar events)
// Phase 1: matrix 1509 rows 1049 cols
[2024-05-23 02:54:17] [INFO ] Computed 22 invariants in 37 ms
[2024-05-23 02:54:17] [INFO ] State equation strengthened by 160 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 timeout
1.0)
(s972 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1048 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1547 unsolved
SMT process timed out in 35452ms, After SMT, problems are : Problem set: 0 solved, 1547 unsolved
Search for dead transitions found 0 dead transitions in 35466ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1049/1290 places, 1548/1750 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36125 ms. Remains : 1049/1290 places, 1548/1750 transitions.
Built C files in :
/tmp/ltsmin13347169876644635326
[2024-05-23 02:54:52] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13347169876644635326
Running compilation step : cd /tmp/ltsmin13347169876644635326;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13347169876644635326;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13347169876644635326;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 2 out of 1290 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1290/1290 places, 1750/1750 transitions.
Applied a total of 0 rules in 35 ms. Remains 1290 /1290 variables (removed 0) and now considering 1750/1750 (removed 0) transitions.
// Phase 1: matrix 1750 rows 1290 cols
[2024-05-23 02:54:55] [INFO ] Computed 22 invariants in 30 ms
[2024-05-23 02:54:56] [INFO ] Implicit Places using invariants in 504 ms returned []
[2024-05-23 02:54:56] [INFO ] Invariant cache hit.
[2024-05-23 02:54:57] [INFO ] Implicit Places using invariants and state equation in 1434 ms returned []
Implicit Place search using SMT with State Equation took 1941 ms to find 0 implicit places.
Running 1749 sub problems to find dead transitions.
[2024-05-23 02:54:57] [INFO ] Invariant cache hit.
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 1289/3040 variables, and 0 constraints, problems are : Problem set: 0 solved, 1749 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1290 constraints, PredecessorRefiner: 1749/1749 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1749 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 1289/3040 variables, and 0 constraints, problems are : Problem set: 0 solved, 1749 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, State Equation: 0/1290 constraints, PredecessorRefiner: 0/1749 constraints, Known Traps: 0/0 constraints]
After SMT, in 63202ms problems are : Problem set: 0 solved, 1749 unsolved
Search for dead transitions found 0 dead transitions in 63221ms
Finished structural reductions in LTL mode , in 1 iterations and 65203 ms. Remains : 1290/1290 places, 1750/1750 transitions.
Built C files in :
/tmp/ltsmin5130635017883422807
[2024-05-23 02:56:00] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5130635017883422807
Running compilation step : cd /tmp/ltsmin5130635017883422807;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5130635017883422807;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5130635017883422807;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-23 02:56:04] [INFO ] Flatten gal took : 34 ms
[2024-05-23 02:56:04] [INFO ] Flatten gal took : 33 ms
[2024-05-23 02:56:04] [INFO ] Time to serialize gal into /tmp/LTL16019022205914627531.gal : 6 ms
[2024-05-23 02:56:04] [INFO ] Time to serialize properties into /tmp/LTL16809550554772095910.prop : 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/LTL16019022205914627531.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16380775354251564691.hoa' '-atoms' '/tmp/LTL16809550554772095910.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...320
Loading property file /tmp/LTL16809550554772095910.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16380775354251564691.hoa
Detected timeout of ITS tools.
[2024-05-23 02:56:19] [INFO ] Flatten gal took : 41 ms
[2024-05-23 02:56:19] [INFO ] Flatten gal took : 34 ms
[2024-05-23 02:56:19] [INFO ] Time to serialize gal into /tmp/LTL1714759474323086326.gal : 7 ms
[2024-05-23 02:56:19] [INFO ] Time to serialize properties into /tmp/LTL12646858701895612317.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/LTL1714759474323086326.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12646858701895612317.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 : !((X(X(G((X("(p190==1)"))||(F("(p2874==0)")))))))
Formula 0 simplified : XXF(X!"(p190==1)" & G!"(p2874==0)")
Detected timeout of ITS tools.
[2024-05-23 02:56:34] [INFO ] Flatten gal took : 32 ms
[2024-05-23 02:56:34] [INFO ] Applying decomposition
[2024-05-23 02:56:34] [INFO ] Flatten gal took : 34 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/graph1331489441482419205.txt' '-o' '/tmp/graph1331489441482419205.bin' '-w' '/tmp/graph1331489441482419205.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1331489441482419205.bin' '-l' '-1' '-v' '-w' '/tmp/graph1331489441482419205.weights' '-q' '0' '-e' '0.001'
[2024-05-23 02:56:34] [INFO ] Decomposing Gal with order
[2024-05-23 02:56:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 02:56:34] [INFO ] Removed a total of 498 redundant transitions.
[2024-05-23 02:56:34] [INFO ] Flatten gal took : 220 ms
[2024-05-23 02:56:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 17 ms.
[2024-05-23 02:56:34] [INFO ] Time to serialize gal into /tmp/LTL13725423043431093289.gal : 33 ms
[2024-05-23 02:56:34] [INFO ] Time to serialize properties into /tmp/LTL3966569756346014396.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/LTL13725423043431093289.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3966569756346014396.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 : !((X(X(G((X("(i0.u17.p190==1)"))||(F("(i16.i1.i0.u167.p2874==0)")))))))
Formula 0 simplified : XXF(X!"(i0.u17.p190==1)" & G!"(i16.i1.i0.u167.p2874==0)")
Detected timeout of ITS tools.
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-14 finished in 296454 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(p0)||(p1 U (p2||G(p3)))) U !p0))'
Support contains 6 out of 1339 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1339/1339 places, 1819/1819 transitions.
Graph (trivial) has 1271 edges and 1339 vertex of which 121 / 1339 are part of one of the 20 SCC in 1 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 1237 transition count 1613
Reduce places removed 103 places and 0 transitions.
Iterating post reduction 1 with 103 rules applied. Total rules applied 207 place count 1134 transition count 1613
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 207 place count 1134 transition count 1567
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 299 place count 1088 transition count 1567
Discarding 58 places :
Symmetric choice reduction at 2 with 58 rule applications. Total rules 357 place count 1030 transition count 1509
Iterating global reduction 2 with 58 rules applied. Total rules applied 415 place count 1030 transition count 1509
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 418 place count 1030 transition count 1506
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 418 place count 1030 transition count 1505
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 420 place count 1029 transition count 1505
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 432 place count 1017 transition count 1493
Iterating global reduction 3 with 12 rules applied. Total rules applied 444 place count 1017 transition count 1493
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 455 place count 1017 transition count 1482
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 4 with 244 rules applied. Total rules applied 699 place count 895 transition count 1360
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 701 place count 893 transition count 1358
Iterating global reduction 4 with 2 rules applied. Total rules applied 703 place count 893 transition count 1358
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 705 place count 893 transition count 1356
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 725 place count 893 transition count 1336
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 727 place count 891 transition count 1334
Applied a total of 727 rules in 435 ms. Remains 891 /1339 variables (removed 448) and now considering 1334/1819 (removed 485) transitions.
[2024-05-23 02:56:50] [INFO ] Flow matrix only has 1295 transitions (discarded 39 similar events)
// Phase 1: matrix 1295 rows 891 cols
[2024-05-23 02:56:50] [INFO ] Computed 22 invariants in 31 ms
[2024-05-23 02:56:50] [INFO ] Implicit Places using invariants in 420 ms returned []
[2024-05-23 02:56:50] [INFO ] Flow matrix only has 1295 transitions (discarded 39 similar events)
[2024-05-23 02:56:50] [INFO ] Invariant cache hit.
[2024-05-23 02:56:51] [INFO ] Implicit Places using invariants and state equation in 870 ms returned []
Implicit Place search using SMT with State Equation took 1292 ms to find 0 implicit places.
[2024-05-23 02:56:51] [INFO ] Redundant transitions in 17 ms returned []
Running 548 sub problems to find dead transitions.
[2024-05-23 02:56:51] [INFO ] Flow matrix only has 1295 transitions (discarded 39 similar events)
[2024-05-23 02:56:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/871 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/871 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (OVERLAPS) 20/891 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/891 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 4 (OVERLAPS) 1294/2185 variables, 891/913 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2185/2186 variables, and 913 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 891/891 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/871 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/871 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (OVERLAPS) 20/891 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/891 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 4 (OVERLAPS) 1294/2185 variables, 891/913 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2185 variables, 548/1461 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 timeout
1)
(s3 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2185/2186 variables, and 1461 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 891/891 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 0/0 constraints]
After SMT, in 60715ms problems are : Problem set: 0 solved, 548 unsolved
Search for dead transitions found 0 dead transitions in 60720ms
Starting structural reductions in SI_LTL mode, iteration 1 : 891/1339 places, 1334/1819 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62475 ms. Remains : 891/1339 places, 1334/1819 transitions.
Stuttering acceptance computed with spot in 279 ms :[p0, (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0)), true, (NOT p3), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-20b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-15 finished in 62788 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((!(p0 U p1)||X(X(p2))||G(X(p0)))))))'
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&&G(p2))))))'
Found a Shortening insensitive property : FlexibleBarrier-PT-20b-LTLFireability-11
Stuttering acceptance computed with spot in 140 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 2 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1339/1339 places, 1819/1819 transitions.
Graph (trivial) has 1275 edges and 1339 vertex of which 121 / 1339 are part of one of the 20 SCC in 1 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 1237 transition count 1613
Reduce places removed 103 places and 0 transitions.
Iterating post reduction 1 with 103 rules applied. Total rules applied 207 place count 1134 transition count 1613
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 207 place count 1134 transition count 1568
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 297 place count 1089 transition count 1568
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 357 place count 1029 transition count 1508
Iterating global reduction 2 with 60 rules applied. Total rules applied 417 place count 1029 transition count 1508
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 421 place count 1029 transition count 1504
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 421 place count 1029 transition count 1503
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 423 place count 1028 transition count 1503
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 435 place count 1016 transition count 1491
Iterating global reduction 3 with 12 rules applied. Total rules applied 447 place count 1016 transition count 1491
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 457 place count 1016 transition count 1481
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 4 with 244 rules applied. Total rules applied 701 place count 894 transition count 1359
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 705 place count 890 transition count 1355
Iterating global reduction 4 with 4 rules applied. Total rules applied 709 place count 890 transition count 1355
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 713 place count 890 transition count 1351
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 5 with 20 rules applied. Total rules applied 733 place count 890 transition count 1331
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 735 place count 888 transition count 1329
Applied a total of 735 rules in 274 ms. Remains 888 /1339 variables (removed 451) and now considering 1329/1819 (removed 490) transitions.
[2024-05-23 02:57:53] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
// Phase 1: matrix 1290 rows 888 cols
[2024-05-23 02:57:53] [INFO ] Computed 22 invariants in 33 ms
[2024-05-23 02:57:53] [INFO ] Implicit Places using invariants in 457 ms returned []
[2024-05-23 02:57:53] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2024-05-23 02:57:53] [INFO ] Invariant cache hit.
[2024-05-23 02:57:54] [INFO ] Implicit Places using invariants and state equation in 977 ms returned []
Implicit Place search using SMT with State Equation took 1449 ms to find 0 implicit places.
Running 545 sub problems to find dead transitions.
[2024-05-23 02:57:54] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2024-05-23 02:57:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 2 (OVERLAPS) 20/888 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/888 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 4 (OVERLAPS) 1289/2177 variables, 888/910 constraints. Problems are: Problem set: 0 solved, 545 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 2177/2178 variables, and 910 constraints, problems are : Problem set: 0 solved, 545 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 888/888 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 545 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 2 (OVERLAPS) 20/888 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/888 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 4 (OVERLAPS) 1289/2177 variables, 888/910 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2177 variables, 545/1455 constraints. Problems are: Problem set: 0 solved, 545 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2177/2178 variables, and 1455 constraints, problems are : Problem set: 0 solved, 545 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 888/888 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 0/0 constraints]
After SMT, in 60715ms problems are : Problem set: 0 solved, 545 unsolved
Search for dead transitions found 0 dead transitions in 60721ms
Starting structural reductions in LI_LTL mode, iteration 1 : 888/1339 places, 1329/1819 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 62446 ms. Remains : 888/1339 places, 1329/1819 transitions.
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-11
Product exploration explored 100000 steps with 3797 reset in 1226 ms.
Product exploration explored 100000 steps with 3808 reset in 1218 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 (NOT p2)), (X (NOT p2)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 97 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), false, false]
RANDOM walk for 40000 steps (1538 resets) in 607 ms. (65 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 30 ms. (1290 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 182159 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 11
Probabilistic random walk after 182159 steps, saw 58695 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
[2024-05-23 02:59:02] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2024-05-23 02:59:02] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
Problem apf3 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 132/186 variables, 54/56 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/56 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1233/1419 variables, 148/204 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1419 variables, 1/205 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1419 variables, 0/205 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 686/2105 variables, 19/224 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2105 variables, 614/838 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2105 variables, 0/838 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 72/2177 variables, 72/910 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2177 variables, 0/910 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/2177 variables, 0/910 constraints. Problems are: Problem set: 2 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2177/2178 variables, and 910 constraints, problems are : Problem set: 2 solved, 9 unsolved in 1416 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 888/888 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 52/54 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 132/186 variables, 54/56 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/56 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1233/1419 variables, 148/204 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1419 variables, 1/205 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1419 variables, 9/214 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1419 variables, 0/214 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 686/2105 variables, 19/233 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2105 variables, 614/847 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2105 variables, 0/847 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 72/2177 variables, 72/919 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2177 variables, 0/919 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/2177 variables, 0/919 constraints. Problems are: Problem set: 2 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2177/2178 variables, and 919 constraints, problems are : Problem set: 2 solved, 9 unsolved in 1398 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 888/888 constraints, PredecessorRefiner: 9/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 2832ms problems are : Problem set: 2 solved, 9 unsolved
Fused 9 Parikh solutions to 5 different solutions.
Finished Parikh walk after 89 steps, including 3 resets, run visited all 9 properties in 3 ms. (steps per millisecond=29 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 9 properties in 5 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p0 p1 p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X p0)), (X (X (AND p0 (NOT p2)))), (X (X p1)), (G (OR p0 (NOT p2) (NOT p1))), (G (OR (NOT p0) (NOT p2) (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))))), (F (NOT (AND (OR p0 p2) (OR p0 p1)))), (F (NOT (OR (NOT p0) (NOT p2)))), (F p2), (F (NOT (OR p0 (NOT p2)))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 p2))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 21 factoid took 490 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 1 out of 888 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 888/888 places, 1329/1329 transitions.
Applied a total of 0 rules in 89 ms. Remains 888 /888 variables (removed 0) and now considering 1329/1329 (removed 0) transitions.
[2024-05-23 02:59:05] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2024-05-23 02:59:05] [INFO ] Invariant cache hit.
[2024-05-23 02:59:06] [INFO ] Implicit Places using invariants in 427 ms returned []
[2024-05-23 02:59:06] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2024-05-23 02:59:06] [INFO ] Invariant cache hit.
[2024-05-23 02:59:07] [INFO ] Implicit Places using invariants and state equation in 917 ms returned []
Implicit Place search using SMT with State Equation took 1348 ms to find 0 implicit places.
[2024-05-23 02:59:07] [INFO ] Redundant transitions in 16 ms returned []
Running 545 sub problems to find dead transitions.
[2024-05-23 02:59:07] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2024-05-23 02:59:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 2 (OVERLAPS) 20/888 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/888 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 4 (OVERLAPS) 1289/2177 variables, 888/910 constraints. Problems are: Problem set: 0 solved, 545 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2177/2178 variables, and 910 constraints, problems are : Problem set: 0 solved, 545 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 888/888 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 545 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/868 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/868 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 2 (OVERLAPS) 20/888 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/888 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 4 (OVERLAPS) 1289/2177 variables, 888/910 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2177 variables, 545/1455 constraints. Problems are: Problem set: 0 solved, 545 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2177/2178 variables, and 1455 constraints, problems are : Problem set: 0 solved, 545 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 888/888 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 0/0 constraints]
After SMT, in 60768ms problems are : Problem set: 0 solved, 545 unsolved
Search for dead transitions found 0 dead transitions in 60774ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62239 ms. Remains : 888/888 places, 1329/1329 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 40000 steps (1544 resets) in 493 ms. (80 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 466675 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :0 out of 1
Probabilistic random walk after 466675 steps, saw 121258 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
[2024-05-23 03:00:11] [INFO ] Flow matrix only has 1290 transitions (discarded 39 similar events)
[2024-05-23 03:00:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/94 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1243/1337 variables, 97/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1337 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1337 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 764/2101 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2101 variables, 688/834 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2101 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 76/2177 variables, 76/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2177 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2177 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2177/2178 variables, and 910 constraints, problems are : Problem set: 0 solved, 1 unsolved in 449 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 888/888 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 67/94 variables, 27/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1243/1337 variables, 97/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1337 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1337 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1337 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 764/2101 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2101 variables, 688/835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2101 variables, 0/835 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 76/2177 variables, 76/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2177 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2177 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2177/2178 variables, and 911 constraints, problems are : Problem set: 0 solved, 1 unsolved in 456 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 888/888 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 920ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 21 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3792 reset in 1163 ms.
Product exploration explored 100000 steps with 3780 reset in 1159 ms.
Built C files in :
/tmp/ltsmin11982999463357128051
[2024-05-23 03:00:14] [INFO ] Computing symmetric may disable matrix : 1329 transitions.
[2024-05-23 03:00:14] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 03:00:14] [INFO ] Computing symmetric may enable matrix : 1329 transitions.
[2024-05-23 03:00:14] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 03:00:15] [INFO ] Computing Do-Not-Accords matrix : 1329 transitions.
[2024-05-23 03:00:15] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 03:00:15] [INFO ] Built C files in 409ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11982999463357128051
Running compilation step : cd /tmp/ltsmin11982999463357128051;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11982999463357128051;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11982999463357128051;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 1 out of 888 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 888/888 places, 1329/1329 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 887 transition count 1328
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 886 transition count 1327
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 886 transition count 1327
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 886 transition count 1326
Applied a total of 5 rules in 133 ms. Remains 886 /888 variables (removed 2) and now considering 1326/1329 (removed 3) transitions.
[2024-05-23 03:00:18] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
// Phase 1: matrix 1287 rows 886 cols
[2024-05-23 03:00:18] [INFO ] Computed 22 invariants in 35 ms
[2024-05-23 03:00:19] [INFO ] Implicit Places using invariants in 520 ms returned []
[2024-05-23 03:00:19] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
[2024-05-23 03:00:19] [INFO ] Invariant cache hit.
[2024-05-23 03:00:19] [INFO ] Implicit Places using invariants and state equation in 950 ms returned []
Implicit Place search using SMT with State Equation took 1485 ms to find 0 implicit places.
[2024-05-23 03:00:20] [INFO ] Redundant transitions in 20 ms returned []
Running 543 sub problems to find dead transitions.
[2024-05-23 03:00:20] [INFO ] Flow matrix only has 1287 transitions (discarded 39 similar events)
[2024-05-23 03:00:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/866 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/866 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 2 (OVERLAPS) 20/886 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/886 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 4 (OVERLAPS) 1286/2172 variables, 886/908 constraints. Problems are: Problem set: 0 solved, 543 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2172/2173 variables, and 908 constraints, problems are : Problem set: 0 solved, 543 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 886/886 constraints, PredecessorRefiner: 543/543 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 543 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/866 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/866 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 2 (OVERLAPS) 20/886 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/886 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 4 (OVERLAPS) 1286/2172 variables, 886/908 constraints. Problems are: Problem set: 0 solved, 543 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2172 variables, 543/1451 constraints. Problems are: Problem set: 0 solved, 543 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2172/2173 variables, and 1451 constraints, problems are : Problem set: 0 solved, 543 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 886/886 constraints, PredecessorRefiner: 543/543 constraints, Known Traps: 0/0 constraints]
After SMT, in 60749ms problems are : Problem set: 0 solved, 543 unsolved
Search for dead transitions found 0 dead transitions in 60760ms
Starting structural reductions in SI_LTL mode, iteration 1 : 886/888 places, 1326/1329 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62405 ms. Remains : 886/888 places, 1326/1329 transitions.
Built C files in :
/tmp/ltsmin14381699082775044279
[2024-05-23 03:01:20] [INFO ] Computing symmetric may disable matrix : 1326 transitions.
[2024-05-23 03:01:20] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 03:01:20] [INFO ] Computing symmetric may enable matrix : 1326 transitions.
[2024-05-23 03:01:20] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 03:01:21] [INFO ] Computing Do-Not-Accords matrix : 1326 transitions.
[2024-05-23 03:01:21] [INFO ] Computation of Completed DNA matrix. took 27 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 03:01:21] [INFO ] Built C files in 383ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14381699082775044279
Running compilation step : cd /tmp/ltsmin14381699082775044279;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14381699082775044279;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14381699082775044279;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-23 03:01:24] [INFO ] Flatten gal took : 60 ms
[2024-05-23 03:01:24] [INFO ] Flatten gal took : 65 ms
[2024-05-23 03:01:24] [INFO ] Time to serialize gal into /tmp/LTL12048868023744633217.gal : 19 ms
[2024-05-23 03:01:24] [INFO ] Time to serialize properties into /tmp/LTL1153790338105877964.prop : 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/LTL12048868023744633217.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17008619448878428503.hoa' '-atoms' '/tmp/LTL1153790338105877964.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...319
Loading property file /tmp/LTL1153790338105877964.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17008619448878428503.hoa
Detected timeout of ITS tools.
[2024-05-23 03:01:39] [INFO ] Flatten gal took : 24 ms
[2024-05-23 03:01:39] [INFO ] Flatten gal took : 24 ms
[2024-05-23 03:01:39] [INFO ] Time to serialize gal into /tmp/LTL9864090702659220487.gal : 5 ms
[2024-05-23 03:01:39] [INFO ] Time to serialize properties into /tmp/LTL6119664818264832693.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/LTL9864090702659220487.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6119664818264832693.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...275
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(p2071==0)"))||(("(p1113==0)")&&(G("(p1113==1)")))))))
Formula 0 simplified : XG(F!"(p2071==0)" & (!"(p1113==0)" | F!"(p1113==1)"))
Detected timeout of ITS tools.
[2024-05-23 03:01:54] [INFO ] Flatten gal took : 23 ms
[2024-05-23 03:01:54] [INFO ] Applying decomposition
[2024-05-23 03:01:54] [INFO ] Flatten gal took : 24 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/graph17504608527463668450.txt' '-o' '/tmp/graph17504608527463668450.bin' '-w' '/tmp/graph17504608527463668450.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17504608527463668450.bin' '-l' '-1' '-v' '-w' '/tmp/graph17504608527463668450.weights' '-q' '0' '-e' '0.001'
[2024-05-23 03:01:54] [INFO ] Decomposing Gal with order
[2024-05-23 03:01:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 03:01:54] [INFO ] Removed a total of 521 redundant transitions.
[2024-05-23 03:01:54] [INFO ] Flatten gal took : 224 ms
[2024-05-23 03:01:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 23 ms.
[2024-05-23 03:01:55] [INFO ] Time to serialize gal into /tmp/LTL237331598405525714.gal : 24 ms
[2024-05-23 03:01:55] [INFO ] Time to serialize properties into /tmp/LTL903264885192634400.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/LTL237331598405525714.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL903264885192634400.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...252
Read 1 LTL properties
Checking formula 0 : !((X(F((G("(i11.u35.p2071==0)"))||(("(u20.p1113==0)")&&(G("(u20.p1113==1)")))))))
Formula 0 simplified : XG(F!"(i11.u35.p2071==0)" & (!"(u20.p1113==0)" | F!"(u20.p1113==1)"))
Detected timeout of ITS tools.
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-11 finished in 257255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(p0)||F(p1))))))'
Found a Lengthening insensitive property : FlexibleBarrier-PT-20b-LTLFireability-14
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 1339 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1339/1339 places, 1819/1819 transitions.
Graph (trivial) has 1274 edges and 1339 vertex of which 121 / 1339 are part of one of the 20 SCC in 1 ms
Free SCC test removed 101 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 102 place count 1237 transition count 1615
Reduce places removed 101 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 102 rules applied. Total rules applied 204 place count 1136 transition count 1614
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 205 place count 1135 transition count 1614
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 205 place count 1135 transition count 1567
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 299 place count 1088 transition count 1567
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 360 place count 1027 transition count 1506
Iterating global reduction 3 with 61 rules applied. Total rules applied 421 place count 1027 transition count 1506
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 425 place count 1027 transition count 1502
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 425 place count 1027 transition count 1501
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 427 place count 1026 transition count 1501
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 439 place count 1014 transition count 1489
Iterating global reduction 4 with 12 rules applied. Total rules applied 451 place count 1014 transition count 1489
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 463 place count 1014 transition count 1477
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 5 with 242 rules applied. Total rules applied 705 place count 893 transition count 1356
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 709 place count 889 transition count 1352
Iterating global reduction 5 with 4 rules applied. Total rules applied 713 place count 889 transition count 1352
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 717 place count 889 transition count 1348
Drop transitions (Redundant composition of simpler transitions.) removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 6 with 19 rules applied. Total rules applied 736 place count 889 transition count 1329
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 737 place count 889 transition count 1329
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 739 place count 887 transition count 1327
Applied a total of 739 rules in 264 ms. Remains 887 /1339 variables (removed 452) and now considering 1327/1819 (removed 492) transitions.
[2024-05-23 03:02:10] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
// Phase 1: matrix 1288 rows 887 cols
[2024-05-23 03:02:10] [INFO ] Computed 22 invariants in 31 ms
[2024-05-23 03:02:11] [INFO ] Implicit Places using invariants in 458 ms returned []
[2024-05-23 03:02:11] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2024-05-23 03:02:11] [INFO ] Invariant cache hit.
[2024-05-23 03:02:11] [INFO ] Implicit Places using invariants and state equation in 847 ms returned []
Implicit Place search using SMT with State Equation took 1307 ms to find 0 implicit places.
Running 544 sub problems to find dead transitions.
[2024-05-23 03:02:11] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2024-05-23 03:02:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/867 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/867 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 2 (OVERLAPS) 20/887 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/887 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 4 (OVERLAPS) 1287/2174 variables, 887/909 constraints. Problems are: Problem set: 0 solved, 544 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2174/2175 variables, and 909 constraints, problems are : Problem set: 0 solved, 544 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 887/887 constraints, PredecessorRefiner: 544/544 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 544 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/867 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/867 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 2 (OVERLAPS) 20/887 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/887 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 4 (OVERLAPS) 1287/2174 variables, 887/909 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2174 variables, 544/1453 constraints. Problems are: Problem set: 0 solved, 544 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2174/2175 variables, and 1453 constraints, problems are : Problem set: 0 solved, 544 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 887/887 constraints, PredecessorRefiner: 544/544 constraints, Known Traps: 0/0 constraints]
After SMT, in 60741ms problems are : Problem set: 0 solved, 544 unsolved
Search for dead transitions found 0 dead transitions in 60750ms
Starting structural reductions in LI_LTL mode, iteration 1 : 887/1339 places, 1327/1819 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 62326 ms. Remains : 887/1339 places, 1327/1819 transitions.
Running random walk in product with property : FlexibleBarrier-PT-20b-LTLFireability-14
Product exploration explored 100000 steps with 3772 reset in 1127 ms.
Product exploration explored 100000 steps with 3790 reset in 1148 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 (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (1553 resets) in 906 ms. (44 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 25 ms. (1538 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 2/3 properties
[2024-05-23 03:03:15] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2024-05-23 03:03:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 132/187 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1229/1416 variables, 146/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1416 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1416 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 686/2102 variables, 19/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2102 variables, 614/837 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2102 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 72/2174 variables, 72/909 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2174 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2174 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2174/2175 variables, and 909 constraints, problems are : Problem set: 0 solved, 2 unsolved in 541 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 887/887 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) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 132/187 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1229/1416 variables, 146/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1416 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1416 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1416 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 686/2102 variables, 19/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2102 variables, 614/839 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2102 variables, 0/839 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 72/2174 variables, 72/911 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2174 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/2174 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2174/2175 variables, and 911 constraints, problems are : Problem set: 0 solved, 2 unsolved in 566 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 887/887 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1147ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1842 steps, including 63 resets, run visited all 2 properties in 30 ms. (steps per millisecond=61 )
Parikh walk visited 2 properties in 30 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p0), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 231 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 887 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 887/887 places, 1327/1327 transitions.
Applied a total of 0 rules in 21 ms. Remains 887 /887 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2024-05-23 03:03:17] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2024-05-23 03:03:17] [INFO ] Invariant cache hit.
[2024-05-23 03:03:18] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-05-23 03:03:18] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2024-05-23 03:03:18] [INFO ] Invariant cache hit.
[2024-05-23 03:03:18] [INFO ] Implicit Places using invariants and state equation in 865 ms returned []
Implicit Place search using SMT with State Equation took 1255 ms to find 0 implicit places.
Running 544 sub problems to find dead transitions.
[2024-05-23 03:03:18] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2024-05-23 03:03:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/867 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/867 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 2 (OVERLAPS) 20/887 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/887 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 4 (OVERLAPS) 1287/2174 variables, 887/909 constraints. Problems are: Problem set: 0 solved, 544 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 2174/2175 variables, and 909 constraints, problems are : Problem set: 0 solved, 544 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 887/887 constraints, PredecessorRefiner: 544/544 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 544 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/867 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/867 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 2 (OVERLAPS) 20/887 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/887 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 4 (OVERLAPS) 1287/2174 variables, 887/909 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2174 variables, 544/1453 constraints. Problems are: Problem set: 0 solved, 544 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2174/2175 variables, and 1453 constraints, problems are : Problem set: 0 solved, 544 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 887/887 constraints, PredecessorRefiner: 544/544 constraints, Known Traps: 0/0 constraints]
After SMT, in 60698ms problems are : Problem set: 0 solved, 544 unsolved
Search for dead transitions found 0 dead transitions in 60704ms
Finished structural reductions in LTL mode , in 1 iterations and 61982 ms. Remains : 887/887 places, 1327/1327 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 p1 (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
RANDOM walk for 40000 steps (1539 resets) in 1463 ms. (27 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
[2024-05-23 03:04:20] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2024-05-23 03:04:20] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 132/187 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1229/1416 variables, 146/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1416 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1416 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 686/2102 variables, 19/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2102 variables, 614/837 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2102 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 72/2174 variables, 72/909 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2174 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/2174 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2174/2175 variables, and 909 constraints, problems are : Problem set: 0 solved, 2 unsolved in 538 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 887/887 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) 53/55 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 132/187 variables, 55/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1229/1416 variables, 146/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1416 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1416 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1416 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 686/2102 variables, 19/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2102 variables, 614/839 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2102 variables, 0/839 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 72/2174 variables, 72/911 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2174 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/2174 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2174/2175 variables, and 911 constraints, problems are : Problem set: 0 solved, 2 unsolved in 564 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 887/887 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1142ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 36 ms.
Support contains 2 out of 887 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 887/887 places, 1327/1327 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 887 transition count 1287
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 60 place count 867 transition count 1267
Iterating global reduction 1 with 20 rules applied. Total rules applied 80 place count 867 transition count 1267
Free-agglomeration rule applied 762 times.
Iterating global reduction 1 with 762 rules applied. Total rules applied 842 place count 867 transition count 505
Discarding 90 places :
Also discarding 415 output transitions
Drop transitions (Output transitions of discarded places.) removed 415 transitions
Remove reverse transitions (loop back) rule discarded transition t379.t1387.t1202 and 90 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Graph (trivial) has 14 edges and 13 vertex of which 10 / 13 are part of one of the 2 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 74 rules applied. Total rules applied 916 place count 5 transition count 18
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 929 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 929 place count 5 transition count 4
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 931 place count 4 transition count 4
Applied a total of 931 rules in 132 ms. Remains 4 /887 variables (removed 883) and now considering 4/1327 (removed 1323) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 4/887 places, 4/1327 transitions.
RANDOM walk for 12 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F p0), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 199 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 3784 reset in 1117 ms.
Product exploration explored 100000 steps with 3778 reset in 1128 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 2 out of 887 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 887/887 places, 1327/1327 transitions.
Applied a total of 0 rules in 85 ms. Remains 887 /887 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2024-05-23 03:04:25] [INFO ] Redundant transitions in 14 ms returned []
Running 544 sub problems to find dead transitions.
[2024-05-23 03:04:25] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2024-05-23 03:04:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/867 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/867 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 2 (OVERLAPS) 20/887 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/887 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 4 (OVERLAPS) 1287/2174 variables, 887/909 constraints. Problems are: Problem set: 0 solved, 544 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2174/2175 variables, and 909 constraints, problems are : Problem set: 0 solved, 544 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 887/887 constraints, PredecessorRefiner: 544/544 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 544 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/867 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/867 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 2 (OVERLAPS) 20/887 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/887 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 4 (OVERLAPS) 1287/2174 variables, 887/909 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2174 variables, 544/1453 constraints. Problems are: Problem set: 0 solved, 544 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2174/2175 variables, and 1453 constraints, problems are : Problem set: 0 solved, 544 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 887/887 constraints, PredecessorRefiner: 544/544 constraints, Known Traps: 0/0 constraints]
After SMT, in 60647ms problems are : Problem set: 0 solved, 544 unsolved
Search for dead transitions found 0 dead transitions in 60652ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60766 ms. Remains : 887/887 places, 1327/1327 transitions.
Built C files in :
/tmp/ltsmin12208151031784711520
[2024-05-23 03:05:26] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12208151031784711520
Running compilation step : cd /tmp/ltsmin12208151031784711520;'/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 2728 ms.
Running link step : cd /tmp/ltsmin12208151031784711520;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin12208151031784711520;'/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' '--hoa' '/tmp/stateBased11265844477583242340.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 887 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 887/887 places, 1327/1327 transitions.
Applied a total of 0 rules in 23 ms. Remains 887 /887 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2024-05-23 03:05:41] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2024-05-23 03:05:41] [INFO ] Invariant cache hit.
[2024-05-23 03:05:41] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-05-23 03:05:41] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2024-05-23 03:05:41] [INFO ] Invariant cache hit.
[2024-05-23 03:05:42] [INFO ] Implicit Places using invariants and state equation in 875 ms returned []
Implicit Place search using SMT with State Equation took 1304 ms to find 0 implicit places.
Running 544 sub problems to find dead transitions.
[2024-05-23 03:05:42] [INFO ] Flow matrix only has 1288 transitions (discarded 39 similar events)
[2024-05-23 03:05:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/867 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/867 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 2 (OVERLAPS) 20/887 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/887 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 4 (OVERLAPS) 1287/2174 variables, 887/909 constraints. Problems are: Problem set: 0 solved, 544 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2174/2175 variables, and 909 constraints, problems are : Problem set: 0 solved, 544 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 887/887 constraints, PredecessorRefiner: 544/544 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 544 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/867 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/867 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 2 (OVERLAPS) 20/887 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/887 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 4 (OVERLAPS) 1287/2174 variables, 887/909 constraints. Problems are: Problem set: 0 solved, 544 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2174 variables, 544/1453 constraints. Problems are: Problem set: 0 solved, 544 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2174/2175 variables, and 1453 constraints, problems are : Problem set: 0 solved, 544 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 887/887 constraints, PredecessorRefiner: 544/544 constraints, Known Traps: 0/0 constraints]
After SMT, in 60639ms problems are : Problem set: 0 solved, 544 unsolved
Search for dead transitions found 0 dead transitions in 60644ms
Finished structural reductions in LTL mode , in 1 iterations and 61973 ms. Remains : 887/887 places, 1327/1327 transitions.
Built C files in :
/tmp/ltsmin2981650539068285526
[2024-05-23 03:06:43] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2981650539068285526
Running compilation step : cd /tmp/ltsmin2981650539068285526;'/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 2705 ms.
Running link step : cd /tmp/ltsmin2981650539068285526;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2981650539068285526;'/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' '--hoa' '/tmp/stateBased10091981814250208881.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 03:06:58] [INFO ] Flatten gal took : 28 ms
[2024-05-23 03:06:58] [INFO ] Flatten gal took : 27 ms
[2024-05-23 03:06:58] [INFO ] Time to serialize gal into /tmp/LTL5668524059184102609.gal : 5 ms
[2024-05-23 03:06:58] [INFO ] Time to serialize properties into /tmp/LTL10972755190296675068.prop : 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/LTL5668524059184102609.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4975119997692973944.hoa' '-atoms' '/tmp/LTL10972755190296675068.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...318
Loading property file /tmp/LTL10972755190296675068.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4975119997692973944.hoa
Detected timeout of ITS tools.
[2024-05-23 03:07:13] [INFO ] Flatten gal took : 26 ms
[2024-05-23 03:07:13] [INFO ] Flatten gal took : 26 ms
[2024-05-23 03:07:13] [INFO ] Time to serialize gal into /tmp/LTL12203487474757425579.gal : 4 ms
[2024-05-23 03:07:13] [INFO ] Time to serialize properties into /tmp/LTL12638087406553592701.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/LTL12203487474757425579.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12638087406553592701.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...277
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X("(p190==1)"))||(F("(p2874==0)")))))))
Formula 0 simplified : XXF(X!"(p190==1)" & G!"(p2874==0)")
Detected timeout of ITS tools.
[2024-05-23 03:07:28] [INFO ] Flatten gal took : 33 ms
[2024-05-23 03:07:28] [INFO ] Applying decomposition
[2024-05-23 03:07:28] [INFO ] Flatten gal took : 29 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/graph16769610787121537895.txt' '-o' '/tmp/graph16769610787121537895.bin' '-w' '/tmp/graph16769610787121537895.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16769610787121537895.bin' '-l' '-1' '-v' '-w' '/tmp/graph16769610787121537895.weights' '-q' '0' '-e' '0.001'
[2024-05-23 03:07:28] [INFO ] Decomposing Gal with order
[2024-05-23 03:07:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 03:07:28] [INFO ] Removed a total of 520 redundant transitions.
[2024-05-23 03:07:28] [INFO ] Flatten gal took : 133 ms
[2024-05-23 03:07:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 7 ms.
[2024-05-23 03:07:28] [INFO ] Time to serialize gal into /tmp/LTL5731858628762524363.gal : 7 ms
[2024-05-23 03:07:28] [INFO ] Time to serialize properties into /tmp/LTL904276507571011122.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/LTL5731858628762524363.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL904276507571011122.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...253
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X("(u2.p190==1)"))||(F("(i15.u46.p2874==0)")))))))
Formula 0 simplified : XXF(X!"(u2.p190==1)" & G!"(i15.u46.p2874==0)")
Detected timeout of ITS tools.
Treatment of property FlexibleBarrier-PT-20b-LTLFireability-14 finished in 333791 ms.
[2024-05-23 03:07:43] [INFO ] Flatten gal took : 34 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2960377308412059830
[2024-05-23 03:07:43] [INFO ] Too many transitions (1819) to apply POR reductions. Disabling POR matrices.
[2024-05-23 03:07:43] [INFO ] Applying decomposition
[2024-05-23 03:07:43] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2960377308412059830
Running compilation step : cd /tmp/ltsmin2960377308412059830;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' '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-23 03:07:43] [INFO ] Flatten gal took : 33 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/graph15498010486226741082.txt' '-o' '/tmp/graph15498010486226741082.bin' '-w' '/tmp/graph15498010486226741082.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15498010486226741082.bin' '-l' '-1' '-v' '-w' '/tmp/graph15498010486226741082.weights' '-q' '0' '-e' '0.001'
[2024-05-23 03:07:44] [INFO ] Decomposing Gal with order
[2024-05-23 03:07:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 03:07:44] [INFO ] Removed a total of 530 redundant transitions.
[2024-05-23 03:07:44] [INFO ] Flatten gal took : 147 ms
[2024-05-23 03:07:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 19 ms.
[2024-05-23 03:07:44] [INFO ] Time to serialize gal into /tmp/LTLFireability2424647750811773262.gal : 12 ms
[2024-05-23 03:07:44] [INFO ] Time to serialize properties into /tmp/LTLFireability1209656881351355754.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/LTLFireability2424647750811773262.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1209656881351355754.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 3 LTL properties
Checking formula 0 : !((G(F(G(((!(("(i10.u109.p1803==1)")U("(i5.u59.p882==1)")))||(X(X("(i5.u59.p882==0)"))))||(G(X("(i10.u109.p1803==1)"))))))))
Formula 0 simplified : GF(("(i10.u109.p1803==1)" U "(i5.u59.p882==1)") & X(X!"(i5.u59.p882==0)" & F!"(i10.u109.p1803==1)"))
Compilation finished in 4379 ms.
Running link step : cd /tmp/ltsmin2960377308412059830;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin2960377308412059830;'/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) U (LTLAPp1==true))||X(X((LTLAPp2==true)))||[](X((LTLAPp0==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin2960377308412059830;'/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) U (LTLAPp1==true))||X(X((LTLAPp2==true)))||[](X((LTLAPp0==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2960377308412059830;'/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' 'X(<>(([]((LTLAPp3==true))||((LTLAPp4==true)&&[]((LTLAPp5==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin2960377308412059830;'/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' 'X(<>(([]((LTLAPp3==true))||((LTLAPp4==true)&&[]((LTLAPp5==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2960377308412059830;'/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' 'X(X([]((X((LTLAPp6==true))||<>((LTLAPp7==true))))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-23 03:22:57] [INFO ] Applying decomposition
[2024-05-23 03:22:57] [INFO ] Flatten gal took : 154 ms
[2024-05-23 03:22:57] [INFO ] Decomposing Gal with order
[2024-05-23 03:22:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 03:22:58] [INFO ] Removed a total of 504 redundant transitions.
[2024-05-23 03:22:58] [INFO ] Flatten gal took : 449 ms
[2024-05-23 03:22:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 1709 labels/synchronizations in 628 ms.
[2024-05-23 03:22:59] [INFO ] Time to serialize gal into /tmp/LTLFireability2331126642135889126.gal : 41 ms
[2024-05-23 03:22:59] [INFO ] Time to serialize properties into /tmp/LTLFireability4991197194592613525.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/LTLFireability2331126642135889126.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4991197194592613525.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 3 LTL properties
Checking formula 0 : !((G(F(G(((!(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u29.p1803==1)")U("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u24.p882==1)")))||...291
Formula 0 simplified : GF(("(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u29.p1803==1)" U "(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.u24.p882==1)") & X(X!"(i0....269
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin2960377308412059830;'/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' 'X(X([]((X((LTLAPp6==true))||<>((LTLAPp7==true))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin2960377308412059830;'/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) U (LTLAPp1==true))||X(X((LTLAPp2==true)))||[](X((LTLAPp0==true)))))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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-20b"
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-20b, 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-171640602700140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-20b.tgz
mv FlexibleBarrier-PT-20b execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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