About the Execution of ITS-Tools for QuasiCertifProtocol-PT-22
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16206.376 | 3468850.00 | 7439630.00 | 8194.30 | FFFTFTFFFFFF?FFF | 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.r312-tall-171662337800092.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 QuasiCertifProtocol-PT-22, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-171662337800092
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 74K Apr 13 04:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 496K Apr 13 04:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 13 04:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 109K Apr 13 04:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 81K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 339K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 141K Apr 13 04:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 906K Apr 13 04:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 13 04:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 123K Apr 13 04:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 503K May 18 16:43 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 QuasiCertifProtocol-PT-22-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-PT-22-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716667949221
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-22
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-25 20:12:30] [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-25 20:12:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 20:12:30] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2024-05-25 20:12:30] [INFO ] Transformed 1966 places.
[2024-05-25 20:12:30] [INFO ] Transformed 356 transitions.
[2024-05-25 20:12:30] [INFO ] Parsed PT model containing 1966 places and 356 transitions and 4323 arcs in 218 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 792 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 1916 transition count 356
Applied a total of 50 rules in 151 ms. Remains 1916 /1966 variables (removed 50) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-05-25 20:12:31] [INFO ] Computed 1562 invariants in 60 ms
[2024-05-25 20:12:33] [INFO ] Implicit Places using invariants in 1916 ms returned []
[2024-05-25 20:12:33] [INFO ] Invariant cache hit.
[2024-05-25 20:12:35] [INFO ] Implicit Places using invariants and state equation in 2566 ms returned []
Implicit Place search using SMT with State Equation took 4520 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-25 20:12:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
(s856 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 13.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 1.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 1.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 0.0)
(s137 1.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 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 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 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 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 0.0)
(s687 0.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s704 0.0)
(s705 0.0)
(s706 0.0)
(s707 0.0)
(s708 0.0)
(s709 0.0)
(s710 0.0)
(s711 0.0)
(s712 0.0)
(s713 0.0)
(s714 0.0)
(s715 0.0)
(s716 0.0)
(s717 0.0)
(s718 0.0)
(s719 0.0)
(s720 0.0)
(s721 0.0)
(s722 0.0)
(s723 0.0)
(s724 0.0)
(s725 0.0)
(s726 0.0)
(s727 0.0)
(s728 0.0)
(s729 0.0)
(s730 0.0)
(s731 0.0)
(s732 0.0)
(s733 0.0)
(s734 0.0)
(s735 0.0)
(s736 0.0)
(s737 0.0)
(s738 0.0)
(s739 0.0)
(s740 0.0)
(s741 0.0)
(s742 0.0)
(s743 0.0)
(s744 0.0)
(s745 0.0)
(s746 0.0)
(s747 0.0)
(s748 0.0)
(s749 0.0)
(s750 0.0)
(s751 0.0)
(s752 0.0)
(s753 0.0)
(s754 0.0)
(s755 0.0)
(s756 0.0)
(s757 0.0)
(s758 0.0)
(s759 0.0)
(s760 0.0)
(s761 0.0)
(s762 0.0)
(s763 0.0)
(s764 0.0)
(s765 0.0)
(s766 0.0)
(s767 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s772 0.0)
(s773 0.0)
(s774 0.0)
(s775 0.0)
(s776 0.0)
(s777 0.0)
(s778 0.0)
(s779 0.0)
(s780 0.0)
(s781 0.0)
(s782 0.0)
(s783 0.0)
(s784 0.0)
(s785 0.0)
(s786 0.0)
(s787 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s792 0.0)
(s793 0.0)
(s794 0.0)
(s795 0.0)
(s796 0.0)
(s797 0.0)
(s798 0.0)
(s799 0.0)
(s800 0.0)
(s801 0.0)
(s802 0.0)
(s803 0.0)
(s804 0.0)
(s805 0.0)
(s806 0.0)
(s807 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s812 0.0)
(s813 0.0)
(s814 0.0)
(s815 0.0)
(s816 0.0)
(s817 0.0)
(s818 0.0)
(s819 0.0)
(s820 0.0)
(s821 0.0)
(s822 0.0)
(s823 0.0)
(s824 0.0)
(s825 0.0)
(s826 0.0)
(s827 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s832 0.0)
(s833 0.0)
(s834 0.0)
(s835 0.0)
(s836 0.0)
(s837 0.0)
(s838 0.0)
(s839 0.0)
(s840 0.0)
(s841 0.0)
(s842 0.0)
(s843 0.0)
(s844 0.0)
(s845 0.0)
(s846 0.0)
(s847 0.0)
(s848 0.0)
(s849 0.0)
(s850 0.0)
(s851 0.0)
(s852 0.0)
(s853 0.0)
(s854 0.0)
(s855 0.0)
(s856 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2271/2272 variables, and 3477 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2271 variables, 332/3809 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2271/2272 variables, and 3809 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 60591ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60610ms
Starting structural reductions in LTL mode, iteration 1 : 1916/1966 places, 356/356 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65307 ms. Remains : 1916/1966 places, 356/356 transitions.
Support contains 792 out of 1916 places after structural reductions.
[2024-05-25 20:13:36] [INFO ] Flatten gal took : 158 ms
[2024-05-25 20:13:36] [INFO ] Flatten gal took : 97 ms
[2024-05-25 20:13:36] [INFO ] Input system was already deterministic with 356 transitions.
RANDOM walk for 40000 steps (1488 resets) in 1684 ms. (23 steps per ms) remains 17/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 185 ms. (21 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (9 resets) in 93 ms. (42 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 364 ms. (10 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (9 resets) in 38 ms. (102 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (9 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (11 resets) in 27 ms. (143 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (10 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (9 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (9 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (9 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
[2024-05-25 20:13:37] [INFO ] Invariant cache hit.
Problem AtomicPropp3 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/723 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 125/848 variables, 638/638 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/848 variables, 0/638 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 956/1804 variables, 924/1562 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1804 variables, 0/1562 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 355/2159 variables, 1804/3366 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2159 variables, 0/3366 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 113/2272 variables, 112/3478 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2272 variables, 0/3478 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/2272 variables, 0/3478 constraints. Problems are: Problem set: 1 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2272/2272 variables, and 3478 constraints, problems are : Problem set: 1 solved, 16 unsolved in 5005 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1916/1916 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/722 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 125/847 variables, 638/638 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/847 variables, 0/638 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 956/1803 variables, 924/1562 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1803 variables, 0/1562 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 355/2158 variables, 1803/3365 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2158 variables, 9/3374 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2158 variables, 0/3374 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 114/2272 variables, 113/3487 constraints. Problems are: Problem set: 1 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2272/2272 variables, and 3494 constraints, problems are : Problem set: 1 solved, 16 unsolved in 5034 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1916/1916 constraints, PredecessorRefiner: 16/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 10123ms problems are : Problem set: 1 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 722 out of 1916 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1433 are kept as prefixes of interest. Removing 483 places using SCC suffix rule.8 ms
Discarding 483 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 1433 transition count 334
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 43 place count 1413 transition count 314
Iterating global reduction 1 with 20 rules applied. Total rules applied 63 place count 1413 transition count 314
Applied a total of 63 rules in 123 ms. Remains 1413 /1916 variables (removed 503) and now considering 314/356 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 1413/1916 places, 314/356 transitions.
RANDOM walk for 40000 steps (1486 resets) in 916 ms. (43 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (10 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (10 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (10 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 594016 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :0 out of 16
Probabilistic random walk after 594016 steps, saw 85022 distinct states, run finished after 3004 ms. (steps per millisecond=197 ) properties seen :0
// Phase 1: matrix 314 rows 1413 cols
[2024-05-25 20:13:51] [INFO ] Computed 1100 invariants in 27 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/722 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/722 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 100/822 variables, 594/616 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/822 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 498/1320 variables, 484/1100 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1320 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 314/1634 variables, 1320/2420 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1634 variables, 0/2420 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 93/1727 variables, 93/2513 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1727 variables, 0/2513 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/1727 variables, 0/2513 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1727/1727 variables, and 2513 constraints, problems are : Problem set: 0 solved, 16 unsolved in 3886 ms.
Refiners :[Generalized P Invariants (flows): 1100/1100 constraints, State Equation: 1413/1413 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/722 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/722 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 100/822 variables, 594/616 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/822 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 498/1320 variables, 484/1100 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1320 variables, 0/1100 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 314/1634 variables, 1320/2420 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1634 variables, 9/2429 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1634 variables, 0/2429 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 93/1727 variables, 93/2522 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1727 variables, 7/2529 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1727 variables, 0/2529 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 0/1727 variables, 0/2529 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1727/1727 variables, and 2529 constraints, problems are : Problem set: 0 solved, 16 unsolved in 13549 ms.
Refiners :[Generalized P Invariants (flows): 1100/1100 constraints, State Equation: 1413/1413 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 17508ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 15 different solutions.
Finished Parikh walk after 168 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=56 )
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 16 properties in 437 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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))||(X(!p0)&&(X(p1) U (X(G(p1))||(X(p1)&&G(p2))))))))'
Support contains 577 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 38 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-05-25 20:14:09] [INFO ] Computed 1562 invariants in 21 ms
[2024-05-25 20:14:11] [INFO ] Implicit Places using invariants in 1482 ms returned []
[2024-05-25 20:14:11] [INFO ] Invariant cache hit.
[2024-05-25 20:14:14] [INFO ] Implicit Places using invariants and state equation in 2753 ms returned []
Implicit Place search using SMT with State Equation took 4240 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-25 20:14:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2271/2272 variables, and 3477 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2271 variables, 332/3809 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2271/2272 variables, and 3809 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1915/1916 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 60440ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60447ms
Finished structural reductions in LTL mode , in 1 iterations and 64729 ms. Remains : 1916/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 631 ms :[true, p0, (AND (NOT p2) p0 (NOT p1)), (AND (NOT p2) (NOT p1)), (AND p0 (NOT p2)), (NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1)), p0, p0, (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-00
Product exploration explored 100000 steps with 3717 reset in 1152 ms.
Product exploration explored 100000 steps with 3714 reset in 1065 ms.
Computed a total of 1916 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1916 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 531 ms. Reduced automaton from 12 states, 53 edges and 3 AP (stutter sensitive) to 17 states, 82 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 660 ms :[true, (AND p0 (NOT p2)), (AND (NOT p2) p0 (NOT p1)), (NOT p2), (AND (NOT p1) (NOT p2)), p0, (AND p0 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), p0, p0, p0, p0, p0, p0, (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (1486 resets) in 1374 ms. (29 steps per ms) remains 13/18 properties
BEST_FIRST walk for 40003 steps (91 resets) in 1270 ms. (31 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (70 resets) in 1305 ms. (30 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (117 resets) in 668 ms. (59 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (120 resets) in 679 ms. (58 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (45 resets) in 195 ms. (204 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (120 resets) in 685 ms. (58 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (45 resets) in 804 ms. (49 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (68 resets) in 749 ms. (53 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (49 resets) in 800 ms. (49 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (116 resets) in 779 ms. (51 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (45 resets) in 729 ms. (54 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (69 resets) in 178 ms. (223 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (49 resets) in 717 ms. (55 steps per ms) remains 13/13 properties
[2024-05-25 20:15:22] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 32/609 variables, 528/528 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/609 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 497/1106 variables, 484/1012 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1106 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem apf11 is UNSAT
Problem apf13 is UNSAT
Problem apf14 is UNSAT
At refinement iteration 5 (OVERLAPS) 254/1360 variables, 1106/2118 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1360 variables, 0/2118 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Problem apf3 is UNSAT
Problem apf5 is UNSAT
Problem apf8 is UNSAT
At refinement iteration 7 (OVERLAPS) 785/2145 variables, 691/2809 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2145 variables, 484/3293 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2145 variables, 0/3293 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 23/2168 variables, 22/3315 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2168 variables, 23/3338 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2168 variables, 0/3338 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 98/2266 variables, 93/3431 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2266 variables, 44/3475 constraints. Problems are: Problem set: 6 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2266/2272 variables, and 3475 constraints, problems are : Problem set: 6 solved, 7 unsolved in 5012 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1913/1916 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 32/609 variables, 528/528 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/609 variables, 0/528 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 497/1106 variables, 484/1012 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1106 variables, 0/1012 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 254/1360 variables, 1106/2118 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1360 variables, 0/2118 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 785/2145 variables, 691/2809 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2145 variables, 484/3293 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2145 variables, 7/3300 constraints. Problems are: Problem set: 6 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2145/2272 variables, and 3300 constraints, problems are : Problem set: 6 solved, 7 unsolved in 5017 ms.
Refiners :[Generalized P Invariants (flows): 1496/1562 constraints, State Equation: 1797/1916 constraints, PredecessorRefiner: 7/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 10884ms problems are : Problem set: 6 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 577 out of 1916 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1363 are kept as prefixes of interest. Removing 553 places using SCC suffix rule.6 ms
Discarding 553 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 1363 transition count 325
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 1361 transition count 325
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 54 place count 1339 transition count 303
Iterating global reduction 2 with 22 rules applied. Total rules applied 76 place count 1339 transition count 303
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 2 with 23 rules applied. Total rules applied 99 place count 1339 transition count 280
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 122 place count 1316 transition count 280
Applied a total of 122 rules in 193 ms. Remains 1316 /1916 variables (removed 600) and now considering 280/356 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 1316/1916 places, 280/356 transitions.
RANDOM walk for 40000 steps (1543 resets) in 1260 ms. (31 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (93 resets) in 766 ms. (52 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (75 resets) in 825 ms. (48 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (48 resets) in 152 ms. (261 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (48 resets) in 842 ms. (47 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (50 resets) in 644 ms. (62 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (72 resets) in 154 ms. (258 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (52 resets) in 589 ms. (67 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 461872 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :0 out of 7
Probabilistic random walk after 461872 steps, saw 69832 distinct states, run finished after 3001 ms. (steps per millisecond=153 ) properties seen :0
// Phase 1: matrix 280 rows 1316 cols
[2024-05-25 20:15:37] [INFO ] Computed 1058 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 31/608 variables, 528/528 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 498/1106 variables, 484/1012 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1106 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 232/1338 variables, 1106/2118 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1338 variables, 0/2118 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 188/1526 variables, 140/2258 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1526 variables, 0/2258 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 23/1549 variables, 23/2281 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1549 variables, 23/2304 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1549 variables, 0/2304 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 47/1596 variables, 47/2351 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1596 variables, 23/2374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1596 variables, 0/2374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/1596 variables, 0/2374 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1596/1596 variables, and 2374 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4362 ms.
Refiners :[Generalized P Invariants (flows): 1058/1058 constraints, State Equation: 1316/1316 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/577 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 31/608 variables, 528/528 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 498/1106 variables, 484/1012 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1106 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 232/1338 variables, 1106/2118 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1338 variables, 1/2119 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1338 variables, 0/2119 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 188/1526 variables, 140/2259 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1526 variables, 6/2265 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1526 variables, 0/2265 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 23/1549 variables, 23/2288 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1549 variables, 23/2311 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1549 variables, 0/2311 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 47/1596 variables, 47/2358 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1596 variables, 23/2381 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1596 variables, 0/2381 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/1596 variables, 0/2381 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1596/1596 variables, and 2381 constraints, problems are : Problem set: 0 solved, 7 unsolved in 20222 ms.
Refiners :[Generalized P Invariants (flows): 1058/1058 constraints, State Equation: 1316/1316 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 24898ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 5 different solutions.
Finished Parikh walk after 96 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=19 )
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 7 properties in 296 ms.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1))), (G (OR (NOT p1) (NOT p2))), (G (OR p1 (NOT p2) (NOT p0))), (G (OR (NOT p1) p2 (NOT p0))), (G (OR (NOT p1) (NOT p2) (NOT p0))), (G (OR (NOT p1) (NOT p2) p0)), (G (OR (NOT p2) (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p2) (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (AND (NOT p2) (NOT p0) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND p1 (NOT p2)))), (F (NOT (AND p1 (NOT p2) (NOT p0)))), (F p0), (F (NOT (OR p1 p2 p0))), (F (NOT (OR p1 (NOT p2) p0))), (F p2), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p2 (NOT p0)))), (F (NOT p1)), (F (NOT (OR p1 p2))), (F (NOT (OR p1 p2 (NOT p0))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p1 (NOT p0))))
Knowledge based reduction with 23 factoid took 630 ms. Reduced automaton from 17 states, 82 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-00 finished in 113969 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1))))'
Support contains 47 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1363 are kept as prefixes of interest. Removing 553 places using SCC suffix rule.16 ms
Discarding 553 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1317 transition count 263
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1317 transition count 263
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 93 place count 1317 transition count 263
Applied a total of 93 rules in 175 ms. Remains 1317 /1916 variables (removed 599) and now considering 263/356 (removed 93) transitions.
// Phase 1: matrix 263 rows 1317 cols
[2024-05-25 20:16:03] [INFO ] Computed 1056 invariants in 6 ms
[2024-05-25 20:16:05] [INFO ] Implicit Places using invariants in 1702 ms returned []
[2024-05-25 20:16:05] [INFO ] Invariant cache hit.
[2024-05-25 20:16:11] [INFO ] Implicit Places using invariants and state equation in 5463 ms returned [580, 581, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 606, 608, 609, 610, 611, 1276, 1280, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300, 1301]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 7168 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1271/1916 places, 263/356 transitions.
Applied a total of 0 rules in 67 ms. Remains 1271 /1271 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7410 ms. Remains : 1271/1916 places, 263/356 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-01
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-01 finished in 7561 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&&X(p1)))))))'
Support contains 70 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 74 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-05-25 20:16:11] [INFO ] Computed 1562 invariants in 14 ms
[2024-05-25 20:16:13] [INFO ] Implicit Places using invariants in 2430 ms returned []
[2024-05-25 20:16:13] [INFO ] Invariant cache hit.
[2024-05-25 20:16:17] [INFO ] Implicit Places using invariants and state equation in 3840 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6272 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 59 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6406 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-02
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-02 finished in 6611 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(F(!p0))))'
Support contains 46 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 71 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-25 20:16:18] [INFO ] Invariant cache hit.
[2024-05-25 20:16:20] [INFO ] Implicit Places using invariants in 2368 ms returned []
[2024-05-25 20:16:20] [INFO ] Invariant cache hit.
[2024-05-25 20:16:27] [INFO ] Implicit Places using invariants and state equation in 7414 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 9785 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 66 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9923 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 107 ms :[p0, p0, p0]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-03
Product exploration explored 100000 steps with 33333 reset in 415 ms.
Product exploration explored 100000 steps with 33333 reset in 489 ms.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 11 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-03 finished in 11241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0) U (X(X(X(p1)))&&F(p2))))))'
Support contains 71 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 73 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-25 20:16:29] [INFO ] Invariant cache hit.
[2024-05-25 20:16:31] [INFO ] Implicit Places using invariants in 2376 ms returned []
[2024-05-25 20:16:31] [INFO ] Invariant cache hit.
[2024-05-25 20:16:35] [INFO ] Implicit Places using invariants and state equation in 3633 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6024 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 68 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6166 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 556 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), (NOT p1), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-04
Entered a terminal (fully accepting) state of product in 26 steps with 3 reset in 4 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-04 finished in 6756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U X((F(!p1)&&X(X(G(!p2)))))))))'
Support contains 71 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1363 are kept as prefixes of interest. Removing 553 places using SCC suffix rule.4 ms
Discarding 553 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1318 transition count 264
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1318 transition count 264
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 93 place count 1317 transition count 263
Applied a total of 93 rules in 138 ms. Remains 1317 /1916 variables (removed 599) and now considering 263/356 (removed 93) transitions.
// Phase 1: matrix 263 rows 1317 cols
[2024-05-25 20:16:36] [INFO ] Computed 1056 invariants in 14 ms
[2024-05-25 20:16:37] [INFO ] Implicit Places using invariants in 1516 ms returned []
[2024-05-25 20:16:37] [INFO ] Invariant cache hit.
[2024-05-25 20:16:49] [INFO ] Implicit Places using invariants and state equation in 11970 ms returned [579, 580, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 605, 607, 608, 609, 610]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 13489 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1294/1916 places, 263/356 transitions.
Applied a total of 0 rules in 50 ms. Remains 1294 /1294 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13677 ms. Remains : 1294/1916 places, 263/356 transitions.
Stuttering acceptance computed with spot in 637 ms :[(OR p1 p2), (OR p1 p2), (OR p1 p2), p2, p2, p1, p2, p2, p2, (AND p1 p2), p2, p2, p2, p2]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-05
Product exploration explored 100000 steps with 3715 reset in 510 ms.
Product exploration explored 100000 steps with 3707 reset in 540 ms.
Computed a total of 1294 stabilizing places and 263 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1294 transition count 263
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 16 ms. Reduced automaton from 14 states, 61 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-05 finished in 15605 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(F(p1)))))'
Support contains 47 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 59 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-05-25 20:16:51] [INFO ] Computed 1562 invariants in 25 ms
[2024-05-25 20:16:54] [INFO ] Implicit Places using invariants in 2378 ms returned []
[2024-05-25 20:16:54] [INFO ] Invariant cache hit.
[2024-05-25 20:17:01] [INFO ] Implicit Places using invariants and state equation in 7267 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 9650 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 80 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9790 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-06
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-06 finished in 9945 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 46 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1363 are kept as prefixes of interest. Removing 553 places using SCC suffix rule.3 ms
Discarding 553 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1318 transition count 264
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1318 transition count 264
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 95 place count 1316 transition count 262
Applied a total of 95 rules in 127 ms. Remains 1316 /1916 variables (removed 600) and now considering 262/356 (removed 94) transitions.
// Phase 1: matrix 262 rows 1316 cols
[2024-05-25 20:17:01] [INFO ] Computed 1056 invariants in 17 ms
[2024-05-25 20:17:03] [INFO ] Implicit Places using invariants in 1455 ms returned []
[2024-05-25 20:17:03] [INFO ] Invariant cache hit.
[2024-05-25 20:17:10] [INFO ] Implicit Places using invariants and state equation in 7729 ms returned [578, 579, 586, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 604, 606, 607, 608, 609]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 9187 ms to find 23 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1293/1916 places, 262/356 transitions.
Applied a total of 0 rules in 52 ms. Remains 1293 /1293 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 9367 ms. Remains : 1293/1916 places, 262/356 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-07
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-07 finished in 9425 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p0 U p1)||F(p2)))))'
Support contains 3 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1363 are kept as prefixes of interest. Removing 553 places using SCC suffix rule.3 ms
Discarding 553 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 45 place count 1318 transition count 265
Iterating global reduction 0 with 44 rules applied. Total rules applied 89 place count 1318 transition count 265
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 91 place count 1317 transition count 264
Applied a total of 91 rules in 147 ms. Remains 1317 /1916 variables (removed 599) and now considering 264/356 (removed 92) transitions.
// Phase 1: matrix 264 rows 1317 cols
[2024-05-25 20:17:11] [INFO ] Computed 1056 invariants in 6 ms
[2024-05-25 20:17:12] [INFO ] Implicit Places using invariants in 1499 ms returned []
[2024-05-25 20:17:12] [INFO ] Invariant cache hit.
[2024-05-25 20:17:15] [INFO ] Implicit Places using invariants and state equation in 2674 ms returned [580, 581, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 603, 606, 608, 609, 610, 611, 1276, 1280, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300, 1301]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 4177 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1271/1916 places, 264/356 transitions.
Applied a total of 0 rules in 46 ms. Remains 1271 /1271 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4370 ms. Remains : 1271/1916 places, 264/356 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-08
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-08 finished in 4507 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(p0)&&(p0||G(p1)||F(p2)))))'
Support contains 49 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 66 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-05-25 20:17:15] [INFO ] Computed 1562 invariants in 20 ms
[2024-05-25 20:17:17] [INFO ] Implicit Places using invariants in 2378 ms returned []
[2024-05-25 20:17:17] [INFO ] Invariant cache hit.
[2024-05-25 20:17:25] [INFO ] Implicit Places using invariants and state equation in 7309 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 9691 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 60 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9818 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 249 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1)), true]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-10 finished in 10087 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 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 69 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-25 20:17:25] [INFO ] Invariant cache hit.
[2024-05-25 20:17:27] [INFO ] Implicit Places using invariants in 2350 ms returned []
[2024-05-25 20:17:27] [INFO ] Invariant cache hit.
[2024-05-25 20:17:35] [INFO ] Implicit Places using invariants and state equation in 7333 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 9688 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 63 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9821 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 174 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-12
Product exploration explored 100000 steps with 19947 reset in 365 ms.
Product exploration explored 100000 steps with 20051 reset in 347 ms.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 90 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 198 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
RANDOM walk for 40000 steps (1484 resets) in 288 ms. (138 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (88 resets) in 59 ms. (666 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (87 resets) in 67 ms. (588 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (84 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 967705 steps, run timeout after 3001 ms. (steps per millisecond=322 ) properties seen :0 out of 3
Probabilistic random walk after 967705 steps, saw 133848 distinct states, run finished after 3001 ms. (steps per millisecond=322 ) properties seen :0
// Phase 1: matrix 356 rows 1893 cols
[2024-05-25 20:17:40] [INFO ] Computed 1540 invariants in 197 ms
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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 121/128 variables, 71/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 22/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 23/151 variables, 22/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 23/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 188/339 variables, 94/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 23/362 variables, 22/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/362 variables, 23/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/362 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 139/501 variables, 24/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/501 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 690/1191 variables, 598/901 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1191 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 30/1221 variables, 506/1407 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1221 variables, 30/1437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1221 variables, 0/1437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 499/1720 variables, 484/1921 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1720 variables, 499/2420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1720 variables, 0/2420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 529/2249 variables, 529/2949 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2249 variables, 484/3433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2249 variables, 0/3433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/2249 variables, 0/3433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2249/2249 variables, and 3433 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1816 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1893/1893 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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 121/128 variables, 71/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 22/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 23/151 variables, 22/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 23/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 188/339 variables, 94/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 23/362 variables, 22/259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/362 variables, 23/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/362 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 139/501 variables, 24/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/501 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 690/1191 variables, 598/904 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1191 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 30/1221 variables, 506/1410 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1221 variables, 30/1440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1221 variables, 0/1440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 499/1720 variables, 484/1924 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1720 variables, 499/2423 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1720 variables, 0/2423 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 529/2249 variables, 529/2952 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2249 variables, 484/3436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2249 variables, 0/3436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 0/2249 variables, 0/3436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2249/2249 variables, and 3436 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1242 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1893/1893 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 3276ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 1193 steps, including 33 resets, run visited all 3 properties in 10 ms. (steps per millisecond=119 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 11 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 4 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 185 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Stuttering acceptance computed with spot in 206 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Support contains 2 out of 1893 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Applied a total of 0 rules in 61 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-25 20:17:44] [INFO ] Invariant cache hit.
[2024-05-25 20:17:46] [INFO ] Implicit Places using invariants in 2327 ms returned []
[2024-05-25 20:17:46] [INFO ] Invariant cache hit.
[2024-05-25 20:17:55] [INFO ] Implicit Places using invariants and state equation in 9476 ms returned []
Implicit Place search using SMT with State Equation took 11806 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-25 20:17:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1892 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1892 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2248 variables, 1892/3432 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2248/2249 variables, and 3432 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1892/1893 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1892 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1892 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2248 variables, 1892/3432 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2248 variables, 332/3764 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2248/2249 variables, and 3764 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1892/1893 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 60422ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60428ms
Finished structural reductions in LTL mode , in 1 iterations and 72298 ms. Remains : 1893/1893 places, 356/356 transitions.
Computed a total of 1893 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1893 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 116 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 216 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
RANDOM walk for 40000 steps (1484 resets) in 250 ms. (159 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (89 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (85 resets) in 32 ms. (1212 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (91 resets) in 46 ms. (851 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1091557 steps, run timeout after 3001 ms. (steps per millisecond=363 ) properties seen :0 out of 3
Probabilistic random walk after 1091557 steps, saw 149172 distinct states, run finished after 3001 ms. (steps per millisecond=363 ) properties seen :0
[2024-05-25 20:19:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 121/128 variables, 71/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 22/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 23/151 variables, 22/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 23/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 188/339 variables, 94/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 23/362 variables, 22/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/362 variables, 23/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/362 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 139/501 variables, 24/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/501 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 690/1191 variables, 598/901 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1191 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 30/1221 variables, 506/1407 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1221 variables, 30/1437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1221 variables, 0/1437 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 499/1720 variables, 484/1921 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1720 variables, 499/2420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1720 variables, 0/2420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 529/2249 variables, 529/2949 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2249 variables, 484/3433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2249 variables, 0/3433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/2249 variables, 0/3433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2249/2249 variables, and 3433 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1672 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1893/1893 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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 121/128 variables, 71/73 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 22/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 23/151 variables, 22/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 23/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 188/339 variables, 94/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/339 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 23/362 variables, 22/259 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/362 variables, 23/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/362 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 139/501 variables, 24/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/501 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 690/1191 variables, 598/904 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1191 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 30/1221 variables, 506/1410 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1221 variables, 30/1440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1221 variables, 0/1440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 499/1720 variables, 484/1924 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1720 variables, 499/2423 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1720 variables, 0/2423 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 529/2249 variables, 529/2952 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2249 variables, 484/3436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2249 variables, 0/3436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 0/2249 variables, 0/3436 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2249/2249 variables, and 3436 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1409 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1893/1893 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 3094ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 805 steps, including 22 resets, run visited all 3 properties in 4 ms. (steps per millisecond=201 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 3 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 4 factoid took 192 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 192 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Stuttering acceptance computed with spot in 194 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Stuttering acceptance computed with spot in 210 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Product exploration explored 100000 steps with 19953 reset in 323 ms.
Product exploration explored 100000 steps with 20032 reset in 328 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 206 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Support contains 2 out of 1893 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Graph (complete) has 14725 edges and 1893 vertex of which 1340 are kept as prefixes of interest. Removing 553 places using SCC suffix rule.7 ms
Discarding 553 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1295 transition count 264
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1295 transition count 264
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 1295 transition count 265
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 92 rules in 398 ms. Remains 1295 /1893 variables (removed 598) and now considering 265/356 (removed 91) transitions.
[2024-05-25 20:19:05] [INFO ] Redundant transitions in 33 ms returned []
Running 241 sub problems to find dead transitions.
// Phase 1: matrix 265 rows 1295 cols
[2024-05-25 20:19:05] [INFO ] Computed 1034 invariants in 14 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1294 variables, 1034/1034 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1294 variables, 0/1034 constraints. Problems are: Problem set: 0 solved, 241 unsolved
Problem TDEAD185 is UNSAT
Problem TDEAD246 is UNSAT
At refinement iteration 2 (OVERLAPS) 265/1559 variables, 1294/2328 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1559 variables, 0/2328 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 4 (OVERLAPS) 1/1560 variables, 1/2329 constraints. Problems are: Problem set: 2 solved, 239 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1560/1560 variables, and 2329 constraints, problems are : Problem set: 2 solved, 239 unsolved in 30010 ms.
Refiners :[Generalized P Invariants (flows): 1034/1034 constraints, State Equation: 1295/1295 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1293 variables, 1034/1034 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1293 variables, 0/1034 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 2 (OVERLAPS) 264/1557 variables, 1293/2327 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1557 variables, 239/2566 constraints. Problems are: Problem set: 2 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1557 variables, 0/2566 constraints. Problems are: Problem set: 2 solved, 239 unsolved
SMT process timed out in 60235ms, After SMT, problems are : Problem set: 2 solved, 239 unsolved
Search for dead transitions found 2 dead transitions in 60239ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1295/1893 places, 263/356 transitions.
Graph (complete) has 14654 edges and 1295 vertex of which 1294 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 48 ms. Remains 1294 /1295 variables (removed 1) and now considering 263/263 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1294/1893 places, 263/356 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60727 ms. Remains : 1294/1893 places, 263/356 transitions.
Built C files in :
/tmp/ltsmin13210388436267617209
[2024-05-25 20:20:05] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13210388436267617209
Running compilation step : cd /tmp/ltsmin13210388436267617209;'/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 1701 ms.
Running link step : cd /tmp/ltsmin13210388436267617209;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin13210388436267617209;'/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/stateBased2369397325414146609.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1893 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1893/1893 places, 356/356 transitions.
Applied a total of 0 rules in 66 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1893 cols
[2024-05-25 20:20:21] [INFO ] Computed 1540 invariants in 206 ms
[2024-05-25 20:20:23] [INFO ] Implicit Places using invariants in 2458 ms returned []
[2024-05-25 20:20:23] [INFO ] Invariant cache hit.
[2024-05-25 20:20:33] [INFO ] Implicit Places using invariants and state equation in 9661 ms returned []
Implicit Place search using SMT with State Equation took 12121 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-25 20:20:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1892 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1892 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2248 variables, 1892/3432 constraints. Problems are: Problem set: 0 solved, 332 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 2248/2249 variables, and 3432 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1892/1893 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1892 variables, 1540/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1892 variables, 0/1540 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 356/2248 variables, 1892/3432 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2248 variables, 332/3764 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2248/2249 variables, and 3764 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 1540/1540 constraints, State Equation: 1892/1893 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 60417ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60436ms
Finished structural reductions in LTL mode , in 1 iterations and 72625 ms. Remains : 1893/1893 places, 356/356 transitions.
Built C files in :
/tmp/ltsmin4388412869101705237
[2024-05-25 20:21:33] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4388412869101705237
Running compilation step : cd /tmp/ltsmin4388412869101705237;'/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 1419 ms.
Running link step : cd /tmp/ltsmin4388412869101705237;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4388412869101705237;'/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/stateBased7120470315026184645.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 20:21:48] [INFO ] Flatten gal took : 57 ms
[2024-05-25 20:21:48] [INFO ] Flatten gal took : 62 ms
[2024-05-25 20:21:48] [INFO ] Time to serialize gal into /tmp/LTL12508858407731097559.gal : 11 ms
[2024-05-25 20:21:48] [INFO ] Time to serialize properties into /tmp/LTL13497367563309674913.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/LTL12508858407731097559.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15284414639584362619.hoa' '-atoms' '/tmp/LTL13497367563309674913.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/LTL13497367563309674913.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15284414639584362619.hoa
Detected timeout of ITS tools.
[2024-05-25 20:22:03] [INFO ] Flatten gal took : 51 ms
[2024-05-25 20:22:04] [INFO ] Flatten gal took : 49 ms
[2024-05-25 20:22:04] [INFO ] Time to serialize gal into /tmp/LTL14960177053149333958.gal : 10 ms
[2024-05-25 20:22:04] [INFO ] Time to serialize properties into /tmp/LTL622728163517101325.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/LTL14960177053149333958.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL622728163517101325.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(X(G((X("(a2<1)"))||(F("(a3>=1)")))))))
Formula 0 simplified : XXF(X!"(a2<1)" & G!"(a3>=1)")
Detected timeout of ITS tools.
[2024-05-25 20:22:19] [INFO ] Flatten gal took : 44 ms
[2024-05-25 20:22:19] [INFO ] Applying decomposition
[2024-05-25 20:22:19] [INFO ] Flatten gal took : 54 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/graph18425122822705255602.txt' '-o' '/tmp/graph18425122822705255602.bin' '-w' '/tmp/graph18425122822705255602.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18425122822705255602.bin' '-l' '-1' '-v' '-w' '/tmp/graph18425122822705255602.weights' '-q' '0' '-e' '0.001'
[2024-05-25 20:22:19] [INFO ] Decomposing Gal with order
[2024-05-25 20:22:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 20:22:19] [INFO ] Removed a total of 228 redundant transitions.
[2024-05-25 20:22:19] [INFO ] Flatten gal took : 267 ms
[2024-05-25 20:22:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 137 labels/synchronizations in 74 ms.
[2024-05-25 20:22:19] [INFO ] Time to serialize gal into /tmp/LTL11441458712099714218.gal : 19 ms
[2024-05-25 20:22:19] [INFO ] Time to serialize properties into /tmp/LTL10868808950410191416.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/LTL11441458712099714218.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10868808950410191416.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...256
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X("(i33.i0.u62.a2<1)"))||(F("(i33.i0.u62.a3>=1)")))))))
Formula 0 simplified : XXF(X!"(i33.i0.u62.a2<1)" & G!"(i33.i0.u62.a3>=1)")
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-12 finished in 309494 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 G(p1))))'
Support contains 3 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Applied a total of 0 rules in 67 ms. Remains 1916 /1916 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1916 cols
[2024-05-25 20:22:35] [INFO ] Computed 1562 invariants in 22 ms
[2024-05-25 20:22:37] [INFO ] Implicit Places using invariants in 2241 ms returned []
[2024-05-25 20:22:37] [INFO ] Invariant cache hit.
[2024-05-25 20:22:41] [INFO ] Implicit Places using invariants and state equation in 3762 ms returned [1155, 1156, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1181, 1183, 1184, 1185, 1186]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 6008 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1893/1916 places, 356/356 transitions.
Applied a total of 0 rules in 72 ms. Remains 1893 /1893 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6147 ms. Remains : 1893/1916 places, 356/356 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-13 finished in 6311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 25 out of 1916 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1386 are kept as prefixes of interest. Removing 530 places using SCC suffix rule.9 ms
Discarding 530 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 22 place count 1364 transition count 311
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 1364 transition count 311
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 47 place count 1362 transition count 309
Applied a total of 47 rules in 122 ms. Remains 1362 /1916 variables (removed 554) and now considering 309/356 (removed 47) transitions.
// Phase 1: matrix 309 rows 1362 cols
[2024-05-25 20:22:41] [INFO ] Computed 1056 invariants in 12 ms
[2024-05-25 20:22:42] [INFO ] Implicit Places using invariants in 1467 ms returned []
[2024-05-25 20:22:42] [INFO ] Invariant cache hit.
[2024-05-25 20:22:46] [INFO ] Implicit Places using invariants and state equation in 3176 ms returned [625, 626, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 643, 644, 645, 646, 647, 648, 651, 653, 654, 655, 656, 1321, 1325, 1326, 1327, 1328, 1329, 1330, 1331, 1332, 1333, 1334, 1335, 1336, 1337, 1338, 1339, 1340, 1341, 1342, 1343, 1344, 1345, 1346]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 4647 ms to find 46 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1316/1916 places, 309/356 transitions.
Applied a total of 0 rules in 57 ms. Remains 1316 /1316 variables (removed 0) and now considering 309/309 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4826 ms. Remains : 1316/1916 places, 309/356 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-14
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-22-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-14 finished in 4886 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 : QuasiCertifProtocol-PT-22-LTLFireability-12
Stuttering acceptance computed with spot in 196 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Support contains 2 out of 1916 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1363 are kept as prefixes of interest. Removing 553 places using SCC suffix rule.13 ms
Discarding 553 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 1317 transition count 263
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 1317 transition count 263
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 93 place count 1316 transition count 262
Applied a total of 93 rules in 133 ms. Remains 1316 /1916 variables (removed 600) and now considering 262/356 (removed 94) transitions.
// Phase 1: matrix 262 rows 1316 cols
[2024-05-25 20:22:46] [INFO ] Computed 1056 invariants in 14 ms
[2024-05-25 20:22:48] [INFO ] Implicit Places using invariants in 1538 ms returned []
[2024-05-25 20:22:48] [INFO ] Invariant cache hit.
[2024-05-25 20:22:58] [INFO ] Implicit Places using invariants and state equation in 10220 ms returned [579, 580, 587, 588, 589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602, 605, 607, 608, 609, 610, 1275, 1279, 1280, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300]
Discarding 46 places :
Implicit Place search using SMT with State Equation took 11766 ms to find 46 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1270/1916 places, 262/356 transitions.
Applied a total of 0 rules in 55 ms. Remains 1270 /1270 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 11957 ms. Remains : 1270/1916 places, 262/356 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-22-LTLFireability-12
Product exploration explored 100000 steps with 19951 reset in 374 ms.
Product exploration explored 100000 steps with 19982 reset in 383 ms.
Computed a total of 1270 stabilizing places and 262 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1270 transition count 262
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 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 170 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
RANDOM walk for 40000 steps (1390 resets) in 267 ms. (149 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (52 resets) in 50 ms. (784 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (51 resets) in 88 ms. (449 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (52 resets) in 45 ms. (869 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1251370 steps, run timeout after 3001 ms. (steps per millisecond=416 ) properties seen :0 out of 3
Probabilistic random walk after 1251370 steps, saw 172952 distinct states, run finished after 3001 ms. (steps per millisecond=416 ) properties seen :0
// Phase 1: matrix 262 rows 1270 cols
[2024-05-25 20:23:02] [INFO ] Computed 1012 invariants in 8 ms
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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 163/171 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 22/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 207/378 variables, 92/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 623/1001 variables, 553/762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1001 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 34/1035 variables, 506/1268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1035 variables, 34/1302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1035 variables, 0/1302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 495/1530 variables, 484/1786 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1530 variables, 495/2281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1530 variables, 0/2281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/1532 variables, 1/2282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1532 variables, 0/2282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1532 variables, 0/2282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1532/1532 variables, and 2282 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1121 ms.
Refiners :[Generalized P Invariants (flows): 1012/1012 constraints, State Equation: 1270/1270 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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 163/171 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 22/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 207/378 variables, 92/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 623/1001 variables, 553/765 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1001 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 34/1035 variables, 506/1271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1035 variables, 34/1305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1035 variables, 0/1305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 495/1530 variables, 484/1789 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1530 variables, 495/2284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1530 variables, 0/2284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/1532 variables, 1/2285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1532 variables, 0/2285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1532 variables, 0/2285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1532/1532 variables, and 2285 constraints, problems are : Problem set: 0 solved, 3 unsolved in 889 ms.
Refiners :[Generalized P Invariants (flows): 1012/1012 constraints, State Equation: 1270/1270 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2029ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 3153 steps, including 82 resets, run visited all 3 properties in 12 ms. (steps per millisecond=262 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 11 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 4 factoid took 177 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 175 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Stuttering acceptance computed with spot in 184 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Support contains 2 out of 1270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1270/1270 places, 262/262 transitions.
Applied a total of 0 rules in 41 ms. Remains 1270 /1270 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-25 20:23:05] [INFO ] Invariant cache hit.
[2024-05-25 20:23:06] [INFO ] Implicit Places using invariants in 1307 ms returned []
[2024-05-25 20:23:06] [INFO ] Invariant cache hit.
[2024-05-25 20:23:13] [INFO ] Implicit Places using invariants and state equation in 6784 ms returned []
Implicit Place search using SMT with State Equation took 8092 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-05-25 20:23:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1247 variables, 1012/1012 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1247 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 262/1509 variables, 1247/2259 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1509 variables, 0/2259 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 23/1532 variables, 23/2282 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1532 variables, 0/2282 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1532/1532 variables, and 2282 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 1012/1012 constraints, State Equation: 1270/1270 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1247 variables, 1012/1012 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1247 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 262/1509 variables, 1247/2259 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1509 variables, 215/2474 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1509 variables, 0/2474 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 23/1532 variables, 23/2497 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1532/1532 variables, and 2497 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 1012/1012 constraints, State Equation: 1270/1270 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
After SMT, in 60239ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 60241ms
Finished structural reductions in LTL mode , in 1 iterations and 68377 ms. Remains : 1270/1270 places, 262/262 transitions.
Computed a total of 1270 stabilizing places and 262 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1270 transition count 262
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 113 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 206 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
RANDOM walk for 40000 steps (1390 resets) in 325 ms. (122 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (50 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (51 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (51 resets) in 37 ms. (1052 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1303239 steps, run timeout after 3001 ms. (steps per millisecond=434 ) properties seen :0 out of 3
Probabilistic random walk after 1303239 steps, saw 180200 distinct states, run finished after 3001 ms. (steps per millisecond=434 ) properties seen :0
[2024-05-25 20:24:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 163/171 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 22/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 207/378 variables, 92/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 623/1001 variables, 553/762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1001 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 34/1035 variables, 506/1268 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1035 variables, 34/1302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1035 variables, 0/1302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 495/1530 variables, 484/1786 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1530 variables, 495/2281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1530 variables, 0/2281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 2/1532 variables, 1/2282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1532 variables, 0/2282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1532 variables, 0/2282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1532/1532 variables, and 2282 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1078 ms.
Refiners :[Generalized P Invariants (flows): 1012/1012 constraints, State Equation: 1270/1270 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) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 163/171 variables, 93/95 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 22/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 207/378 variables, 92/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/378 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 623/1001 variables, 553/765 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1001 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 34/1035 variables, 506/1271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1035 variables, 34/1305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1035 variables, 0/1305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 495/1530 variables, 484/1789 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1530 variables, 495/2284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1530 variables, 0/2284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/1532 variables, 1/2285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1532 variables, 0/2285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/1532 variables, 0/2285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1532/1532 variables, and 2285 constraints, problems are : Problem set: 0 solved, 3 unsolved in 892 ms.
Refiners :[Generalized P Invariants (flows): 1012/1012 constraints, State Equation: 1270/1270 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 1981ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 1026 steps, including 26 resets, run visited all 3 properties in 7 ms. (steps per millisecond=146 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 6 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 4 factoid took 188 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 172 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Stuttering acceptance computed with spot in 162 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Stuttering acceptance computed with spot in 169 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Product exploration explored 100000 steps with 20008 reset in 365 ms.
Product exploration explored 100000 steps with 20005 reset in 370 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 187 ms :[(AND p1 p0), (AND p1 p0), (AND p1 p0), (AND p1 p0), p1]
Support contains 2 out of 1270 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1270/1270 places, 262/262 transitions.
Applied a total of 0 rules in 41 ms. Remains 1270 /1270 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-25 20:24:21] [INFO ] Redundant transitions in 23 ms returned []
Running 215 sub problems to find dead transitions.
[2024-05-25 20:24:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1247 variables, 1012/1012 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1247 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 262/1509 variables, 1247/2259 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1509 variables, 0/2259 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 23/1532 variables, 23/2282 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1532 variables, 0/2282 constraints. Problems are: Problem set: 0 solved, 215 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 1532/1532 variables, and 2282 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 1012/1012 constraints, State Equation: 1270/1270 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1247 variables, 1012/1012 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1247 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 262/1509 variables, 1247/2259 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1509 variables, 215/2474 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1509 variables, 0/2474 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 23/1532 variables, 23/2497 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1532/1532 variables, and 2497 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 1012/1012 constraints, State Equation: 1270/1270 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
After SMT, in 60220ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 60223ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60295 ms. Remains : 1270/1270 places, 262/262 transitions.
Built C files in :
/tmp/ltsmin855029481370869052
[2024-05-25 20:25:21] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin855029481370869052
Running compilation step : cd /tmp/ltsmin855029481370869052;'/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 957 ms.
Running link step : cd /tmp/ltsmin855029481370869052;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin855029481370869052;'/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/stateBased10835301083945288428.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 1270 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1270/1270 places, 262/262 transitions.
Applied a total of 0 rules in 34 ms. Remains 1270 /1270 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-25 20:25:36] [INFO ] Invariant cache hit.
[2024-05-25 20:25:38] [INFO ] Implicit Places using invariants in 1301 ms returned []
[2024-05-25 20:25:38] [INFO ] Invariant cache hit.
[2024-05-25 20:25:44] [INFO ] Implicit Places using invariants and state equation in 6720 ms returned []
Implicit Place search using SMT with State Equation took 8024 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-05-25 20:25:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1247 variables, 1012/1012 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1247 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 262/1509 variables, 1247/2259 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1509 variables, 0/2259 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (OVERLAPS) 23/1532 variables, 23/2282 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1532/1532 variables, and 2282 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 1012/1012 constraints, State Equation: 1270/1270 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1247 variables, 1012/1012 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1247 variables, 0/1012 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 262/1509 variables, 1247/2259 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1509 variables, 215/2474 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1509 variables, 0/2474 constraints. Problems are: Problem set: 0 solved, 215 unsolved
SMT process timed out in 60225ms, After SMT, problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 60232ms
Finished structural reductions in LTL mode , in 1 iterations and 68292 ms. Remains : 1270/1270 places, 262/262 transitions.
Built C files in :
/tmp/ltsmin8531744796284400614
[2024-05-25 20:26:45] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8531744796284400614
Running compilation step : cd /tmp/ltsmin8531744796284400614;'/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 982 ms.
Running link step : cd /tmp/ltsmin8531744796284400614;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8531744796284400614;'/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/stateBased18169182266514608130.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-25 20:27:00] [INFO ] Flatten gal took : 34 ms
[2024-05-25 20:27:00] [INFO ] Flatten gal took : 25 ms
[2024-05-25 20:27:00] [INFO ] Time to serialize gal into /tmp/LTL1876913156893839211.gal : 7 ms
[2024-05-25 20:27:00] [INFO ] Time to serialize properties into /tmp/LTL15393237590452733568.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/LTL1876913156893839211.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8981675245922290042.hoa' '-atoms' '/tmp/LTL15393237590452733568.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/LTL15393237590452733568.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8981675245922290042.hoa
Detected timeout of ITS tools.
[2024-05-25 20:27:15] [INFO ] Flatten gal took : 24 ms
[2024-05-25 20:27:15] [INFO ] Flatten gal took : 23 ms
[2024-05-25 20:27:15] [INFO ] Time to serialize gal into /tmp/LTL6149541341749421798.gal : 5 ms
[2024-05-25 20:27:15] [INFO ] Time to serialize properties into /tmp/LTL9181775878857385417.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/LTL6149541341749421798.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9181775878857385417.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(X(G((X("(a2<1)"))||(F("(a3>=1)")))))))
Formula 0 simplified : XXF(X!"(a2<1)" & G!"(a3>=1)")
Detected timeout of ITS tools.
[2024-05-25 20:27:30] [INFO ] Flatten gal took : 23 ms
[2024-05-25 20:27:30] [INFO ] Applying decomposition
[2024-05-25 20:27:30] [INFO ] Flatten gal took : 23 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/graph7162220236916599997.txt' '-o' '/tmp/graph7162220236916599997.bin' '-w' '/tmp/graph7162220236916599997.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7162220236916599997.bin' '-l' '-1' '-v' '-w' '/tmp/graph7162220236916599997.weights' '-q' '0' '-e' '0.001'
[2024-05-25 20:27:30] [INFO ] Decomposing Gal with order
[2024-05-25 20:27:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 20:27:30] [INFO ] Removed a total of 185 redundant transitions.
[2024-05-25 20:27:30] [INFO ] Flatten gal took : 47 ms
[2024-05-25 20:27:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 138 labels/synchronizations in 11 ms.
[2024-05-25 20:27:30] [INFO ] Time to serialize gal into /tmp/LTL12813046838607801404.gal : 8 ms
[2024-05-25 20:27:30] [INFO ] Time to serialize properties into /tmp/LTL4279225258021046027.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/LTL12813046838607801404.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4279225258021046027.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("(i19.u28.a2<1)"))||(F("(i19.u28.a3>=1)")))))))
Formula 0 simplified : XXF(X!"(i19.u28.a2<1)" & G!"(i19.u28.a3>=1)")
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-PT-22-LTLFireability-12 finished in 299592 ms.
[2024-05-25 20:27:45] [INFO ] Flatten gal took : 38 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9451074885596037398
[2024-05-25 20:27:45] [INFO ] Computing symmetric may disable matrix : 356 transitions.
[2024-05-25 20:27:45] [INFO ] Applying decomposition
[2024-05-25 20:27:45] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:27:45] [INFO ] Computing symmetric may enable matrix : 356 transitions.
[2024-05-25 20:27:45] [INFO ] Computation of Complete enable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 20:27:45] [INFO ] Flatten gal took : 40 ms
[2024-05-25 20:27:46] [INFO ] Computing Do-Not-Accords matrix : 356 transitions.
[2024-05-25 20:27:46] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15241198877807946200.txt' '-o' '/tmp/graph15241198877807946200.bin' '-w' '/tmp/graph15241198877807946200.weights'
[2024-05-25 20:27:46] [INFO ] Built C files in 162ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9451074885596037398
Running compilation step : cd /tmp/ltsmin9451074885596037398;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15241198877807946200.bin' '-l' '-1' '-v' '-w' '/tmp/graph15241198877807946200.weights' '-q' '0' '-e' '0.001'
[2024-05-25 20:27:46] [INFO ] Decomposing Gal with order
[2024-05-25 20:27:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 20:27:46] [INFO ] Removed a total of 229 redundant transitions.
[2024-05-25 20:27:46] [INFO ] Flatten gal took : 179 ms
[2024-05-25 20:27:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 34 ms.
[2024-05-25 20:27:46] [INFO ] Time to serialize gal into /tmp/LTLFireability4830028629623926721.gal : 29 ms
[2024-05-25 20:27:46] [INFO ] Time to serialize properties into /tmp/LTLFireability2275107068245821422.ltl : 38 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/LTLFireability4830028629623926721.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2275107068245821422.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X("(i25.i1.u70.a2<1)"))||(F("(i25.i1.u70.a3>=1)")))))))
Formula 0 simplified : XXF(X!"(i25.i1.u70.a2<1)" & G!"(i25.i1.u70.a3>=1)")
Compilation finished in 1804 ms.
Running link step : cd /tmp/ltsmin9451074885596037398;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin9451074885596037398;'/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(!(LTLAPp0==true))||<>(!(LTLAPp1==true))))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2024-05-25 20:42:26] [INFO ] Flatten gal took : 113 ms
[2024-05-25 20:42:26] [INFO ] Time to serialize gal into /tmp/LTLFireability11997061651640908904.gal : 5 ms
[2024-05-25 20:42:26] [INFO ] Time to serialize properties into /tmp/LTLFireability16548943069604799239.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/LTLFireability11997061651640908904.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16548943069604799239.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...299
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X("(a2<1)"))||(F("(a3>=1)")))))))
Formula 0 simplified : XXF(X!"(a2<1)" & G!"(a3>=1)")
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.040: LTL layer: formula: X(X([]((X(!(LTLAPp0==true))||<>(!(LTLAPp1==true))))))
pins2lts-mc-linux64( 3/ 8), 0.040: "X(X([]((X(!(LTLAPp0==true))||<>(!(LTLAPp1==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.041: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.041: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.041: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.057: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.071: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.150: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.159: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.467: DFS-FIFO for weak LTL, using special progress label 359
pins2lts-mc-linux64( 0/ 8), 0.467: There are 360 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.467: State length is 1917, there are 362 groups
pins2lts-mc-linux64( 0/ 8), 0.467: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.467: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.467: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.467: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 1.363: ~1 levels ~960 states ~20896 transitions
pins2lts-mc-linux64( 6/ 8), 1.512: ~1 levels ~1920 states ~40096 transitions
pins2lts-mc-linux64( 6/ 8), 1.773: ~1 levels ~3840 states ~93280 transitions
pins2lts-mc-linux64( 6/ 8), 2.157: ~1 levels ~7680 states ~185520 transitions
pins2lts-mc-linux64( 7/ 8), 3.051: ~1 levels ~15360 states ~372800 transitions
pins2lts-mc-linux64( 7/ 8), 4.260: ~1 levels ~30720 states ~767808 transitions
pins2lts-mc-linux64( 4/ 8), 6.417: ~1 levels ~61440 states ~1568080 transitions
pins2lts-mc-linux64( 6/ 8), 10.505: ~1 levels ~122880 states ~3207568 transitions
pins2lts-mc-linux64( 7/ 8), 18.964: ~1 levels ~245760 states ~7122480 transitions
pins2lts-mc-linux64( 5/ 8), 36.506: ~1 levels ~491520 states ~15403176 transitions
pins2lts-mc-linux64( 7/ 8), 71.924: ~1 levels ~983040 states ~31705984 transitions
pins2lts-mc-linux64( 7/ 8), 140.725: ~1 levels ~1966080 states ~64543456 transitions
pins2lts-mc-linux64( 7/ 8), 286.138: ~1 levels ~3932160 states ~133107008 transitions
pins2lts-mc-linux64( 7/ 8), 568.583: ~1 levels ~7864320 states ~265453472 transitions
pins2lts-mc-linux64( 7/ 8), 1164.871: ~1 levels ~15728640 states ~536043232 transitions
pins2lts-mc-linux64( 7/ 8), 1212.971: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1213.188:
pins2lts-mc-linux64( 0/ 8), 1213.188: mean standard work distribution: 5.1% (states) 4.4% (transitions)
pins2lts-mc-linux64( 0/ 8), 1213.188:
pins2lts-mc-linux64( 0/ 8), 1213.188: Explored 15231663 states 564060432 transitions, fanout: 37.032
pins2lts-mc-linux64( 0/ 8), 1213.188: Total exploration time 1212.710 sec (1212.440 sec minimum, 1212.561 sec on average)
pins2lts-mc-linux64( 0/ 8), 1213.188: States per second: 12560, Transitions per second: 465124
pins2lts-mc-linux64( 0/ 8), 1213.188:
pins2lts-mc-linux64( 0/ 8), 1213.188: Progress states detected: 115682937
pins2lts-mc-linux64( 0/ 8), 1213.188: Redundant explorations: -86.8333
pins2lts-mc-linux64( 0/ 8), 1213.188:
pins2lts-mc-linux64( 0/ 8), 1213.188: Queue width: 8B, total height: 135525256, memory: 1033.98MB
pins2lts-mc-linux64( 0/ 8), 1213.188: Tree memory: 1138.6MB, 10.3 B/state, compr.: 0.1%
pins2lts-mc-linux64( 0/ 8), 1213.188: Tree fill ratio (roots/leafs): 86.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1213.188: Stored 359 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1213.188: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1213.188: Est. total memory use: 2172.6MB (~2058.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9451074885596037398;'/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(!(LTLAPp0==true))||<>(!(LTLAPp1==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin9451074885596037398;'/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(!(LTLAPp0==true))||<>(!(LTLAPp1==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:840)
ITS-tools command line returned an error code 137
[2024-05-25 20:56:51] [INFO ] Flatten gal took : 37 ms
[2024-05-25 20:56:51] [INFO ] Input system was already deterministic with 356 transitions.
[2024-05-25 20:56:51] [INFO ] Transformed 1916 places.
[2024-05-25 20:56:51] [INFO ] Transformed 356 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-25 20:56:51] [INFO ] Time to serialize gal into /tmp/LTLFireability14465593642111016830.gal : 4 ms
[2024-05-25 20:56:51] [INFO ] Time to serialize properties into /tmp/LTLFireability3603737848599298294.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/LTLFireability14465593642111016830.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3603737848599298294.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(G((X("(a2<1)"))||(F("(a3>=1)")))))))
Formula 0 simplified : XXF(X!"(a2<1)" & G!"(a3>=1)")
ITS-tools command line returned an error code 137
Total runtime 3467318 ms.
BK_STOP 1716671418071
--------------------
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="QuasiCertifProtocol-PT-22"
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 QuasiCertifProtocol-PT-22, 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 r312-tall-171662337800092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-22.tgz
mv QuasiCertifProtocol-PT-22 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;