Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 16:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 11 16:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-c128-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716448932222

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c128
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 07:22:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 07:22:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 07:22:13] [INFO ] Load time of PNML (sax parser for PT used): 402 ms
[2024-05-23 07:22:13] [INFO ] Transformed 2826 places.
[2024-05-23 07:22:13] [INFO ] Transformed 8960 transitions.
[2024-05-23 07:22:13] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 550 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1198 places in 41 ms
Reduce places removed 1198 places and 2998 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-c128-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c128-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 294 places :
Symmetric choice reduction at 1 with 294 rule applications. Total rules 311 place count 1317 transition count 3776
Iterating global reduction 1 with 294 rules applied. Total rules applied 605 place count 1317 transition count 3776
Ensure Unique test removed 420 transitions
Reduce isomorphic transitions removed 420 transitions.
Iterating post reduction 1 with 420 rules applied. Total rules applied 1025 place count 1317 transition count 3356
Discarding 151 places :
Symmetric choice reduction at 2 with 151 rule applications. Total rules 1176 place count 1166 transition count 3054
Iterating global reduction 2 with 151 rules applied. Total rules applied 1327 place count 1166 transition count 3054
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 2 with 92 rules applied. Total rules applied 1419 place count 1166 transition count 2962
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1433 place count 1152 transition count 2934
Iterating global reduction 3 with 14 rules applied. Total rules applied 1447 place count 1152 transition count 2934
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1461 place count 1138 transition count 2906
Iterating global reduction 3 with 14 rules applied. Total rules applied 1475 place count 1138 transition count 2906
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1489 place count 1124 transition count 2878
Iterating global reduction 3 with 14 rules applied. Total rules applied 1503 place count 1124 transition count 2878
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1517 place count 1110 transition count 2850
Iterating global reduction 3 with 14 rules applied. Total rules applied 1531 place count 1110 transition count 2850
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1544 place count 1097 transition count 2824
Iterating global reduction 3 with 13 rules applied. Total rules applied 1557 place count 1097 transition count 2824
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1570 place count 1084 transition count 2798
Iterating global reduction 3 with 13 rules applied. Total rules applied 1583 place count 1084 transition count 2798
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1596 place count 1071 transition count 2772
Iterating global reduction 3 with 13 rules applied. Total rules applied 1609 place count 1071 transition count 2772
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 1664 place count 1016 transition count 2564
Iterating global reduction 3 with 55 rules applied. Total rules applied 1719 place count 1016 transition count 2564
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 1774 place count 961 transition count 2344
Iterating global reduction 3 with 55 rules applied. Total rules applied 1829 place count 961 transition count 2344
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 1884 place count 906 transition count 2222
Iterating global reduction 3 with 55 rules applied. Total rules applied 1939 place count 906 transition count 2222
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 1994 place count 851 transition count 2112
Iterating global reduction 3 with 55 rules applied. Total rules applied 2049 place count 851 transition count 2112
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 2104 place count 796 transition count 2002
Iterating global reduction 3 with 55 rules applied. Total rules applied 2159 place count 796 transition count 2002
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 2214 place count 741 transition count 1892
Iterating global reduction 3 with 55 rules applied. Total rules applied 2269 place count 741 transition count 1892
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 2321 place count 689 transition count 1788
Iterating global reduction 3 with 52 rules applied. Total rules applied 2373 place count 689 transition count 1788
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 2379 place count 683 transition count 1776
Iterating global reduction 3 with 6 rules applied. Total rules applied 2385 place count 683 transition count 1776
Applied a total of 2385 rules in 1199 ms. Remains 683 /1628 variables (removed 945) and now considering 1776/5962 (removed 4186) transitions.
[2024-05-23 07:22:15] [INFO ] Flow matrix only has 1191 transitions (discarded 585 similar events)
// Phase 1: matrix 1191 rows 683 cols
[2024-05-23 07:22:15] [INFO ] Computed 2 invariants in 33 ms
[2024-05-23 07:22:16] [INFO ] Implicit Places using invariants in 567 ms returned []
[2024-05-23 07:22:16] [INFO ] Flow matrix only has 1191 transitions (discarded 585 similar events)
[2024-05-23 07:22:16] [INFO ] Invariant cache hit.
[2024-05-23 07:22:16] [INFO ] State equation strengthened by 292 read => feed constraints.
[2024-05-23 07:22:17] [INFO ] Implicit Places using invariants and state equation in 1664 ms returned []
Implicit Place search using SMT with State Equation took 2333 ms to find 0 implicit places.
Running 1774 sub problems to find dead transitions.
[2024-05-23 07:22:17] [INFO ] Flow matrix only has 1191 transitions (discarded 585 similar events)
[2024-05-23 07:22:17] [INFO ] Invariant cache hit.
[2024-05-23 07:22:17] [INFO ] State equation strengthened by 292 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/683 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1774 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/683 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1774 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 19.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 1.0)
(s64 0.0)
(s65 1.0)
(s66 1.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 1.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 1.0)
(s87 0.0)
(s88 1.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 1.0)
(s117 1.0)
(s118 0.0)
(s119 1.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 1.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 1.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 1.0)
(s180 0.0)
(s181 0.0)
(s182 1.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 1.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 0.0)
(s399 0.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 0.0)
(s404 1.0)
(s405 1.0)
(s406 0.0)
(s407 0.0)
(s408 1.0)
(s409 1.0)
(s410 0.0)
(s411 0.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 0.0)
(s419 0.0)
(s420 1.0)
(s421 0.0)
(s422 1.0)
(s423 1.0)
(s424 0.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 0.0)
(s430 1.0)
(s431 1.0)
(s432 0.0)
(s433 0.0)
(s434 1.0)
(s435 0.0)
(s436 1.0)
(s437 1.0)
(s438 0.0)
(s439 1.0)
(s440 0.0)
(s441 1.0)
(s442 0.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 0.0)
(s450 1.0)
(s451 0.0)
(s452 1.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 1.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 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 0.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 0.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 1.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 1.0)
(s656 0.0)
(s657 0.0)
(s658 1.0)
(s659 0.0)
(s660 1.0)
(s661 1.0)
(s662 0.0)
(s663 0.0)
(s664 1.0)
(s665 0.0)
timeout
(s666 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 683/1874 variables, and 2 constraints, problems are : Problem set: 0 solved, 1774 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/683 constraints, ReadFeed: 0/292 constraints, PredecessorRefiner: 1774/1774 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1774 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/683 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1774 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/683 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1774 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/683 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1774 unsolved
At refinement iteration 3 (OVERLAPS) 1191/1874 variables, 683/685 constraints. Problems are: Problem set: 0 solved, 1774 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1874 variables, 292/977 constraints. Problems are: Problem set: 0 solved, 1774 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1874/1874 variables, and 2751 constraints, problems are : Problem set: 0 solved, 1774 unsolved in 31296 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 683/683 constraints, ReadFeed: 292/292 constraints, PredecessorRefiner: 1774/1774 constraints, Known Traps: 0/0 constraints]
After SMT, in 69474ms problems are : Problem set: 0 solved, 1774 unsolved
Search for dead transitions found 0 dead transitions in 69508ms
Starting structural reductions in LTL mode, iteration 1 : 683/1628 places, 1776/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 73067 ms. Remains : 683/1628 places, 1776/5962 transitions.
Support contains 20 out of 683 places after structural reductions.
[2024-05-23 07:23:27] [INFO ] Flatten gal took : 166 ms
[2024-05-23 07:23:27] [INFO ] Flatten gal took : 96 ms
[2024-05-23 07:23:27] [INFO ] Input system was already deterministic with 1776 transitions.
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 40051 steps (8 resets) in 1709 ms. (23 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 13/13 properties
[2024-05-23 07:23:28] [INFO ] Flow matrix only has 1191 transitions (discarded 585 similar events)
[2024-05-23 07:23:28] [INFO ] Invariant cache hit.
[2024-05-23 07:23:28] [INFO ] State equation strengthened by 292 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 381/396 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 915/1311 variables, 396/397 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1311 variables, 216/613 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1311 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 13 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 449/1760 variables, 193/806 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1760 variables, 1/807 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1760 variables, 76/883 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1760 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 112/1872 variables, 92/975 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1872 variables, 0/975 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 2/1874 variables, 2/977 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1874 variables, 0/977 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 0/1874 variables, 0/977 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1874/1874 variables, and 977 constraints, problems are : Problem set: 0 solved, 13 unsolved in 2332 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 683/683 constraints, ReadFeed: 292/292 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 381/396 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 915/1311 variables, 396/397 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1311 variables, 216/613 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1311 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 449/1760 variables, 193/806 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1760 variables, 1/807 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1760 variables, 76/883 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1760 variables, 13/896 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-23 07:23:32] [INFO ] Deduced a trap composed of 131 places in 97 ms of which 13 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1760 variables, 1/897 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1760 variables, 0/897 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 112/1872 variables, 92/989 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1872 variables, 0/989 constraints. Problems are: Problem set: 0 solved, 13 unsolved
SMT process timed out in 7441ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 683/683 places, 1776/1776 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 681 transition count 1772
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 681 transition count 1772
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 681 transition count 1770
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 679 transition count 1766
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 679 transition count 1766
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 12 place count 677 transition count 1760
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 677 transition count 1760
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 675 transition count 1754
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 675 transition count 1754
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 673 transition count 1750
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 673 transition count 1750
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 671 transition count 1744
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 671 transition count 1744
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 669 transition count 1738
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 669 transition count 1738
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 667 transition count 1734
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 667 transition count 1734
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 665 transition count 1730
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 665 transition count 1730
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 664 transition count 1728
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 664 transition count 1728
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 41 place count 663 transition count 1726
Iterating global reduction 1 with 1 rules applied. Total rules applied 42 place count 663 transition count 1726
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 43 place count 662 transition count 1724
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 662 transition count 1724
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 1 with 14 rules applied. Total rules applied 58 place count 662 transition count 1710
Applied a total of 58 rules in 577 ms. Remains 662 /683 variables (removed 21) and now considering 1710/1776 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 578 ms. Remains : 662/683 places, 1710/1776 transitions.
RANDOM walk for 40043 steps (8 resets) in 148 ms. (268 steps per ms) remains 10/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 65 ms. (606 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 10/10 properties
[2024-05-23 07:23:36] [INFO ] Flow matrix only has 1150 transitions (discarded 560 similar events)
// Phase 1: matrix 1150 rows 662 cols
[2024-05-23 07:23:36] [INFO ] Computed 2 invariants in 9 ms
[2024-05-23 07:23:36] [INFO ] State equation strengthened by 286 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 382/394 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 900/1294 variables, 394/395 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1294 variables, 212/607 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1294 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 418/1712 variables, 182/789 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1712 variables, 1/790 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1712 variables, 74/864 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1712 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 97/1809 variables, 83/947 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1809 variables, 0/947 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 3/1812 variables, 3/950 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1812 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/1812 variables, 0/950 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1812/1812 variables, and 950 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1818 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 662/662 constraints, ReadFeed: 286/286 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 382/394 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 900/1294 variables, 394/395 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1294 variables, 212/607 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1294 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 418/1712 variables, 182/789 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1712 variables, 1/790 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1712 variables, 74/864 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1712 variables, 10/874 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-23 07:23:39] [INFO ] Deduced a trap composed of 131 places in 82 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1712 variables, 1/875 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1712 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 97/1809 variables, 83/958 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1809 variables, 0/958 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 3/1812 variables, 3/961 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1812 variables, 0/961 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 0/1812 variables, 0/961 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1812/1812 variables, and 961 constraints, problems are : Problem set: 0 solved, 10 unsolved in 4431 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 662/662 constraints, ReadFeed: 286/286 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints]
After SMT, in 6330ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 9 properties in 15517 ms.
Support contains 2 out of 662 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 662/662 places, 1710/1710 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 654 transition count 1694
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 654 transition count 1694
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 649 transition count 1684
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 649 transition count 1684
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 644 transition count 1664
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 644 transition count 1664
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 639 transition count 1654
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 639 transition count 1654
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 634 transition count 1644
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 634 transition count 1644
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 61 place count 629 transition count 1634
Iterating global reduction 0 with 5 rules applied. Total rules applied 66 place count 629 transition count 1634
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 71 place count 624 transition count 1624
Iterating global reduction 0 with 5 rules applied. Total rules applied 76 place count 624 transition count 1624
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 81 place count 619 transition count 1614
Iterating global reduction 0 with 5 rules applied. Total rules applied 86 place count 619 transition count 1614
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 91 place count 614 transition count 1604
Iterating global reduction 0 with 5 rules applied. Total rules applied 96 place count 614 transition count 1604
Applied a total of 96 rules in 193 ms. Remains 614 /662 variables (removed 48) and now considering 1604/1710 (removed 106) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 614/662 places, 1604/1710 transitions.
RANDOM walk for 40014 steps (8 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 502765 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :0 out of 1
Probabilistic random walk after 502765 steps, saw 326328 distinct states, run finished after 3004 ms. (steps per millisecond=167 ) properties seen :0
[2024-05-23 07:24:01] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-23 07:24:01] [INFO ] Computed 2 invariants in 10 ms
[2024-05-23 07:24:01] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 0/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/1537 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1537 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1538 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 139/1677 variables, 135/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1677 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/1682 variables, 3/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1682 variables, 0/879 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/1685 variables, 2/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1685 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1685/1685 variables, and 881 constraints, problems are : Problem set: 0 solved, 1 unsolved in 499 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 334/336 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1139/1475 variables, 471/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1475 variables, 265/738 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1475 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1475 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 62/1537 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1537 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1538 variables, 1/741 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1538 variables, 1/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1538 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 139/1677 variables, 135/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1677 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/1682 variables, 3/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1682 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/1685 variables, 2/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1685 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1685 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 882 constraints, problems are : Problem set: 0 solved, 1 unsolved in 782 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1317ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 400 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 72 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 614/614 places, 1604/1604 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 72 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-23 07:24:03] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 07:24:03] [INFO ] Invariant cache hit.
[2024-05-23 07:24:04] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-05-23 07:24:04] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 07:24:04] [INFO ] Invariant cache hit.
[2024-05-23 07:24:04] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 07:24:05] [INFO ] Implicit Places using invariants and state equation in 1761 ms returned []
Implicit Place search using SMT with State Equation took 2094 ms to find 0 implicit places.
[2024-05-23 07:24:05] [INFO ] Redundant transitions in 85 ms returned []
Running 1602 sub problems to find dead transitions.
[2024-05-23 07:24:05] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 07:24:05] [INFO ] Invariant cache hit.
[2024-05-23 07:24:05] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
SMT process timed out in 36683ms, After SMT, problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 36698ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38963 ms. Remains : 614/614 places, 1604/1604 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 944 edges and 614 vertex of which 192 / 614 are part of one of the 64 SCC in 6 ms
Free SCC test removed 128 places
Drop transitions (Empty/Sink Transition effects.) removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 486 transition count 869
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 476 transition count 869
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 21 place count 476 transition count 796
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 167 place count 403 transition count 796
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 230 place count 340 transition count 733
Iterating global reduction 2 with 63 rules applied. Total rules applied 293 place count 340 transition count 733
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 419 place count 340 transition count 607
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 673 place count 213 transition count 480
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 737 place count 149 transition count 352
Iterating global reduction 3 with 64 rules applied. Total rules applied 801 place count 149 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 802 place count 149 transition count 351
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 865 place count 86 transition count 225
Iterating global reduction 4 with 63 rules applied. Total rules applied 928 place count 86 transition count 225
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 991 place count 23 transition count 99
Iterating global reduction 4 with 63 rules applied. Total rules applied 1054 place count 23 transition count 99
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1117 place count 23 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1117 place count 23 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1119 place count 22 transition count 35
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 5 with 2 rules applied. Total rules applied 1121 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1123 place count 20 transition count 34
Applied a total of 1123 rules in 93 ms. Remains 20 /614 variables (removed 594) and now considering 34/1604 (removed 1570) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 34 rows 20 cols
[2024-05-23 07:24:42] [INFO ] Computed 2 invariants in 2 ms
[2024-05-23 07:24:42] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 07:24:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-23 07:24:42] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 07:24:42] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 07:24:42] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 07:24:42] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 07:24:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-23 07:24:42] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-23 07:24:42] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 07:24:42] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 07:24:42] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 07:24:42] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 199 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 1776/1776 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 673 transition count 1756
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 673 transition count 1756
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 673 transition count 1754
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 666 transition count 1740
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 666 transition count 1740
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 659 transition count 1714
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 659 transition count 1714
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 652 transition count 1688
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 652 transition count 1688
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 71 place count 645 transition count 1674
Iterating global reduction 1 with 7 rules applied. Total rules applied 78 place count 645 transition count 1674
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 85 place count 638 transition count 1658
Iterating global reduction 1 with 7 rules applied. Total rules applied 92 place count 638 transition count 1658
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 99 place count 631 transition count 1642
Iterating global reduction 1 with 7 rules applied. Total rules applied 106 place count 631 transition count 1642
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 113 place count 624 transition count 1628
Iterating global reduction 1 with 7 rules applied. Total rules applied 120 place count 624 transition count 1628
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 127 place count 617 transition count 1614
Iterating global reduction 1 with 7 rules applied. Total rules applied 134 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 614 transition count 1608
Applied a total of 140 rules in 159 ms. Remains 614 /683 variables (removed 69) and now considering 1608/1776 (removed 168) transitions.
[2024-05-23 07:24:43] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-23 07:24:43] [INFO ] Computed 2 invariants in 9 ms
[2024-05-23 07:24:43] [INFO ] Implicit Places using invariants in 326 ms returned []
[2024-05-23 07:24:43] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 07:24:43] [INFO ] Invariant cache hit.
[2024-05-23 07:24:43] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 07:24:45] [INFO ] Implicit Places using invariants and state equation in 1803 ms returned []
Implicit Place search using SMT with State Equation took 2131 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2024-05-23 07:24:45] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 07:24:45] [INFO ] Invariant cache hit.
[2024-05-23 07:24:45] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 3 (OVERLAPS) 1073/1687 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
SMT process timed out in 36758ms, After SMT, problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 36774ms
Starting structural reductions in LTL mode, iteration 1 : 614/683 places, 1608/1776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39070 ms. Remains : 614/683 places, 1608/1776 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FunctionPointer-PT-c128-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-c128-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLFireability-00 finished in 39320 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 683/683 places, 1776/1776 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 673 transition count 1756
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 673 transition count 1756
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 673 transition count 1754
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 666 transition count 1740
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 666 transition count 1740
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 659 transition count 1714
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 659 transition count 1714
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 652 transition count 1688
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 652 transition count 1688
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 71 place count 645 transition count 1674
Iterating global reduction 1 with 7 rules applied. Total rules applied 78 place count 645 transition count 1674
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 85 place count 638 transition count 1658
Iterating global reduction 1 with 7 rules applied. Total rules applied 92 place count 638 transition count 1658
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 99 place count 631 transition count 1642
Iterating global reduction 1 with 7 rules applied. Total rules applied 106 place count 631 transition count 1642
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 113 place count 624 transition count 1628
Iterating global reduction 1 with 7 rules applied. Total rules applied 120 place count 624 transition count 1628
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 127 place count 617 transition count 1614
Iterating global reduction 1 with 7 rules applied. Total rules applied 134 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 614 transition count 1608
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 144 place count 614 transition count 1604
Applied a total of 144 rules in 479 ms. Remains 614 /683 variables (removed 69) and now considering 1604/1776 (removed 172) transitions.
[2024-05-23 07:25:22] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-23 07:25:22] [INFO ] Computed 2 invariants in 15 ms
[2024-05-23 07:25:23] [INFO ] Implicit Places using invariants in 342 ms returned []
[2024-05-23 07:25:23] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 07:25:23] [INFO ] Invariant cache hit.
[2024-05-23 07:25:23] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 07:25:26] [INFO ] Implicit Places using invariants and state equation in 3074 ms returned []
Implicit Place search using SMT with State Equation took 3419 ms to find 0 implicit places.
[2024-05-23 07:25:26] [INFO ] Redundant transitions in 88 ms returned []
Running 1602 sub problems to find dead transitions.
[2024-05-23 07:25:26] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 07:25:26] [INFO ] Invariant cache hit.
[2024-05-23 07:25:26] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1685 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
SMT process timed out in 36783ms, After SMT, problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 36798ms
Starting structural reductions in SI_LTL mode, iteration 1 : 614/683 places, 1604/1776 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40796 ms. Remains : 614/683 places, 1604/1776 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c128-LTLFireability-01
Stuttering criterion allowed to conclude after 133 steps with 0 reset in 7 ms.
FORMULA FunctionPointer-PT-c128-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLFireability-01 finished in 40875 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 1776/1776 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 673 transition count 1756
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 673 transition count 1756
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 673 transition count 1754
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 666 transition count 1740
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 666 transition count 1740
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 659 transition count 1714
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 659 transition count 1714
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 652 transition count 1688
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 652 transition count 1688
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 71 place count 645 transition count 1674
Iterating global reduction 1 with 7 rules applied. Total rules applied 78 place count 645 transition count 1674
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 85 place count 638 transition count 1658
Iterating global reduction 1 with 7 rules applied. Total rules applied 92 place count 638 transition count 1658
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 99 place count 631 transition count 1642
Iterating global reduction 1 with 7 rules applied. Total rules applied 106 place count 631 transition count 1642
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 113 place count 624 transition count 1628
Iterating global reduction 1 with 7 rules applied. Total rules applied 120 place count 624 transition count 1628
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 127 place count 617 transition count 1614
Iterating global reduction 1 with 7 rules applied. Total rules applied 134 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 614 transition count 1608
Applied a total of 140 rules in 149 ms. Remains 614 /683 variables (removed 69) and now considering 1608/1776 (removed 168) transitions.
[2024-05-23 07:26:03] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
// Phase 1: matrix 1073 rows 614 cols
[2024-05-23 07:26:03] [INFO ] Computed 2 invariants in 5 ms
[2024-05-23 07:26:03] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-23 07:26:03] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 07:26:03] [INFO ] Invariant cache hit.
[2024-05-23 07:26:04] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 07:26:05] [INFO ] Implicit Places using invariants and state equation in 1806 ms returned []
Implicit Place search using SMT with State Equation took 2127 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2024-05-23 07:26:05] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2024-05-23 07:26:05] [INFO ] Invariant cache hit.
[2024-05-23 07:26:05] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
SMT process timed out in 36803ms, After SMT, problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 36816ms
Starting structural reductions in LTL mode, iteration 1 : 614/683 places, 1608/1776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39095 ms. Remains : 614/683 places, 1608/1776 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c128-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1858 steps with 12 reset in 21 ms.
FORMULA FunctionPointer-PT-c128-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLFireability-02 finished in 39220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1)||G(!p1))))'
Support contains 3 out of 683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 683/683 places, 1776/1776 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 673 transition count 1756
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 673 transition count 1756
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 673 transition count 1754
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 30 place count 665 transition count 1738
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 665 transition count 1738
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 46 place count 657 transition count 1708
Iterating global reduction 1 with 8 rules applied. Total rules applied 54 place count 657 transition count 1708
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 649 transition count 1678
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 649 transition count 1678
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 641 transition count 1662
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 641 transition count 1662
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 94 place count 633 transition count 1644
Iterating global reduction 1 with 8 rules applied. Total rules applied 102 place count 633 transition count 1644
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 110 place count 625 transition count 1626
Iterating global reduction 1 with 8 rules applied. Total rules applied 118 place count 625 transition count 1626
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 126 place count 617 transition count 1610
Iterating global reduction 1 with 8 rules applied. Total rules applied 134 place count 617 transition count 1610
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 142 place count 609 transition count 1594
Iterating global reduction 1 with 8 rules applied. Total rules applied 150 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 151 place count 608 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 152 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 153 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 154 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 155 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 156 place count 606 transition count 1588
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 158 place count 606 transition count 1586
Applied a total of 158 rules in 322 ms. Remains 606 /683 variables (removed 77) and now considering 1586/1776 (removed 190) transitions.
[2024-05-23 07:26:42] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
// Phase 1: matrix 1060 rows 606 cols
[2024-05-23 07:26:42] [INFO ] Computed 2 invariants in 15 ms
[2024-05-23 07:26:43] [INFO ] Implicit Places using invariants in 343 ms returned []
[2024-05-23 07:26:43] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2024-05-23 07:26:43] [INFO ] Invariant cache hit.
[2024-05-23 07:26:43] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-23 07:26:44] [INFO ] Implicit Places using invariants and state equation in 1460 ms returned []
Implicit Place search using SMT with State Equation took 1804 ms to find 0 implicit places.
[2024-05-23 07:26:44] [INFO ] Redundant transitions in 22 ms returned []
Running 1584 sub problems to find dead transitions.
[2024-05-23 07:26:44] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2024-05-23 07:26:44] [INFO ] Invariant cache hit.
[2024-05-23 07:26:44] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/606 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 3 (OVERLAPS) 1060/1666 variables, 606/608 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
SMT process timed out in 36713ms, After SMT, problems are : Problem set: 0 solved, 1584 unsolved
Search for dead transitions found 0 dead transitions in 36727ms
Starting structural reductions in SI_LTL mode, iteration 1 : 606/683 places, 1586/1776 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38887 ms. Remains : 606/683 places, 1586/1776 transitions.
Stuttering acceptance computed with spot in 44 ms :[false]
Running random walk in product with property : FunctionPointer-PT-c128-LTLFireability-05
Product exploration explored 100000 steps with 742 reset in 673 ms.
Product exploration explored 100000 steps with 746 reset in 718 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[false]
RANDOM walk for 40088 steps (8 resets) in 207 ms. (192 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 233219 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 4
Probabilistic random walk after 233219 steps, saw 151391 distinct states, run finished after 3001 ms. (steps per millisecond=77 ) properties seen :0
[2024-05-23 07:27:26] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2024-05-23 07:27:26] [INFO ] Invariant cache hit.
[2024-05-23 07:27:26] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 383/386 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 779/1165 variables, 386/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1165 variables, 67/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1165 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 415/1580 variables, 144/598 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1580 variables, 197/795 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1580 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/1581 variables, 1/796 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1581 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1581 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 71/1652 variables, 67/864 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1652 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 8/1660 variables, 4/868 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1660 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 6/1666 variables, 4/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1666 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/1666 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1666/1666 variables, and 872 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1001 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 606/606 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 383/386 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 779/1165 variables, 386/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1165 variables, 67/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1165 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 415/1580 variables, 144/598 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1580 variables, 197/795 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1580 variables, 4/799 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1580 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/1581 variables, 1/800 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1581 variables, 1/801 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1581 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 71/1652 variables, 67/868 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1652 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 8/1660 variables, 4/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1660 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 6/1666 variables, 4/876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1666 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1666 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1666/1666 variables, and 876 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2256 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 606/606 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 3325ms problems are : Problem set: 0 solved, 4 unsolved
Finished Parikh walk after 48487 steps, including 66 resets, run visited all 4 properties in 397 ms. (steps per millisecond=122 )
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 2 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 404 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p1) p0))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0)]
Knowledge based reduction with 9 factoid took 219 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[false]
Stuttering acceptance computed with spot in 38 ms :[false]
Support contains 3 out of 606 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 606/606 places, 1586/1586 transitions.
Applied a total of 0 rules in 69 ms. Remains 606 /606 variables (removed 0) and now considering 1586/1586 (removed 0) transitions.
[2024-05-23 07:27:30] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2024-05-23 07:27:30] [INFO ] Invariant cache hit.
[2024-05-23 07:27:30] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-23 07:27:30] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2024-05-23 07:27:30] [INFO ] Invariant cache hit.
[2024-05-23 07:27:31] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-23 07:27:32] [INFO ] Implicit Places using invariants and state equation in 1430 ms returned []
Implicit Place search using SMT with State Equation took 1764 ms to find 0 implicit places.
[2024-05-23 07:27:32] [INFO ] Redundant transitions in 26 ms returned []
Running 1584 sub problems to find dead transitions.
[2024-05-23 07:27:32] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2024-05-23 07:27:32] [INFO ] Invariant cache hit.
[2024-05-23 07:27:32] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/606 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1060/1666 variables, 606/608 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
SMT process timed out in 36664ms, After SMT, problems are : Problem set: 0 solved, 1584 unsolved
Search for dead transitions found 0 dead transitions in 36678ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38548 ms. Remains : 606/606 places, 1586/1586 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[false]
RANDOM walk for 40061 steps (8 resets) in 198 ms. (201 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 59 ms. (666 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 206754 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 4
Probabilistic random walk after 206754 steps, saw 134213 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
[2024-05-23 07:28:12] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2024-05-23 07:28:12] [INFO ] Invariant cache hit.
[2024-05-23 07:28:12] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 383/386 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 779/1165 variables, 386/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1165 variables, 67/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1165 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 415/1580 variables, 144/598 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1580 variables, 197/795 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1580 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/1581 variables, 1/796 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1581 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1581 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 71/1652 variables, 67/864 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1652 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 8/1660 variables, 4/868 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1660 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 6/1666 variables, 4/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1666 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/1666 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1666/1666 variables, and 872 constraints, problems are : Problem set: 0 solved, 4 unsolved in 950 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 606/606 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 383/386 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 779/1165 variables, 386/387 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1165 variables, 67/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1165 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 415/1580 variables, 144/598 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1580 variables, 197/795 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1580 variables, 4/799 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1580 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/1581 variables, 1/800 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1581 variables, 1/801 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1581 variables, 0/801 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 71/1652 variables, 67/868 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1652 variables, 0/868 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 8/1660 variables, 4/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1660 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 6/1666 variables, 4/876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1666 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1666 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1666/1666 variables, and 876 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2141 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 606/606 constraints, ReadFeed: 264/264 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 3122ms problems are : Problem set: 0 solved, 4 unsolved
Finished Parikh walk after 43320 steps, including 57 resets, run visited all 4 properties in 516 ms. (steps per millisecond=83 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
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 4 properties in 518 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR (NOT p1) p0))), (F (NOT (AND (NOT p1) (NOT p0)))), (F p0)]
Knowledge based reduction with 9 factoid took 198 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[false]
Stuttering acceptance computed with spot in 24 ms :[false]
Stuttering acceptance computed with spot in 24 ms :[false]
Product exploration explored 100000 steps with 775 reset in 510 ms.
Product exploration explored 100000 steps with 752 reset in 518 ms.
Support contains 3 out of 606 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 606/606 places, 1586/1586 transitions.
Applied a total of 0 rules in 68 ms. Remains 606 /606 variables (removed 0) and now considering 1586/1586 (removed 0) transitions.
[2024-05-23 07:28:17] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2024-05-23 07:28:17] [INFO ] Invariant cache hit.
[2024-05-23 07:28:17] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-05-23 07:28:17] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2024-05-23 07:28:17] [INFO ] Invariant cache hit.
[2024-05-23 07:28:17] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-23 07:28:19] [INFO ] Implicit Places using invariants and state equation in 1402 ms returned []
Implicit Place search using SMT with State Equation took 1707 ms to find 0 implicit places.
[2024-05-23 07:28:19] [INFO ] Redundant transitions in 27 ms returned []
Running 1584 sub problems to find dead transitions.
[2024-05-23 07:28:19] [INFO ] Flow matrix only has 1060 transitions (discarded 526 similar events)
[2024-05-23 07:28:19] [INFO ] Invariant cache hit.
[2024-05-23 07:28:19] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/606 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 3 (OVERLAPS) 1060/1666 variables, 606/608 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
SMT process timed out in 36642ms, After SMT, problems are : Problem set: 0 solved, 1584 unsolved
Search for dead transitions found 0 dead transitions in 36655ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38471 ms. Remains : 606/606 places, 1586/1586 transitions.
Treatment of property FunctionPointer-PT-c128-LTLFireability-05 finished in 133341 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||X(X(p1))))))'
Support contains 4 out of 683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 1776/1776 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 672 transition count 1754
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 672 transition count 1754
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 672 transition count 1752
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 32 place count 664 transition count 1736
Iterating global reduction 1 with 8 rules applied. Total rules applied 40 place count 664 transition count 1736
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 48 place count 656 transition count 1706
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 place count 656 transition count 1706
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 64 place count 648 transition count 1676
Iterating global reduction 1 with 8 rules applied. Total rules applied 72 place count 648 transition count 1676
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 80 place count 640 transition count 1660
Iterating global reduction 1 with 8 rules applied. Total rules applied 88 place count 640 transition count 1660
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 96 place count 632 transition count 1642
Iterating global reduction 1 with 8 rules applied. Total rules applied 104 place count 632 transition count 1642
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 112 place count 624 transition count 1624
Iterating global reduction 1 with 8 rules applied. Total rules applied 120 place count 624 transition count 1624
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 128 place count 616 transition count 1608
Iterating global reduction 1 with 8 rules applied. Total rules applied 136 place count 616 transition count 1608
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 143 place count 609 transition count 1594
Iterating global reduction 1 with 7 rules applied. Total rules applied 150 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 151 place count 608 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 152 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 153 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 154 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 155 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 156 place count 606 transition count 1588
Applied a total of 156 rules in 159 ms. Remains 606 /683 variables (removed 77) and now considering 1588/1776 (removed 188) transitions.
[2024-05-23 07:28:56] [INFO ] Flow matrix only has 1061 transitions (discarded 527 similar events)
// Phase 1: matrix 1061 rows 606 cols
[2024-05-23 07:28:56] [INFO ] Computed 2 invariants in 14 ms
[2024-05-23 07:28:56] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-23 07:28:56] [INFO ] Flow matrix only has 1061 transitions (discarded 527 similar events)
[2024-05-23 07:28:56] [INFO ] Invariant cache hit.
[2024-05-23 07:28:56] [INFO ] State equation strengthened by 264 read => feed constraints.
[2024-05-23 07:28:57] [INFO ] Implicit Places using invariants and state equation in 1577 ms returned []
Implicit Place search using SMT with State Equation took 1856 ms to find 0 implicit places.
Running 1586 sub problems to find dead transitions.
[2024-05-23 07:28:57] [INFO ] Flow matrix only has 1061 transitions (discarded 527 similar events)
[2024-05-23 07:28:57] [INFO ] Invariant cache hit.
[2024-05-23 07:28:57] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/606 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/606 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/606 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 1061/1667 variables, 606/608 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
SMT process timed out in 36726ms, After SMT, problems are : Problem set: 0 solved, 1586 unsolved
Search for dead transitions found 0 dead transitions in 36743ms
Starting structural reductions in LTL mode, iteration 1 : 606/683 places, 1588/1776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38764 ms. Remains : 606/683 places, 1588/1776 transitions.
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : FunctionPointer-PT-c128-LTLFireability-07
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c128-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLFireability-07 finished in 38985 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p1)||p0)))'
Support contains 3 out of 683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 683/683 places, 1776/1776 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 673 transition count 1756
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 673 transition count 1756
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 673 transition count 1754
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 666 transition count 1740
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 666 transition count 1740
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 659 transition count 1714
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 659 transition count 1714
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 652 transition count 1688
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 652 transition count 1688
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 71 place count 645 transition count 1674
Iterating global reduction 1 with 7 rules applied. Total rules applied 78 place count 645 transition count 1674
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 85 place count 638 transition count 1658
Iterating global reduction 1 with 7 rules applied. Total rules applied 92 place count 638 transition count 1658
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 99 place count 631 transition count 1642
Iterating global reduction 1 with 7 rules applied. Total rules applied 106 place count 631 transition count 1642
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 113 place count 624 transition count 1628
Iterating global reduction 1 with 7 rules applied. Total rules applied 120 place count 624 transition count 1628
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 127 place count 617 transition count 1614
Iterating global reduction 1 with 7 rules applied. Total rules applied 134 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 614 transition count 1608
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 614 transition count 1608
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 144 place count 614 transition count 1604
Applied a total of 144 rules in 326 ms. Remains 614 /683 variables (removed 69) and now considering 1604/1776 (removed 172) transitions.
[2024-05-23 07:29:35] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-23 07:29:35] [INFO ] Computed 2 invariants in 12 ms
[2024-05-23 07:29:35] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-05-23 07:29:35] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 07:29:35] [INFO ] Invariant cache hit.
[2024-05-23 07:29:35] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-23 07:29:38] [INFO ] Implicit Places using invariants and state equation in 3492 ms returned []
Implicit Place search using SMT with State Equation took 3826 ms to find 0 implicit places.
[2024-05-23 07:29:39] [INFO ] Redundant transitions in 28 ms returned []
Running 1602 sub problems to find dead transitions.
[2024-05-23 07:29:39] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-23 07:29:39] [INFO ] Invariant cache hit.
[2024-05-23 07:29:39] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1685 variables, 614/616 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1685 variables, 265/881 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 2483 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30135 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 614/614 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints]
After SMT, in 67274ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 67287ms
Starting structural reductions in SI_LTL mode, iteration 1 : 614/683 places, 1604/1776 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71481 ms. Remains : 614/683 places, 1604/1776 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c128-LTLFireability-09
Entered a terminal (fully accepting) state of product in 58 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c128-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLFireability-09 finished in 71597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F((p1||(G(p3)&&p2))))))'
Support contains 5 out of 683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 683/683 places, 1776/1776 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 674 transition count 1758
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 674 transition count 1758
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 674 transition count 1756
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 28 place count 666 transition count 1740
Iterating global reduction 1 with 8 rules applied. Total rules applied 36 place count 666 transition count 1740
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 44 place count 658 transition count 1710
Iterating global reduction 1 with 8 rules applied. Total rules applied 52 place count 658 transition count 1710
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 60 place count 650 transition count 1680
Iterating global reduction 1 with 8 rules applied. Total rules applied 68 place count 650 transition count 1680
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 76 place count 642 transition count 1664
Iterating global reduction 1 with 8 rules applied. Total rules applied 84 place count 642 transition count 1664
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 92 place count 634 transition count 1646
Iterating global reduction 1 with 8 rules applied. Total rules applied 100 place count 634 transition count 1646
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 108 place count 626 transition count 1628
Iterating global reduction 1 with 8 rules applied. Total rules applied 116 place count 626 transition count 1628
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 124 place count 618 transition count 1612
Iterating global reduction 1 with 8 rules applied. Total rules applied 132 place count 618 transition count 1612
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 140 place count 610 transition count 1596
Iterating global reduction 1 with 8 rules applied. Total rules applied 148 place count 610 transition count 1596
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 149 place count 609 transition count 1594
Iterating global reduction 1 with 1 rules applied. Total rules applied 150 place count 609 transition count 1594
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 151 place count 608 transition count 1592
Iterating global reduction 1 with 1 rules applied. Total rules applied 152 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 153 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 154 place count 607 transition count 1590
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 156 place count 607 transition count 1588
Applied a total of 156 rules in 300 ms. Remains 607 /683 variables (removed 76) and now considering 1588/1776 (removed 188) transitions.
[2024-05-23 07:30:46] [INFO ] Flow matrix only has 1063 transitions (discarded 525 similar events)
// Phase 1: matrix 1063 rows 607 cols
[2024-05-23 07:30:46] [INFO ] Computed 2 invariants in 11 ms
[2024-05-23 07:30:47] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-23 07:30:47] [INFO ] Flow matrix only has 1063 transitions (discarded 525 similar events)
[2024-05-23 07:30:47] [INFO ] Invariant cache hit.
[2024-05-23 07:30:47] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-23 07:30:48] [INFO ] Implicit Places using invariants and state equation in 1577 ms returned []
Implicit Place search using SMT with State Equation took 1845 ms to find 0 implicit places.
[2024-05-23 07:30:48] [INFO ] Redundant transitions in 25 ms returned []
Running 1586 sub problems to find dead transitions.
[2024-05-23 07:30:48] [INFO ] Flow matrix only has 1063 transitions (discarded 525 similar events)
[2024-05-23 07:30:48] [INFO ] Invariant cache hit.
[2024-05-23 07:30:48] [INFO ] State equation strengthened by 266 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/607 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/607 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/607 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
At refinement iteration 3 (OVERLAPS) 1063/1670 variables, 607/609 constraints. Problems are: Problem set: 0 solved, 1586 unsolved
SMT process timed out in 36799ms, After SMT, problems are : Problem set: 0 solved, 1586 unsolved
Search for dead transitions found 0 dead transitions in 36812ms
Starting structural reductions in SI_LTL mode, iteration 1 : 607/683 places, 1588/1776 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38991 ms. Remains : 607/683 places, 1588/1776 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : FunctionPointer-PT-c128-LTLFireability-10
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c128-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLFireability-10 finished in 39219 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(G(p0))||(G(p2)&&p1)))))'
Support contains 5 out of 683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 1776/1776 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 675 transition count 1760
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 675 transition count 1760
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 670 transition count 1750
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 670 transition count 1750
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 665 transition count 1730
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 665 transition count 1730
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 660 transition count 1710
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 660 transition count 1710
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 655 transition count 1700
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 655 transition count 1700
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 61 place count 650 transition count 1690
Iterating global reduction 0 with 5 rules applied. Total rules applied 66 place count 650 transition count 1690
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 71 place count 645 transition count 1680
Iterating global reduction 0 with 5 rules applied. Total rules applied 76 place count 645 transition count 1680
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 81 place count 640 transition count 1670
Iterating global reduction 0 with 5 rules applied. Total rules applied 86 place count 640 transition count 1670
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 91 place count 635 transition count 1660
Iterating global reduction 0 with 5 rules applied. Total rules applied 96 place count 635 transition count 1660
Applied a total of 96 rules in 126 ms. Remains 635 /683 variables (removed 48) and now considering 1660/1776 (removed 116) transitions.
[2024-05-23 07:31:25] [INFO ] Flow matrix only has 1107 transitions (discarded 553 similar events)
// Phase 1: matrix 1107 rows 635 cols
[2024-05-23 07:31:25] [INFO ] Computed 2 invariants in 13 ms
[2024-05-23 07:31:26] [INFO ] Implicit Places using invariants in 280 ms returned []
[2024-05-23 07:31:26] [INFO ] Flow matrix only has 1107 transitions (discarded 553 similar events)
[2024-05-23 07:31:26] [INFO ] Invariant cache hit.
[2024-05-23 07:31:26] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-23 07:31:27] [INFO ] Implicit Places using invariants and state equation in 1925 ms returned []
Implicit Place search using SMT with State Equation took 2208 ms to find 0 implicit places.
Running 1658 sub problems to find dead transitions.
[2024-05-23 07:31:28] [INFO ] Flow matrix only has 1107 transitions (discarded 553 similar events)
[2024-05-23 07:31:28] [INFO ] Invariant cache hit.
[2024-05-23 07:31:28] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/635 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/635 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 9.0)
(s5 1.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 1.0)
(s34 0.0)
(s35 1.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 1.0)
(s66 0.0)
(s67 0.0)
(s68 1.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 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 0.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 0.0)
(s167 1.0)
(s168 1.0)
(s169 0.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 0.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 0.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 timeout
1.0)
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 635/1742 variables, and 2 constraints, problems are : Problem set: 0 solved, 1658 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/635 constraints, ReadFeed: 0/271 constraints, PredecessorRefiner: 1658/1658 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1658 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/635 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/635 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/635 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 3 (OVERLAPS) 1107/1742 variables, 635/637 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1742 variables, 271/908 constraints. Problems are: Problem set: 0 solved, 1658 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1742/1742 variables, and 2566 constraints, problems are : Problem set: 0 solved, 1658 unsolved in 30792 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 635/635 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 1658/1658 constraints, Known Traps: 0/0 constraints]
After SMT, in 68417ms problems are : Problem set: 0 solved, 1658 unsolved
Search for dead transitions found 0 dead transitions in 68433ms
Starting structural reductions in LTL mode, iteration 1 : 635/683 places, 1660/1776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70774 ms. Remains : 635/683 places, 1660/1776 transitions.
Stuttering acceptance computed with spot in 244 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : FunctionPointer-PT-c128-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1758 steps with 16 reset in 16 ms.
FORMULA FunctionPointer-PT-c128-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLFireability-13 finished in 71052 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 683 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 683/683 places, 1776/1776 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 672 transition count 1754
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 672 transition count 1754
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 672 transition count 1752
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 32 place count 664 transition count 1736
Iterating global reduction 1 with 8 rules applied. Total rules applied 40 place count 664 transition count 1736
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 48 place count 656 transition count 1706
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 place count 656 transition count 1706
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 64 place count 648 transition count 1676
Iterating global reduction 1 with 8 rules applied. Total rules applied 72 place count 648 transition count 1676
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 80 place count 640 transition count 1660
Iterating global reduction 1 with 8 rules applied. Total rules applied 88 place count 640 transition count 1660
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 96 place count 632 transition count 1642
Iterating global reduction 1 with 8 rules applied. Total rules applied 104 place count 632 transition count 1642
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 112 place count 624 transition count 1624
Iterating global reduction 1 with 8 rules applied. Total rules applied 120 place count 624 transition count 1624
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 128 place count 616 transition count 1608
Iterating global reduction 1 with 8 rules applied. Total rules applied 136 place count 616 transition count 1608
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 144 place count 608 transition count 1592
Iterating global reduction 1 with 8 rules applied. Total rules applied 152 place count 608 transition count 1592
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 153 place count 607 transition count 1590
Iterating global reduction 1 with 1 rules applied. Total rules applied 154 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 155 place count 606 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 156 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 157 place count 605 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 158 place count 605 transition count 1586
Applied a total of 158 rules in 274 ms. Remains 605 /683 variables (removed 78) and now considering 1586/1776 (removed 190) transitions.
[2024-05-23 07:32:36] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
// Phase 1: matrix 1058 rows 605 cols
[2024-05-23 07:32:37] [INFO ] Computed 2 invariants in 16 ms
[2024-05-23 07:32:37] [INFO ] Implicit Places using invariants in 384 ms returned []
[2024-05-23 07:32:37] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-23 07:32:37] [INFO ] Invariant cache hit.
[2024-05-23 07:32:37] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-23 07:32:39] [INFO ] Implicit Places using invariants and state equation in 1940 ms returned []
Implicit Place search using SMT with State Equation took 2325 ms to find 0 implicit places.
Running 1584 sub problems to find dead transitions.
[2024-05-23 07:32:39] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2024-05-23 07:32:39] [INFO ] Invariant cache hit.
[2024-05-23 07:32:39] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 3 (OVERLAPS) 1058/1663 variables, 605/607 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
SMT process timed out in 36964ms, After SMT, problems are : Problem set: 0 solved, 1584 unsolved
Search for dead transitions found 0 dead transitions in 36979ms
Starting structural reductions in LTL mode, iteration 1 : 605/683 places, 1586/1776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39584 ms. Remains : 605/683 places, 1586/1776 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c128-LTLFireability-14
Stuttering criterion allowed to conclude after 79 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-c128-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLFireability-14 finished in 39677 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)&&F(G(p1)))))'
Support contains 3 out of 683 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 683/683 places, 1776/1776 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 674 transition count 1758
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 674 transition count 1758
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 674 transition count 1756
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 27 place count 667 transition count 1742
Iterating global reduction 1 with 7 rules applied. Total rules applied 34 place count 667 transition count 1742
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 660 transition count 1716
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 660 transition count 1716
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 55 place count 653 transition count 1690
Iterating global reduction 1 with 7 rules applied. Total rules applied 62 place count 653 transition count 1690
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 69 place count 646 transition count 1676
Iterating global reduction 1 with 7 rules applied. Total rules applied 76 place count 646 transition count 1676
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 83 place count 639 transition count 1660
Iterating global reduction 1 with 7 rules applied. Total rules applied 90 place count 639 transition count 1660
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 97 place count 632 transition count 1644
Iterating global reduction 1 with 7 rules applied. Total rules applied 104 place count 632 transition count 1644
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 111 place count 625 transition count 1630
Iterating global reduction 1 with 7 rules applied. Total rules applied 118 place count 625 transition count 1630
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 125 place count 618 transition count 1616
Iterating global reduction 1 with 7 rules applied. Total rules applied 132 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 617 transition count 1614
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 617 transition count 1614
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 135 place count 616 transition count 1612
Iterating global reduction 1 with 1 rules applied. Total rules applied 136 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 615 transition count 1610
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 615 transition count 1610
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 142 place count 615 transition count 1606
Applied a total of 142 rules in 305 ms. Remains 615 /683 variables (removed 68) and now considering 1606/1776 (removed 170) transitions.
[2024-05-23 07:33:16] [INFO ] Flow matrix only has 1074 transitions (discarded 532 similar events)
// Phase 1: matrix 1074 rows 615 cols
[2024-05-23 07:33:16] [INFO ] Computed 2 invariants in 15 ms
[2024-05-23 07:33:17] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-05-23 07:33:17] [INFO ] Flow matrix only has 1074 transitions (discarded 532 similar events)
[2024-05-23 07:33:17] [INFO ] Invariant cache hit.
[2024-05-23 07:33:17] [INFO ] State equation strengthened by 267 read => feed constraints.
[2024-05-23 07:33:18] [INFO ] Implicit Places using invariants and state equation in 1759 ms returned []
Implicit Place search using SMT with State Equation took 2091 ms to find 0 implicit places.
[2024-05-23 07:33:18] [INFO ] Redundant transitions in 25 ms returned []
Running 1604 sub problems to find dead transitions.
[2024-05-23 07:33:18] [INFO ] Flow matrix only has 1074 transitions (discarded 532 similar events)
[2024-05-23 07:33:18] [INFO ] Invariant cache hit.
[2024-05-23 07:33:18] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 3 (OVERLAPS) 1074/1689 variables, 615/617 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
SMT process timed out in 37117ms, After SMT, problems are : Problem set: 0 solved, 1604 unsolved
Search for dead transitions found 0 dead transitions in 37130ms
Starting structural reductions in SI_LTL mode, iteration 1 : 615/683 places, 1606/1776 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 39560 ms. Remains : 615/683 places, 1606/1776 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-c128-LTLFireability-15
Stuttering criterion allowed to conclude after 55 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c128-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c128-LTLFireability-15 finished in 39697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1)||G(!p1))))'
[2024-05-23 07:33:56] [INFO ] Flatten gal took : 63 ms
[2024-05-23 07:33:56] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-05-23 07:33:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 683 places, 1776 transitions and 7230 arcs took 13 ms.
Total runtime 703006 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FunctionPointer-PT-c128

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 1033
MODEL NAME: /home/mcc/execution/412/model
683 places, 1776 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
Error in allocating array of size 134217728 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is FunctionPointer-PT-c128, 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 r179-tall-171640601300324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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