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.r500-smll-171649587500131.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is HirschbergSinclair-PT-50, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r500-smll-171649587500131
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 13 02:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 13 02:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 02:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 13 02:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 652K 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 HirschbergSinclair-PT-50-LTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-50-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717255183985

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-50
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:19:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:19:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:19:47] [INFO ] Load time of PNML (sax parser for PT used): 259 ms
[2024-06-01 15:19:47] [INFO ] Transformed 1208 places.
[2024-06-01 15:19:47] [INFO ] Transformed 1102 transitions.
[2024-06-01 15:19:47] [INFO ] Parsed PT model containing 1208 places and 1102 transitions and 3361 arcs in 484 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HirschbergSinclair-PT-50-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-50-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 1208 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1208/1208 places, 1102/1102 transitions.
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 1159 transition count 1102
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 97 place count 1111 transition count 1054
Iterating global reduction 1 with 48 rules applied. Total rules applied 145 place count 1111 transition count 1054
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 189 place count 1067 transition count 1010
Iterating global reduction 1 with 44 rules applied. Total rules applied 233 place count 1067 transition count 1010
Applied a total of 233 rules in 803 ms. Remains 1067 /1208 variables (removed 141) and now considering 1010/1102 (removed 92) transitions.
// Phase 1: matrix 1010 rows 1067 cols
[2024-06-01 15:19:48] [INFO ] Computed 57 invariants in 65 ms
[2024-06-01 15:19:50] [INFO ] Implicit Places using invariants in 1874 ms returned []
[2024-06-01 15:19:50] [INFO ] Invariant cache hit.
[2024-06-01 15:20:01] [INFO ] Implicit Places using invariants and state equation in 11067 ms returned []
Implicit Place search using SMT with State Equation took 13011 ms to find 0 implicit places.
Running 960 sub problems to find dead transitions.
[2024-06-01 15:20:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1016 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 960 unsolved
(s331 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s3 1.0)
(s5 1.0)
(s7 1.0)
(s9 1.0)
(s11 1.0)
(s13 1.0)
(s15 1.0)
(s17 1.0)
(s19 1.0)
(s21 1.0)
(s23 1.0)
(s25 1.0)
(s27 1.0)
(s29 1.0)
(s31 1.0)
(s33 1.0)
(s35 1.0)
(s37 1.0)
(s39 1.0)
(s41 1.0)
(s43 1.0)
(s45 1.0)
(s47 1.0)
(s49 1.0)
(s51 1.0)
(s53 1.0)
(s55 1.0)
(s57 1.0)
(s59 1.0)
(s61 1.0)
(s63 1.0)
(s65 1.0)
(s67 1.0)
(s69 1.0)
(s71 1.0)
(s73 1.0)
(s75 1.0)
(s77 1.0)
(s79 1.0)
(s81 1.0)
(s83 1.0)
(s85 1.0)
(s87 1.0)
(s89 1.0)
(s91 1.0)
(s93 1.0)
(s95 1.0)
(s97 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1016/2077 variables, and 6 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 6/56 constraints, State Equation: 0/1067 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1016 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1016 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (OVERLAPS) 2/1018 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s3 1)
(s5 1)
(s7 1)
(s9 1)
(s11 1)
(s13 1)
(s15 1)
(s17 1)
(s19 1)
(s21 1)
(s23 1)
(s25 1)
(s27 1)
(s29 1)
(s31 1)
(s33 1)
(s35 1)
(s37 1)
(s38 0)
(s39 1)
(s41 1)
(s43 1)
(s45 1)
(s47 1)
(s49 1)
(s51 1)
(s53 1)
(s55 1)
(s57 1)
(s59 1)
(s61 1)
(s63 1)
(s65 1)
(s67 1)
(s69 1)
(s71 1)
(s73 1)
(s75 1)
(s77 1)
(s79 1)
(s81 1)
(s83 1)
(s85 1)
(s87 1)
(s89 1)
(s91 1)
(s93 1)
(s95 1)
(s97 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 0)
(s177 0)
(s178 0)
(s179 1)
(s180 0)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1018/2077 variables, and 7 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/56 constraints, State Equation: 0/1067 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 0/0 constraints]
After SMT, in 61016ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 61077ms
Starting structural reductions in LTL mode, iteration 1 : 1067/1208 places, 1010/1102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74964 ms. Remains : 1067/1208 places, 1010/1102 transitions.
Support contains 52 out of 1067 places after structural reductions.
[2024-06-01 15:21:02] [INFO ] Flatten gal took : 149 ms
[2024-06-01 15:21:03] [INFO ] Flatten gal took : 88 ms
[2024-06-01 15:21:03] [INFO ] Input system was already deterministic with 1010 transitions.
RANDOM walk for 40000 steps (36 resets) in 2110 ms. (18 steps per ms) remains 6/30 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 6/6 properties
[2024-06-01 15:21:04] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 907/915 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/915 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 3/918 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/918 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 50/968 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/968 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 7 (OVERLAPS) 1010/1978 variables, 968/1025 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1978 variables, 0/1025 constraints. Problems are: Problem set: 5 solved, 1 unsolved
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Real declared 2077/2077 variables, and 1124 constraints, problems are : Problem set: 6 solved, 0 unsolved in 1714 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 56/56 constraints, State Equation: 1067/1067 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1755ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 6 atomic propositions for a total of 14 simplifications.
FORMULA HirschbergSinclair-PT-50-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-50-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-50-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1067 stabilizing places and 1010 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1067 transition count 1010
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 1067 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1067/1067 places, 1010/1010 transitions.
Graph (complete) has 2026 edges and 1067 vertex of which 1066 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 48 places and 48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 435 transitions
Trivial Post-agglo rules discarded 435 transitions
Performed 435 trivial Post agglomeration. Transition count delta: 435
Iterating post reduction 0 with 435 rules applied. Total rules applied 436 place count 1018 transition count 527
Reduce places removed 435 places and 0 transitions.
Iterating post reduction 1 with 435 rules applied. Total rules applied 871 place count 583 transition count 527
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 877 place count 577 transition count 521
Iterating global reduction 2 with 6 rules applied. Total rules applied 883 place count 577 transition count 521
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 4 rules applied. Total rules applied 887 place count 577 transition count 517
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 891 place count 573 transition count 517
Applied a total of 891 rules in 138 ms. Remains 573 /1067 variables (removed 494) and now considering 517/1010 (removed 493) transitions.
// Phase 1: matrix 517 rows 573 cols
[2024-06-01 15:21:06] [INFO ] Computed 56 invariants in 6 ms
[2024-06-01 15:21:07] [INFO ] Implicit Places using invariants in 775 ms returned []
[2024-06-01 15:21:07] [INFO ] Invariant cache hit.
[2024-06-01 15:21:08] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 15:21:11] [INFO ] Implicit Places using invariants and state equation in 3710 ms returned []
Implicit Place search using SMT with State Equation took 4489 ms to find 0 implicit places.
[2024-06-01 15:21:11] [INFO ] Redundant transitions in 33 ms returned []
Running 424 sub problems to find dead transitions.
[2024-06-01 15:21:11] [INFO ] Invariant cache hit.
[2024-06-01 15:21:11] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 4/484 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (OVERLAPS) 428/912 variables, 484/540 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/912 variables, 8/548 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 912/1090 variables, and 548 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 484/573 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 424 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 4/484 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (OVERLAPS) 428/912 variables, 484/540 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/912 variables, 8/548 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/912 variables, 424/972 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 912/1090 variables, and 972 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 484/573 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 0/0 constraints]
After SMT, in 60162ms problems are : Problem set: 0 solved, 424 unsolved
Search for dead transitions found 0 dead transitions in 60170ms
Starting structural reductions in SI_LTL mode, iteration 1 : 573/1067 places, 517/1010 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64840 ms. Remains : 573/1067 places, 517/1010 transitions.
Stuttering acceptance computed with spot in 219 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLCardinality-01
Product exploration explored 100000 steps with 176 reset in 530 ms.
Product exploration explored 100000 steps with 176 reset in 506 ms.
Computed a total of 573 stabilizing places and 517 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 573 transition count 517
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 443 steps (0 resets) in 10 ms. (40 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Support contains 2 out of 573 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 573/573 places, 517/517 transitions.
Applied a total of 0 rules in 36 ms. Remains 573 /573 variables (removed 0) and now considering 517/517 (removed 0) transitions.
[2024-06-01 15:22:13] [INFO ] Invariant cache hit.
[2024-06-01 15:22:14] [INFO ] Implicit Places using invariants in 796 ms returned []
[2024-06-01 15:22:14] [INFO ] Invariant cache hit.
[2024-06-01 15:22:14] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 15:22:18] [INFO ] Implicit Places using invariants and state equation in 3713 ms returned []
Implicit Place search using SMT with State Equation took 4529 ms to find 0 implicit places.
[2024-06-01 15:22:18] [INFO ] Redundant transitions in 13 ms returned []
Running 424 sub problems to find dead transitions.
[2024-06-01 15:22:18] [INFO ] Invariant cache hit.
[2024-06-01 15:22:18] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 4/484 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (OVERLAPS) 428/912 variables, 484/540 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/912 variables, 8/548 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 912/1090 variables, and 548 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 484/573 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 424 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 4/484 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (OVERLAPS) 428/912 variables, 484/540 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/912 variables, 8/548 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/912 variables, 424/972 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 912/1090 variables, and 972 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 484/573 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 0/0 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 424 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64722 ms. Remains : 573/573 places, 517/517 transitions.
Computed a total of 573 stabilizing places and 517 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 573 transition count 517
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 370 steps (0 resets) in 9 ms. (37 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 176 reset in 379 ms.
Product exploration explored 100000 steps with 176 reset in 411 ms.
Support contains 2 out of 573 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 573/573 places, 517/517 transitions.
Applied a total of 0 rules in 48 ms. Remains 573 /573 variables (removed 0) and now considering 517/517 (removed 0) transitions.
[2024-06-01 15:23:19] [INFO ] Invariant cache hit.
[2024-06-01 15:23:20] [INFO ] Implicit Places using invariants in 965 ms returned []
[2024-06-01 15:23:20] [INFO ] Invariant cache hit.
[2024-06-01 15:23:21] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 15:23:24] [INFO ] Implicit Places using invariants and state equation in 3816 ms returned []
Implicit Place search using SMT with State Equation took 4795 ms to find 0 implicit places.
[2024-06-01 15:23:24] [INFO ] Redundant transitions in 6 ms returned []
Running 424 sub problems to find dead transitions.
[2024-06-01 15:23:24] [INFO ] Invariant cache hit.
[2024-06-01 15:23:24] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 4/484 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (OVERLAPS) 428/912 variables, 484/540 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/912 variables, 8/548 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 912/1090 variables, and 548 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 484/573 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 424 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (OVERLAPS) 4/484 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 4 (OVERLAPS) 428/912 variables, 484/540 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/912 variables, 8/548 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/912 variables, 424/972 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 912/1090 variables, and 972 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 484/573 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 0/0 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 424 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64970 ms. Remains : 573/573 places, 517/517 transitions.
Treatment of property HirschbergSinclair-PT-50-LTLCardinality-01 finished in 198310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0||G(p1)))&&F(p0))))'
Support contains 4 out of 1067 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1067/1067 places, 1010/1010 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1066 transition count 1010
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 1060 transition count 1004
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 1060 transition count 1004
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 1058 transition count 1002
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 1058 transition count 1002
Applied a total of 17 rules in 142 ms. Remains 1058 /1067 variables (removed 9) and now considering 1002/1010 (removed 8) transitions.
// Phase 1: matrix 1002 rows 1058 cols
[2024-06-01 15:24:25] [INFO ] Computed 56 invariants in 9 ms
[2024-06-01 15:24:25] [INFO ] Implicit Places using invariants in 828 ms returned []
[2024-06-01 15:24:25] [INFO ] Invariant cache hit.
[2024-06-01 15:24:35] [INFO ] Implicit Places using invariants and state equation in 9450 ms returned []
Implicit Place search using SMT with State Equation took 10291 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2024-06-01 15:24:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1008 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1008/2060 variables, and 6 constraints, problems are : Problem set: 0 solved, 952 unsolved in 30045 ms.
Refiners :[Generalized P Invariants (flows): 6/56 constraints, State Equation: 0/1058 constraints, PredecessorRefiner: 952/952 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 952 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1008 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1008 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 50/1058 variables, 50/56 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 747)
(s1 1)
(s2 0)
(s3 748)
(s4 0)
(s5 748)
(s6 0)
(s7 748)
(s8 0)
(s9 1)
(s10 0)
(s11 747)
(s12 0)
(s13 746)
(s14 0)
(s15 1)
(s16 0)
(s17 1)
(s18 744)
(s19 1)
(s20 0)
(s21 744)
(s22 0)
(s23 1)
(s24 0)
(s25 742)
(s26 0)
(s27 1)
(s28 0)
(s29 1)
(s30 0)
(s31 1)
(s32 0)
(s33 740)
(s34 0)
(s35 738)
(s36 0)
(s37 1)
(s38 0)
(s39 1)
(s40 0)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 730)
(s47 1)
(s48 0)
(s49 1)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 1)
(s56 0)
(s57 726)
(s58 724)
(s59 1)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 724)
(s66 0)
(s67 722)
(s68 719)
(s69 1)
(s70 718)
(s71 1)
(s72 0)
(s73 1)
(s74 0)
(s75 1)
(s76 0)
(s77 716)
(s78 0)
(s79 1)
(s80 0)
(s81 1)
(s82 0)
(s83 712)
(s84 0)
(s85 710)
(s86 708)
(s87 1)
(s88 707)
(s89 1)
(s90 705)
(s91 1)
(s92 0)
(s93 1)
(s94 701)
(s95 1)
(s96 699)
(s97 1)
(s98 0)
(s99 1)
(s100 1)
(s101 749)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 748)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1058/2060 variables, and 56 constraints, problems are : Problem set: 0 solved, 952 unsolved in 30030 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 0/1058 constraints, PredecessorRefiner: 0/952 constraints, Known Traps: 0/0 constraints]
After SMT, in 60422ms problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 60436ms
Starting structural reductions in LTL mode, iteration 1 : 1058/1067 places, 1002/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70876 ms. Remains : 1058/1067 places, 1002/1010 transitions.
Stuttering acceptance computed with spot in 252 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), true, (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLCardinality-02
Product exploration explored 100000 steps with 33333 reset in 696 ms.
Product exploration explored 100000 steps with 33333 reset in 686 ms.
Computed a total of 1058 stabilizing places and 1002 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1058 transition count 1002
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 17 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-50-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-50-LTLCardinality-02 finished in 72988 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p0)&&G((p1&&(p1 U X(p2))))))))'
Support contains 5 out of 1067 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1067/1067 places, 1010/1010 transitions.
Graph (complete) has 2026 edges and 1067 vertex of which 1066 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 49 places and 49 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 440 transitions
Trivial Post-agglo rules discarded 440 transitions
Performed 440 trivial Post agglomeration. Transition count delta: 440
Iterating post reduction 0 with 440 rules applied. Total rules applied 441 place count 1017 transition count 521
Reduce places removed 440 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 442 rules applied. Total rules applied 883 place count 577 transition count 519
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 885 place count 575 transition count 519
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 890 place count 570 transition count 514
Iterating global reduction 3 with 5 rules applied. Total rules applied 895 place count 570 transition count 514
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 898 place count 570 transition count 511
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 901 place count 567 transition count 511
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 903 place count 566 transition count 510
Applied a total of 903 rules in 109 ms. Remains 566 /1067 variables (removed 501) and now considering 510/1010 (removed 500) transitions.
// Phase 1: matrix 510 rows 566 cols
[2024-06-01 15:25:38] [INFO ] Computed 56 invariants in 5 ms
[2024-06-01 15:25:38] [INFO ] Implicit Places using invariants in 756 ms returned []
[2024-06-01 15:25:38] [INFO ] Invariant cache hit.
[2024-06-01 15:25:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 15:25:42] [INFO ] Implicit Places using invariants and state equation in 3924 ms returned []
Implicit Place search using SMT with State Equation took 4697 ms to find 0 implicit places.
[2024-06-01 15:25:42] [INFO ] Redundant transitions in 3 ms returned []
Running 414 sub problems to find dead transitions.
[2024-06-01 15:25:42] [INFO ] Invariant cache hit.
[2024-06-01 15:25:42] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 3/473 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 4 (OVERLAPS) 417/890 variables, 473/529 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/890 variables, 8/537 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/890 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 414 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 890/1076 variables, and 537 constraints, problems are : Problem set: 0 solved, 414 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 473/566 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 414 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 3/473 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 4 (OVERLAPS) 417/890 variables, 473/529 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/890 variables, 8/537 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/890 variables, 414/951 constraints. Problems are: Problem set: 0 solved, 414 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 890/1076 variables, and 951 constraints, problems are : Problem set: 0 solved, 414 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 473/566 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 0/0 constraints]
After SMT, in 60109ms problems are : Problem set: 0 solved, 414 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Starting structural reductions in SI_LTL mode, iteration 1 : 566/1067 places, 510/1010 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64931 ms. Remains : 566/1067 places, 510/1010 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLCardinality-03
Product exploration explored 100000 steps with 350 reset in 499 ms.
Product exploration explored 100000 steps with 348 reset in 553 ms.
Computed a total of 566 stabilizing places and 510 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 566 transition count 510
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G p2))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 9 factoid took 1766 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40000 steps (68 resets) in 290 ms. (137 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 1/1 properties
[2024-06-01 15:26:46] [INFO ] Invariant cache hit.
[2024-06-01 15:26:46] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 430/435 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/435 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/469 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/469 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 413/882 variables, 469/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/882 variables, 6/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/882 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/884 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/884 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/886 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/886 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/886 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/887 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/887 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/890 variables, 2/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/890 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/890 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 890/1076 variables, and 537 constraints, problems are : Problem set: 0 solved, 1 unsolved in 540 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 473/566 constraints, ReadFeed: 8/8 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 430/435 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/435 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/469 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/469 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 413/882 variables, 469/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/882 variables, 6/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/882 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/884 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/884 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/884 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/886 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/886 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/886 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/887 variables, 1/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/887 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/890 variables, 2/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/890 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/890 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 890/1076 variables, and 538 constraints, problems are : Problem set: 0 solved, 1 unsolved in 653 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 473/566 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1207ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 273 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=91 )
Parikh walk visited 1 properties in 11 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G p2))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT (OR p1 p0 p2))), (F (NOT (OR (NOT p1) p0 p2))), (F p0), (F (NOT p2)), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1)]
Knowledge based reduction with 9 factoid took 2564 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
[2024-06-01 15:26:50] [INFO ] Invariant cache hit.
[2024-06-01 15:26:51] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 428 ms returned sat
[2024-06-01 15:26:57] [INFO ] [Real]Absence check using state equation in 5526 ms returned sat
[2024-06-01 15:26:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:26:58] [INFO ] [Nat]Absence check using 0 positive and 56 generalized place invariants in 567 ms returned sat
[2024-06-01 15:26:58] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2024-06-01 15:26:58] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 15:26:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 15:26:58] [INFO ] Computed and/alt/rep : 414/428/414 causal constraints (skipped 0 transitions) in 87 ms.
[2024-06-01 15:27:00] [INFO ] Added : 202 causal constraints over 41 iterations in 1748 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 566 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 566/566 places, 510/510 transitions.
Applied a total of 0 rules in 29 ms. Remains 566 /566 variables (removed 0) and now considering 510/510 (removed 0) transitions.
[2024-06-01 15:27:00] [INFO ] Invariant cache hit.
[2024-06-01 15:27:01] [INFO ] Implicit Places using invariants in 790 ms returned []
[2024-06-01 15:27:01] [INFO ] Invariant cache hit.
[2024-06-01 15:27:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 15:27:05] [INFO ] Implicit Places using invariants and state equation in 4170 ms returned []
Implicit Place search using SMT with State Equation took 4971 ms to find 0 implicit places.
[2024-06-01 15:27:05] [INFO ] Redundant transitions in 3 ms returned []
Running 414 sub problems to find dead transitions.
[2024-06-01 15:27:05] [INFO ] Invariant cache hit.
[2024-06-01 15:27:05] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 3/473 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 4 (OVERLAPS) 417/890 variables, 473/529 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/890 variables, 8/537 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/890 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 414 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 890/1076 variables, and 537 constraints, problems are : Problem set: 0 solved, 414 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 473/566 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 414 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 3/473 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 4 (OVERLAPS) 417/890 variables, 473/529 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/890 variables, 8/537 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/890 variables, 414/951 constraints. Problems are: Problem set: 0 solved, 414 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 890/1076 variables, and 951 constraints, problems are : Problem set: 0 solved, 414 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 473/566 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 0/0 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 414 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65126 ms. Remains : 566/566 places, 510/510 transitions.
Computed a total of 566 stabilizing places and 510 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 566 transition count 510
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G p2))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 11 factoid took 1767 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40003 steps (68 resets) in 174 ms. (228 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
[2024-06-01 15:28:07] [INFO ] Invariant cache hit.
[2024-06-01 15:28:07] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 430/435 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/435 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/469 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/469 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 413/882 variables, 469/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/882 variables, 6/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/882 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/884 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/884 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/886 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/886 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/886 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/887 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/887 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/890 variables, 2/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/890 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/890 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 890/1076 variables, and 537 constraints, problems are : Problem set: 0 solved, 1 unsolved in 528 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 473/566 constraints, ReadFeed: 8/8 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 430/435 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/435 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/469 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/469 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 413/882 variables, 469/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/882 variables, 6/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/882 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/884 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/884 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/884 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/886 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/886 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/886 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/887 variables, 1/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/887 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/890 variables, 2/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/890 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/890 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 890/1076 variables, and 538 constraints, problems are : Problem set: 0 solved, 1 unsolved in 715 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 473/566 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1255ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 273 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=136 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT p0))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G p2))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (OR p1 p2 p0))), (F (NOT (OR (NOT p1) p2 p0))), (F p0), (F (NOT p2)), (F (NOT (AND (NOT p1) (NOT p0)))), (F p1)]
Knowledge based reduction with 11 factoid took 2884 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
[2024-06-01 15:28:12] [INFO ] Invariant cache hit.
[2024-06-01 15:28:13] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 413 ms returned sat
[2024-06-01 15:28:19] [INFO ] [Real]Absence check using state equation in 5655 ms returned sat
[2024-06-01 15:28:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:28:20] [INFO ] [Nat]Absence check using 0 positive and 56 generalized place invariants in 571 ms returned sat
[2024-06-01 15:28:20] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2024-06-01 15:28:20] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 15:28:20] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-06-01 15:28:20] [INFO ] Computed and/alt/rep : 414/428/414 causal constraints (skipped 0 transitions) in 37 ms.
[2024-06-01 15:28:22] [INFO ] Added : 202 causal constraints over 41 iterations in 1561 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 346 reset in 485 ms.
Product exploration explored 100000 steps with 346 reset in 546 ms.
Support contains 5 out of 566 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 566/566 places, 510/510 transitions.
Applied a total of 0 rules in 26 ms. Remains 566 /566 variables (removed 0) and now considering 510/510 (removed 0) transitions.
[2024-06-01 15:28:23] [INFO ] Invariant cache hit.
[2024-06-01 15:28:24] [INFO ] Implicit Places using invariants in 937 ms returned []
[2024-06-01 15:28:24] [INFO ] Invariant cache hit.
[2024-06-01 15:28:24] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 15:28:28] [INFO ] Implicit Places using invariants and state equation in 3963 ms returned []
Implicit Place search using SMT with State Equation took 4914 ms to find 0 implicit places.
[2024-06-01 15:28:28] [INFO ] Redundant transitions in 3 ms returned []
Running 414 sub problems to find dead transitions.
[2024-06-01 15:28:28] [INFO ] Invariant cache hit.
[2024-06-01 15:28:28] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 3/473 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 4 (OVERLAPS) 417/890 variables, 473/529 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/890 variables, 8/537 constraints. Problems are: Problem set: 0 solved, 414 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 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 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 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 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 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/890 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 414 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 890/1076 variables, and 537 constraints, problems are : Problem set: 0 solved, 414 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 473/566 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 414 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/470 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/470 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 3/473 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 4 (OVERLAPS) 417/890 variables, 473/529 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/890 variables, 8/537 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/890 variables, 414/951 constraints. Problems are: Problem set: 0 solved, 414 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 890/1076 variables, and 951 constraints, problems are : Problem set: 0 solved, 414 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 473/566 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 0/0 constraints]
After SMT, in 60097ms problems are : Problem set: 0 solved, 414 unsolved
Search for dead transitions found 0 dead transitions in 60102ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65051 ms. Remains : 566/566 places, 510/510 transitions.
Treatment of property HirschbergSinclair-PT-50-LTLCardinality-03 finished in 230438 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(p0)||X((p1||X(p2))))))'
Support contains 6 out of 1067 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1067/1067 places, 1010/1010 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1063 transition count 1006
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1063 transition count 1006
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1062 transition count 1005
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1062 transition count 1005
Applied a total of 10 rules in 137 ms. Remains 1062 /1067 variables (removed 5) and now considering 1005/1010 (removed 5) transitions.
// Phase 1: matrix 1005 rows 1062 cols
[2024-06-01 15:29:28] [INFO ] Computed 57 invariants in 15 ms
[2024-06-01 15:29:29] [INFO ] Implicit Places using invariants in 831 ms returned []
[2024-06-01 15:29:29] [INFO ] Invariant cache hit.
[2024-06-01 15:29:38] [INFO ] Implicit Places using invariants and state equation in 9391 ms returned []
Implicit Place search using SMT with State Equation took 10224 ms to find 0 implicit places.
Running 955 sub problems to find dead transitions.
[2024-06-01 15:29:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1011 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 955 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1011/2067 variables, and 6 constraints, problems are : Problem set: 0 solved, 955 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 6/56 constraints, State Equation: 0/1062 constraints, PredecessorRefiner: 955/955 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 955 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1011 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 955 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1011 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 955 unsolved
At refinement iteration 2 (OVERLAPS) 2/1013 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 955 unsolved
(s649 1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s3 1)
(s5 1)
(s7 1)
(s9 1)
(s11 1)
(s13 1)
(s15 1)
(s17 1)
(s19 1)
(s21 1)
(s23 1)
(s25 1)
(s27 1)
(s29 1)
(s31 1)
(s33 1)
(s35 1)
(s37 1)
(s38 0)
(s39 1)
(s41 1)
(s43 1)
(s45 1)
(s47 1)
(s49 1)
(s51 1)
(s53 1)
(s55 1)
(s57 1)
(s59 1)
(s61 1)
(s63 1)
(s65 1)
(s67 1)
(s69 1)
(s71 1)
(s73 1)
(s75 1)
(s77 1)
(s79 1)
(s81 1)
(s83 1)
(s85 1)
(s87 1)
(s89 1)
(s91 1)
(s93 1)
(s95 1)
(s97 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 0)
(s177 0)
(s178 0)
(s179 1)
(s180 0)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1013/2067 variables, and 7 constraints, problems are : Problem set: 0 solved, 955 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/56 constraints, State Equation: 0/1062 constraints, PredecessorRefiner: 0/955 constraints, Known Traps: 0/0 constraints]
After SMT, in 60370ms problems are : Problem set: 0 solved, 955 unsolved
Search for dead transitions found 0 dead transitions in 60382ms
Starting structural reductions in LTL mode, iteration 1 : 1062/1067 places, 1005/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70746 ms. Remains : 1062/1067 places, 1005/1010 transitions.
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2), true, (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1742 steps with 477 reset in 11 ms.
FORMULA HirschbergSinclair-PT-50-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-50-LTLCardinality-04 finished in 71037 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)))'
Support contains 4 out of 1067 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1067/1067 places, 1010/1010 transitions.
Graph (complete) has 2026 edges and 1067 vertex of which 1066 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 50 places and 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 441 transitions
Trivial Post-agglo rules discarded 441 transitions
Performed 441 trivial Post agglomeration. Transition count delta: 441
Iterating post reduction 0 with 441 rules applied. Total rules applied 442 place count 1016 transition count 519
Reduce places removed 441 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 442 rules applied. Total rules applied 884 place count 575 transition count 518
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 885 place count 574 transition count 518
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 891 place count 568 transition count 512
Iterating global reduction 3 with 6 rules applied. Total rules applied 897 place count 568 transition count 512
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 901 place count 568 transition count 508
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 905 place count 564 transition count 508
Applied a total of 905 rules in 72 ms. Remains 564 /1067 variables (removed 503) and now considering 508/1010 (removed 502) transitions.
// Phase 1: matrix 508 rows 564 cols
[2024-06-01 15:30:39] [INFO ] Computed 56 invariants in 3 ms
[2024-06-01 15:30:40] [INFO ] Implicit Places using invariants in 972 ms returned []
[2024-06-01 15:30:40] [INFO ] Invariant cache hit.
[2024-06-01 15:30:43] [INFO ] Implicit Places using invariants and state equation in 3392 ms returned []
Implicit Place search using SMT with State Equation took 4368 ms to find 0 implicit places.
[2024-06-01 15:30:43] [INFO ] Redundant transitions in 2 ms returned []
Running 409 sub problems to find dead transitions.
[2024-06-01 15:30:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 2/467 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 412/879 variables, 467/523 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/879 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 3/882 variables, 2/525 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 882/1072 variables, and 525 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 469/564 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 2/467 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 412/879 variables, 467/523 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/879 variables, 401/924 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 879/1072 variables, and 924 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 467/564 constraints, PredecessorRefiner: 401/409 constraints, Known Traps: 0/0 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Starting structural reductions in SI_LTL mode, iteration 1 : 564/1067 places, 508/1010 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64554 ms. Remains : 564/1067 places, 508/1010 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLCardinality-06
Product exploration explored 100000 steps with 250 reset in 438 ms.
Product exploration explored 100000 steps with 256 reset in 510 ms.
Computed a total of 564 stabilizing places and 508 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 564 transition count 508
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 37 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-50-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-50-LTLCardinality-06 finished in 65901 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 1067 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1067/1067 places, 1010/1010 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1066 transition count 1010
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 1060 transition count 1004
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 1060 transition count 1004
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 1058 transition count 1002
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 1058 transition count 1002
Applied a total of 17 rules in 132 ms. Remains 1058 /1067 variables (removed 9) and now considering 1002/1010 (removed 8) transitions.
// Phase 1: matrix 1002 rows 1058 cols
[2024-06-01 15:31:45] [INFO ] Computed 56 invariants in 8 ms
[2024-06-01 15:31:46] [INFO ] Implicit Places using invariants in 883 ms returned []
[2024-06-01 15:31:46] [INFO ] Invariant cache hit.
[2024-06-01 15:31:55] [INFO ] Implicit Places using invariants and state equation in 9421 ms returned []
Implicit Place search using SMT with State Equation took 10307 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2024-06-01 15:31:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1008 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1008/2060 variables, and 6 constraints, problems are : Problem set: 0 solved, 952 unsolved in 30042 ms.
Refiners :[Generalized P Invariants (flows): 6/56 constraints, State Equation: 0/1058 constraints, PredecessorRefiner: 952/952 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 952 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1008 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1008 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 50/1058 variables, 50/56 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 747)
(s1 1)
(s2 0)
(s3 748)
(s4 0)
(s5 748)
(s6 0)
(s7 748)
(s8 0)
(s9 1)
(s10 0)
(s11 747)
(s12 0)
(s13 746)
(s14 0)
(s15 1)
(s16 0)
(s17 1)
(s18 744)
(s19 1)
(s20 0)
(s21 744)
(s22 0)
(s23 1)
(s24 0)
(s25 742)
(s26 0)
(s27 1)
(s28 0)
(s29 1)
(s30 0)
(s31 1)
(s32 0)
(s33 740)
(s34 0)
(s35 738)
(s36 0)
(s37 1)
(s38 0)
(s39 1)
(s40 0)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 730)
(s47 1)
(s48 0)
(s49 1)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 1)
(s56 0)
(s57 726)
(s58 724)
(s59 1)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 724)
(s66 0)
(s67 722)
(s68 719)
(s69 1)
(s70 718)
(s71 1)
(s72 0)
(s73 1)
(s74 0)
(s75 1)
(s76 0)
(s77 716)
(s78 0)
(s79 1)
(s80 0)
(s81 1)
(s82 0)
(s83 712)
(s84 0)
(s85 710)
(s86 708)
(s87 1)
(s88 707)
(s89 1)
(s90 705)
(s91 1)
(s92 0)
(s93 1)
(s94 701)
(s95 1)
(s96 699)
(s97 1)
(s98 0)
(s99 1)
(s100 1)
(s101 749)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 748)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 746)
(s132 1)
(s133 746)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 743)
(s150 1)
(s151 741)
(s152 1)
(s153 1)
(s154 1)
(s155 740)
(s156 1)
(s157 1)
(s158 1)
(s159 740)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 736)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 734)
(s180 1)
(s181 735)
(s182 1)
(s183 733)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 732)
(s194 1)
(s195 730)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 728)
(s204 1)
(s205 729)
(s206 1)
(s207 727)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 724)
(s224 1)
(s225 724)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1058/2060 variables, and 56 constraints, problems are : Problem set: 0 solved, 952 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 0/1058 constraints, PredecessorRefiner: 0/952 constraints, Known Traps: 0/0 constraints]
After SMT, in 60397ms problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 60408ms
Starting structural reductions in LTL mode, iteration 1 : 1058/1067 places, 1002/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70850 ms. Remains : 1058/1067 places, 1002/1010 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLCardinality-07
Product exploration explored 100000 steps with 160 reset in 513 ms.
Product exploration explored 100000 steps with 160 reset in 586 ms.
Computed a total of 1058 stabilizing places and 1002 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1058 transition count 1002
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2494 steps (0 resets) in 16 ms. (146 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:32:58] [INFO ] Invariant cache hit.
[2024-06-01 15:32:59] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 316 ms returned sat
[2024-06-01 15:33:13] [INFO ] [Real]Absence check using state equation in 13635 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 1058 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1058/1058 places, 1002/1002 transitions.
Reduce places removed 50 places and 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 445 transitions
Trivial Post-agglo rules discarded 445 transitions
Performed 445 trivial Post agglomeration. Transition count delta: 445
Iterating post reduction 0 with 445 rules applied. Total rules applied 445 place count 1008 transition count 507
Reduce places removed 445 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 446 rules applied. Total rules applied 891 place count 563 transition count 506
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 892 place count 562 transition count 506
Applied a total of 892 rules in 35 ms. Remains 562 /1058 variables (removed 496) and now considering 506/1002 (removed 496) transitions.
// Phase 1: matrix 506 rows 562 cols
[2024-06-01 15:33:13] [INFO ] Computed 56 invariants in 3 ms
[2024-06-01 15:33:14] [INFO ] Implicit Places using invariants in 797 ms returned []
[2024-06-01 15:33:14] [INFO ] Invariant cache hit.
[2024-06-01 15:33:17] [INFO ] Implicit Places using invariants and state equation in 3175 ms returned []
Implicit Place search using SMT with State Equation took 3994 ms to find 0 implicit places.
[2024-06-01 15:33:17] [INFO ] Redundant transitions in 3 ms returned []
Running 407 sub problems to find dead transitions.
[2024-06-01 15:33:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (OVERLAPS) 2/465 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/465 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (OVERLAPS) 409/874 variables, 465/521 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/874 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 874/1068 variables, and 521 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 465/562 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 407 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/463 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/463 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 2 (OVERLAPS) 2/465 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/465 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 4 (OVERLAPS) 409/874 variables, 465/521 constraints. Problems are: Problem set: 0 solved, 407 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/874 variables, 407/928 constraints. Problems are: Problem set: 0 solved, 407 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 874/1068 variables, and 928 constraints, problems are : Problem set: 0 solved, 407 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 465/562 constraints, PredecessorRefiner: 407/407 constraints, Known Traps: 0/0 constraints]
After SMT, in 60090ms problems are : Problem set: 0 solved, 407 unsolved
Search for dead transitions found 0 dead transitions in 60095ms
Starting structural reductions in SI_LTL mode, iteration 1 : 562/1058 places, 506/1002 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64136 ms. Remains : 562/1058 places, 506/1002 transitions.
Computed a total of 562 stabilizing places and 506 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 562 transition count 506
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1278 steps (0 resets) in 16 ms. (75 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0)]
[2024-06-01 15:34:18] [INFO ] Invariant cache hit.
[2024-06-01 15:34:19] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 280 ms returned sat
[2024-06-01 15:34:22] [INFO ] [Real]Absence check using state equation in 3745 ms returned sat
[2024-06-01 15:34:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:34:23] [INFO ] [Nat]Absence check using 0 positive and 56 generalized place invariants in 380 ms returned sat
[2024-06-01 15:34:24] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2024-06-01 15:34:24] [INFO ] Computed and/alt/rep : 407/414/407 causal constraints (skipped 0 transitions) in 39 ms.
[2024-06-01 15:34:25] [INFO ] Added : 198 causal constraints over 40 iterations in 1638 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 2882 steps with 8 reset in 15 ms.
FORMULA HirschbergSinclair-PT-50-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-50-LTLCardinality-07 finished in 160490 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||G(p1)))))'
Support contains 3 out of 1067 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1067/1067 places, 1010/1010 transitions.
Graph (complete) has 2026 edges and 1067 vertex of which 1066 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 50 places and 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 441 transitions
Trivial Post-agglo rules discarded 441 transitions
Performed 441 trivial Post agglomeration. Transition count delta: 441
Iterating post reduction 0 with 441 rules applied. Total rules applied 442 place count 1016 transition count 519
Reduce places removed 441 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 443 rules applied. Total rules applied 885 place count 575 transition count 517
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 887 place count 573 transition count 517
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 892 place count 568 transition count 512
Iterating global reduction 3 with 5 rules applied. Total rules applied 897 place count 568 transition count 512
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 901 place count 568 transition count 508
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 905 place count 564 transition count 508
Applied a total of 905 rules in 60 ms. Remains 564 /1067 variables (removed 503) and now considering 508/1010 (removed 502) transitions.
// Phase 1: matrix 508 rows 564 cols
[2024-06-01 15:34:25] [INFO ] Computed 56 invariants in 4 ms
[2024-06-01 15:34:26] [INFO ] Implicit Places using invariants in 959 ms returned []
[2024-06-01 15:34:26] [INFO ] Invariant cache hit.
[2024-06-01 15:34:29] [INFO ] Implicit Places using invariants and state equation in 2983 ms returned []
Implicit Place search using SMT with State Equation took 3960 ms to find 0 implicit places.
[2024-06-01 15:34:29] [INFO ] Redundant transitions in 3 ms returned []
Running 409 sub problems to find dead transitions.
[2024-06-01 15:34:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 2/467 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 412/879 variables, 467/523 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/879 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 1/880 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 880/1072 variables, and 524 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 468/564 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 2/467 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 412/879 variables, 467/523 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/879 variables, 409/932 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 879/1072 variables, and 932 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 467/564 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints]
After SMT, in 60083ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Starting structural reductions in SI_LTL mode, iteration 1 : 564/1067 places, 508/1010 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64122 ms. Remains : 564/1067 places, 508/1010 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLCardinality-09
Product exploration explored 100000 steps with 252 reset in 479 ms.
Product exploration explored 100000 steps with 256 reset in 578 ms.
Computed a total of 564 stabilizing places and 508 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 564 transition count 508
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 270 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1435 steps (0 resets) in 12 ms. (110 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 11 factoid took 585 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 564 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 564/564 places, 508/508 transitions.
Applied a total of 0 rules in 21 ms. Remains 564 /564 variables (removed 0) and now considering 508/508 (removed 0) transitions.
[2024-06-01 15:35:32] [INFO ] Invariant cache hit.
[2024-06-01 15:35:33] [INFO ] Implicit Places using invariants in 938 ms returned []
[2024-06-01 15:35:33] [INFO ] Invariant cache hit.
[2024-06-01 15:35:36] [INFO ] Implicit Places using invariants and state equation in 3100 ms returned []
Implicit Place search using SMT with State Equation took 4040 ms to find 0 implicit places.
[2024-06-01 15:35:36] [INFO ] Redundant transitions in 3 ms returned []
Running 409 sub problems to find dead transitions.
[2024-06-01 15:35:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 2/467 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 412/879 variables, 467/523 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/879 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 1/880 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 880/1072 variables, and 524 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 468/564 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 2/467 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 412/879 variables, 467/523 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/879 variables, 409/932 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 879/1072 variables, and 932 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 467/564 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints]
After SMT, in 60083ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60088ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64157 ms. Remains : 564/564 places, 508/508 transitions.
Computed a total of 564 stabilizing places and 508 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 564 transition count 508
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 296 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 1447 steps (0 resets) in 12 ms. (111 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) p1)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) p1))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 p0))), (F p0), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 11 factoid took 621 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 251 reset in 419 ms.
Product exploration explored 100000 steps with 253 reset in 482 ms.
Support contains 3 out of 564 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 564/564 places, 508/508 transitions.
Applied a total of 0 rules in 28 ms. Remains 564 /564 variables (removed 0) and now considering 508/508 (removed 0) transitions.
[2024-06-01 15:36:39] [INFO ] Invariant cache hit.
[2024-06-01 15:36:40] [INFO ] Implicit Places using invariants in 1043 ms returned []
[2024-06-01 15:36:40] [INFO ] Invariant cache hit.
[2024-06-01 15:36:43] [INFO ] Implicit Places using invariants and state equation in 3044 ms returned []
Implicit Place search using SMT with State Equation took 4099 ms to find 0 implicit places.
[2024-06-01 15:36:43] [INFO ] Redundant transitions in 3 ms returned []
Running 409 sub problems to find dead transitions.
[2024-06-01 15:36:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 2/467 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 412/879 variables, 467/523 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/879 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 409 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 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s104 0.0)
(s105 1.0)
(s106 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 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 1/880 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 880/1072 variables, and 524 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 468/564 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 2/467 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 412/879 variables, 467/523 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/879 variables, 409/932 constraints. Problems are: Problem set: 0 solved, 409 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 879/1072 variables, and 932 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 467/564 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints]
After SMT, in 60078ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 60084ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 64220 ms. Remains : 564/564 places, 508/508 transitions.
Treatment of property HirschbergSinclair-PT-50-LTLCardinality-09 finished in 197558 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&&((p1 U X(p2))||G(F(p3)))))))'
Support contains 7 out of 1067 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1067/1067 places, 1010/1010 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1066 transition count 1010
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 1060 transition count 1004
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 1060 transition count 1004
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 1058 transition count 1002
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 1058 transition count 1002
Applied a total of 17 rules in 126 ms. Remains 1058 /1067 variables (removed 9) and now considering 1002/1010 (removed 8) transitions.
// Phase 1: matrix 1002 rows 1058 cols
[2024-06-01 15:37:43] [INFO ] Computed 56 invariants in 7 ms
[2024-06-01 15:37:44] [INFO ] Implicit Places using invariants in 841 ms returned []
[2024-06-01 15:37:44] [INFO ] Invariant cache hit.
[2024-06-01 15:37:54] [INFO ] Implicit Places using invariants and state equation in 9929 ms returned []
Implicit Place search using SMT with State Equation took 10777 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2024-06-01 15:37:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1008 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1008/2060 variables, and 6 constraints, problems are : Problem set: 0 solved, 952 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 6/56 constraints, State Equation: 0/1058 constraints, PredecessorRefiner: 952/952 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 952 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1008 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1008 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 50/1058 variables, 50/56 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 747)
(s1 1)
(s2 0)
(s3 748)
(s4 0)
(s5 748)
(s6 0)
(s7 748)
(s8 0)
(s9 1)
(s10 0)
(s11 747)
(s12 0)
(s13 746)
(s14 0)
(s15 1)
(s16 0)
(s17 1)
(s18 744)
(s19 1)
(s20 0)
(s21 744)
(s22 0)
(s23 1)
(s24 0)
(s25 742)
(s26 0)
(s27 1)
(s28 0)
(s29 1)
(s30 0)
(s31 1)
(s32 0)
(s33 740)
(s34 0)
(s35 738)
(s36 0)
(s37 1)
(s38 0)
(s39 1)
(s40 0)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 730)
(s47 1)
(s48 0)
(s49 1)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 1)
(s56 0)
(s57 726)
(s58 724)
(s59 1)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 724)
(s66 0)
(s67 722)
(s68 719)
(s69 1)
(s70 718)
(s71 1)
(s72 0)
(s73 1)
(s74 0)
(s75 1)
(s76 0)
(s77 716)
(s78 0)
(s79 1)
(s80 0)
(s81 1)
(s82 0)
(s83 712)
(s84 0)
(s85 710)
(s86 708)
(s87 1)
(s88 707)
(s89 1)
(s90 705)
(s91 1)
(s92 0)
(s93 1)
(s94 701)
(s95 1)
(s96 699)
(s97 1)
(s98 0)
(s99 1)
(s100 1)
(s101 749)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 748)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 746)
(s132 1)
(s133 746)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 743)
(s150 1)
(s151 741)
(s152 1)
(s153 1)
(s154 1)
(s155 740)
(s156 1)
(s157 1)
(s158 1)
(s159 740)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 736)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 734)
(s180 1)
(s181 735)
(s182 1)
(s183 733)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 732)
(s194 1)
(s195 730)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 728)
(s204 1)
(s205 729)
(s206 1)
(s207 727)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 724)
(s224 1)
(s225 724)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 718)
(s244 1)
(s245 1)
(s246 1)
(s247 717)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 715)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 714)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 704)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1058/2060 variables, and 56 constraints, problems are : Problem set: 0 solved, 952 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 0/1058 constraints, PredecessorRefiner: 0/952 constraints, Known Traps: 0/0 constraints]
After SMT, in 60366ms problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 60377ms
Starting structural reductions in LTL mode, iteration 1 : 1058/1067 places, 1002/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71284 ms. Remains : 1058/1067 places, 1002/1010 transitions.
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), true, (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p3)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-50-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-50-LTLCardinality-10 finished in 71656 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(F(!p0))))))'
Support contains 2 out of 1067 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1067/1067 places, 1010/1010 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1066 transition count 1010
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 1060 transition count 1004
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 1060 transition count 1004
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 1058 transition count 1002
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 1058 transition count 1002
Applied a total of 17 rules in 128 ms. Remains 1058 /1067 variables (removed 9) and now considering 1002/1010 (removed 8) transitions.
[2024-06-01 15:38:55] [INFO ] Invariant cache hit.
[2024-06-01 15:38:56] [INFO ] Implicit Places using invariants in 1016 ms returned []
[2024-06-01 15:38:56] [INFO ] Invariant cache hit.
[2024-06-01 15:39:05] [INFO ] Implicit Places using invariants and state equation in 9432 ms returned []
Implicit Place search using SMT with State Equation took 10450 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2024-06-01 15:39:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1008 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1008/2060 variables, and 6 constraints, problems are : Problem set: 0 solved, 952 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 6/56 constraints, State Equation: 0/1058 constraints, PredecessorRefiner: 952/952 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 952 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1008 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1008 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 50/1058 variables, 50/56 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1058/2060 variables, and 56 constraints, problems are : Problem set: 0 solved, 952 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 0/1058 constraints, PredecessorRefiner: 0/952 constraints, Known Traps: 0/0 constraints]
After SMT, in 60348ms problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 60360ms
Starting structural reductions in LTL mode, iteration 1 : 1058/1067 places, 1002/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70941 ms. Remains : 1058/1067 places, 1002/1010 transitions.
Stuttering acceptance computed with spot in 192 ms :[p0, false, false, p0, false]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLCardinality-13
Product exploration explored 100000 steps with 32901 reset in 733 ms.
Stuttering criterion allowed to conclude after 17823 steps with 5503 reset in 133 ms.
FORMULA HirschbergSinclair-PT-50-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-50-LTLCardinality-13 finished in 72029 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(X((p1&&G((p0||X(X(p0))))))))))'
Support contains 3 out of 1067 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1067/1067 places, 1010/1010 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1066 transition count 1010
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 1060 transition count 1004
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 1060 transition count 1004
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 1058 transition count 1002
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 1058 transition count 1002
Applied a total of 17 rules in 126 ms. Remains 1058 /1067 variables (removed 9) and now considering 1002/1010 (removed 8) transitions.
[2024-06-01 15:40:07] [INFO ] Invariant cache hit.
[2024-06-01 15:40:08] [INFO ] Implicit Places using invariants in 892 ms returned []
[2024-06-01 15:40:08] [INFO ] Invariant cache hit.
[2024-06-01 15:40:17] [INFO ] Implicit Places using invariants and state equation in 9906 ms returned []
Implicit Place search using SMT with State Equation took 10801 ms to find 0 implicit places.
Running 952 sub problems to find dead transitions.
[2024-06-01 15:40:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1008 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1008/2060 variables, and 6 constraints, problems are : Problem set: 0 solved, 952 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 6/56 constraints, State Equation: 0/1058 constraints, PredecessorRefiner: 952/952 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 952 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1008 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1008 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 50/1058 variables, 50/56 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 747)
(s1 1)
(s2 0)
(s3 748)
(s4 0)
(s5 748)
(s6 0)
(s7 748)
(s8 0)
(s9 1)
(s10 0)
(s11 747)
(s12 0)
(s13 746)
(s14 0)
(s15 1)
(s16 0)
(s17 1)
(s18 744)
(s19 1)
(s20 0)
(s21 744)
(s22 0)
(s23 1)
(s24 0)
(s25 742)
(s26 0)
(s27 1)
(s28 0)
(s29 1)
(s30 0)
(s31 1)
(s32 0)
(s33 740)
(s34 0)
(s35 738)
(s36 0)
(s37 1)
(s38 0)
(s39 1)
(s40 0)
(s41 1)
(s42 0)
(s43 1)
(s44 0)
(s45 1)
(s46 730)
(s47 1)
(s48 0)
(s49 1)
(s50 0)
(s51 1)
(s52 0)
(s53 1)
(s54 0)
(s55 1)
(s56 0)
(s57 726)
(s58 724)
(s59 1)
(s60 0)
(s61 1)
(s62 0)
(s63 1)
(s64 0)
(s65 724)
(s66 0)
(s67 722)
(s68 719)
(s69 1)
(s70 718)
(s71 1)
(s72 0)
(s73 1)
(s74 0)
(s75 1)
(s76 0)
(s77 716)
(s78 0)
(s79 1)
(s80 0)
(s81 1)
(s82 0)
(s83 712)
(s84 0)
(s85 710)
(s86 708)
(s87 1)
(s88 707)
(s89 1)
(s90 705)
(s91 1)
(s92 0)
(s93 1)
(s94 701)
(s95 1)
(s96 699)
(s97 1)
(s98 0)
(s99 1)
(s100 1)
(s101 749)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 748)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 746)
(s132 1)
(s133 746)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 743)
(s150 1)
(s151 741)
(s152 1)
(s153 1)
(s154 1)
(s155 740)
(s156 1)
(s157 1)
(s158 1)
(s159 740)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 736)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 734)
(s180 1)
(s181 735)
(s182 1)
(s183 733)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 732)
(s194 1)
(s195 730)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 728)
(s204 1)
(s205 729)
(s206 1)
(s207 727)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 724)
(s224 1)
(s225 724)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 718)
(s244 1)
(s245 1)
(s246 1)
(s247 717)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 715)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 714)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 704)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1058/2060 variables, and 56 constraints, problems are : Problem set: 0 solved, 952 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 0/1058 constraints, PredecessorRefiner: 0/952 constraints, Known Traps: 0/0 constraints]
After SMT, in 60427ms problems are : Problem set: 0 solved, 952 unsolved
Search for dead transitions found 0 dead transitions in 60439ms
Starting structural reductions in LTL mode, iteration 1 : 1058/1067 places, 1002/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71371 ms. Remains : 1058/1067 places, 1002/1010 transitions.
Stuttering acceptance computed with spot in 548 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLCardinality-14
Stuttering criterion allowed to conclude after 1086 steps with 0 reset in 6 ms.
FORMULA HirschbergSinclair-PT-50-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-50-LTLCardinality-14 finished in 71964 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) U p1))||X(G(p2))))'
Support contains 6 out of 1067 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1067/1067 places, 1010/1010 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1066 transition count 1010
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 1061 transition count 1005
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 1061 transition count 1005
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 1059 transition count 1003
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 1059 transition count 1003
Applied a total of 15 rules in 128 ms. Remains 1059 /1067 variables (removed 8) and now considering 1003/1010 (removed 7) transitions.
// Phase 1: matrix 1003 rows 1059 cols
[2024-06-01 15:41:19] [INFO ] Computed 56 invariants in 7 ms
[2024-06-01 15:41:20] [INFO ] Implicit Places using invariants in 1006 ms returned []
[2024-06-01 15:41:20] [INFO ] Invariant cache hit.
[2024-06-01 15:41:29] [INFO ] Implicit Places using invariants and state equation in 9751 ms returned []
Implicit Place search using SMT with State Equation took 10770 ms to find 0 implicit places.
Running 953 sub problems to find dead transitions.
[2024-06-01 15:41:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1009 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 953 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1009/2062 variables, and 6 constraints, problems are : Problem set: 0 solved, 953 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 6/56 constraints, State Equation: 0/1059 constraints, PredecessorRefiner: 953/953 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 953 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1009 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 953 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1009 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 953 unsolved
At refinement iteration 2 (OVERLAPS) 50/1059 variables, 50/56 constraints. Problems are: Problem set: 0 solved, 953 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1059/2062 variables, and 56 constraints, problems are : Problem set: 0 solved, 953 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 0/1059 constraints, PredecessorRefiner: 0/953 constraints, Known Traps: 0/0 constraints]
After SMT, in 60357ms problems are : Problem set: 0 solved, 953 unsolved
Search for dead transitions found 0 dead transitions in 60367ms
Starting structural reductions in LTL mode, iteration 1 : 1059/1067 places, 1003/1010 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71269 ms. Remains : 1059/1067 places, 1003/1010 transitions.
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-50-LTLCardinality-15
Product exploration explored 100000 steps with 544 reset in 827 ms.
Product exploration explored 100000 steps with 544 reset in 917 ms.
Computed a total of 1059 stabilizing places and 1003 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1059 transition count 1003
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 21 factoid took 220 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 655 steps (0 resets) in 10 ms. (59 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 21 factoid took 257 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
[2024-06-01 15:42:33] [INFO ] Invariant cache hit.
[2024-06-01 15:42:34] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 316 ms returned sat
[2024-06-01 15:42:40] [INFO ] [Real]Absence check using state equation in 5950 ms returned sat
[2024-06-01 15:42:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:42:42] [INFO ] [Nat]Absence check using 0 positive and 56 generalized place invariants in 442 ms returned sat
[2024-06-01 15:42:55] [INFO ] [Nat]Absence check using state equation in 13684 ms returned unknown
Could not prove EG (NOT p1)
Support contains 2 out of 1059 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1059/1059 places, 1003/1003 transitions.
Reduce places removed 50 places and 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 440 transitions
Trivial Post-agglo rules discarded 440 transitions
Performed 440 trivial Post agglomeration. Transition count delta: 440
Iterating post reduction 0 with 440 rules applied. Total rules applied 440 place count 1009 transition count 513
Reduce places removed 440 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 441 rules applied. Total rules applied 881 place count 569 transition count 512
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 882 place count 568 transition count 512
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 884 place count 567 transition count 511
Applied a total of 884 rules in 48 ms. Remains 567 /1059 variables (removed 492) and now considering 511/1003 (removed 492) transitions.
// Phase 1: matrix 511 rows 567 cols
[2024-06-01 15:42:55] [INFO ] Computed 56 invariants in 16 ms
[2024-06-01 15:42:56] [INFO ] Implicit Places using invariants in 958 ms returned []
[2024-06-01 15:42:56] [INFO ] Invariant cache hit.
[2024-06-01 15:43:00] [INFO ] Implicit Places using invariants and state equation in 3268 ms returned []
Implicit Place search using SMT with State Equation took 4239 ms to find 0 implicit places.
[2024-06-01 15:43:00] [INFO ] Redundant transitions in 3 ms returned []
Running 412 sub problems to find dead transitions.
[2024-06-01 15:43:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 2/470 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (OVERLAPS) 415/885 variables, 470/526 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/885 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (OVERLAPS) 1/886 variables, 1/527 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 886/1078 variables, and 527 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 471/567 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 2/470 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (OVERLAPS) 415/885 variables, 470/526 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/885 variables, 412/938 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 885/1078 variables, and 938 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 470/567 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints]
After SMT, in 60079ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60083ms
Starting structural reductions in SI_LTL mode, iteration 1 : 567/1059 places, 511/1003 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64383 ms. Remains : 567/1059 places, 511/1003 transitions.
Computed a total of 567 stabilizing places and 511 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 567 transition count 511
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 338 steps (0 resets) in 8 ms. (37 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
[2024-06-01 15:44:01] [INFO ] Invariant cache hit.
[2024-06-01 15:44:02] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 470 ms returned sat
[2024-06-01 15:44:11] [INFO ] [Real]Absence check using state equation in 8932 ms returned sat
[2024-06-01 15:44:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:44:11] [INFO ] [Nat]Absence check using 0 positive and 56 generalized place invariants in 216 ms returned sat
[2024-06-01 15:44:19] [INFO ] [Nat]Absence check using state equation in 7284 ms returned sat
[2024-06-01 15:44:19] [INFO ] Computed and/alt/rep : 412/419/412 causal constraints (skipped 0 transitions) in 37 ms.
[2024-06-01 15:44:24] [INFO ] Added : 241 causal constraints over 49 iterations in 5260 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1027 reset in 942 ms.
Product exploration explored 100000 steps with 1018 reset in 1030 ms.
Support contains 2 out of 567 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 567/567 places, 511/511 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 567 transition count 507
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 563 transition count 507
Applied a total of 8 rules in 23 ms. Remains 563 /567 variables (removed 4) and now considering 507/511 (removed 4) transitions.
// Phase 1: matrix 507 rows 563 cols
[2024-06-01 15:44:26] [INFO ] Computed 56 invariants in 3 ms
[2024-06-01 15:44:27] [INFO ] Implicit Places using invariants in 864 ms returned []
[2024-06-01 15:44:27] [INFO ] Invariant cache hit.
[2024-06-01 15:44:30] [INFO ] Implicit Places using invariants and state equation in 3449 ms returned []
Implicit Place search using SMT with State Equation took 4332 ms to find 0 implicit places.
[2024-06-01 15:44:30] [INFO ] Redundant transitions in 3 ms returned []
Running 408 sub problems to find dead transitions.
[2024-06-01 15:44:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (OVERLAPS) 2/466 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (OVERLAPS) 411/877 variables, 466/522 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 877/1070 variables, and 522 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 466/563 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 408 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (OVERLAPS) 2/466 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (OVERLAPS) 411/877 variables, 466/522 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/877 variables, 408/930 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 877/1070 variables, and 930 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 466/563 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 0/0 constraints]
After SMT, in 60089ms problems are : Problem set: 0 solved, 408 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in SI_LTL mode, iteration 1 : 563/567 places, 507/511 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64463 ms. Remains : 563/567 places, 507/511 transitions.
Treatment of property HirschbergSinclair-PT-50-LTLCardinality-15 finished in 252086 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p0)&&G((p1&&(p1 U X(p2))))))))'
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||G(p1)))))'
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) U p1))||X(G(p2))))'
Found a Lengthening insensitive property : HirschbergSinclair-PT-50-LTLCardinality-15
Stuttering acceptance computed with spot in 343 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p1)]
Support contains 6 out of 1067 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1067/1067 places, 1010/1010 transitions.
Graph (complete) has 2026 edges and 1067 vertex of which 1066 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 50 places and 50 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 439 transitions
Trivial Post-agglo rules discarded 439 transitions
Performed 439 trivial Post agglomeration. Transition count delta: 439
Iterating post reduction 0 with 439 rules applied. Total rules applied 440 place count 1016 transition count 521
Reduce places removed 439 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 440 rules applied. Total rules applied 880 place count 577 transition count 520
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 881 place count 576 transition count 520
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 886 place count 571 transition count 515
Iterating global reduction 3 with 5 rules applied. Total rules applied 891 place count 571 transition count 515
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 3 rules applied. Total rules applied 894 place count 571 transition count 512
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 897 place count 568 transition count 512
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 899 place count 567 transition count 511
Applied a total of 899 rules in 106 ms. Remains 567 /1067 variables (removed 500) and now considering 511/1010 (removed 499) transitions.
// Phase 1: matrix 511 rows 567 cols
[2024-06-01 15:45:32] [INFO ] Computed 56 invariants in 4 ms
[2024-06-01 15:45:33] [INFO ] Implicit Places using invariants in 1422 ms returned []
[2024-06-01 15:45:33] [INFO ] Invariant cache hit.
[2024-06-01 15:45:37] [INFO ] Implicit Places using invariants and state equation in 3533 ms returned []
Implicit Place search using SMT with State Equation took 4958 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-06-01 15:45:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 2/470 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (OVERLAPS) 415/885 variables, 470/526 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 885/1078 variables, and 526 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 470/567 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 2/470 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (OVERLAPS) 415/885 variables, 470/526 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/885 variables, 412/938 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 885/1078 variables, and 938 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 470/567 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints]
After SMT, in 60126ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60134ms
Starting structural reductions in LI_LTL mode, iteration 1 : 567/1067 places, 511/1010 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 65201 ms. Remains : 567/1067 places, 511/1010 transitions.
Running random walk in product with property : HirschbergSinclair-PT-50-LTLCardinality-15
Product exploration explored 100000 steps with 1041 reset in 1250 ms.
Product exploration explored 100000 steps with 1059 reset in 1021 ms.
Computed a total of 567 stabilizing places and 511 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 567 transition count 511
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 659 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 530 steps (0 resets) in 10 ms. (48 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F p1)]
Knowledge based reduction with 19 factoid took 928 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1)]
[2024-06-01 15:46:42] [INFO ] Invariant cache hit.
[2024-06-01 15:46:43] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 677 ms returned sat
[2024-06-01 15:46:52] [INFO ] [Real]Absence check using state equation in 9114 ms returned sat
[2024-06-01 15:46:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:46:53] [INFO ] [Nat]Absence check using 0 positive and 56 generalized place invariants in 300 ms returned sat
[2024-06-01 15:47:02] [INFO ] [Nat]Absence check using state equation in 8338 ms returned sat
[2024-06-01 15:47:02] [INFO ] Computed and/alt/rep : 412/419/412 causal constraints (skipped 0 transitions) in 44 ms.
[2024-06-01 15:47:07] [INFO ] Added : 195 causal constraints over 39 iterations in 5632 ms. Result :unknown
Could not prove EG (NOT p1)
Support contains 2 out of 567 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 567/567 places, 511/511 transitions.
Applied a total of 0 rules in 28 ms. Remains 567 /567 variables (removed 0) and now considering 511/511 (removed 0) transitions.
[2024-06-01 15:47:07] [INFO ] Invariant cache hit.
[2024-06-01 15:47:09] [INFO ] Implicit Places using invariants in 1440 ms returned []
[2024-06-01 15:47:09] [INFO ] Invariant cache hit.
[2024-06-01 15:47:13] [INFO ] Implicit Places using invariants and state equation in 4403 ms returned []
Implicit Place search using SMT with State Equation took 5851 ms to find 0 implicit places.
[2024-06-01 15:47:13] [INFO ] Redundant transitions in 3 ms returned []
Running 412 sub problems to find dead transitions.
[2024-06-01 15:47:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 2/470 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (OVERLAPS) 415/885 variables, 470/526 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 885/1078 variables, and 526 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 470/567 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 2/470 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (OVERLAPS) 415/885 variables, 470/526 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/885 variables, 412/938 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 885/1078 variables, and 938 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 470/567 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 0/0 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60105ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65997 ms. Remains : 567/567 places, 511/511 transitions.
Computed a total of 567 stabilizing places and 511 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 567 transition count 511
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 226 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 453 steps (0 resets) in 11 ms. (37 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 3 factoid took 221 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1)]
[2024-06-01 15:48:15] [INFO ] Invariant cache hit.
[2024-06-01 15:48:16] [INFO ] [Real]Absence check using 0 positive and 56 generalized place invariants in 684 ms returned sat
[2024-06-01 15:48:25] [INFO ] [Real]Absence check using state equation in 8567 ms returned sat
[2024-06-01 15:48:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:48:26] [INFO ] [Nat]Absence check using 0 positive and 56 generalized place invariants in 329 ms returned sat
[2024-06-01 15:48:33] [INFO ] [Nat]Absence check using state equation in 7350 ms returned sat
[2024-06-01 15:48:33] [INFO ] Computed and/alt/rep : 412/419/412 causal constraints (skipped 0 transitions) in 60 ms.
[2024-06-01 15:48:40] [INFO ] Added : 200 causal constraints over 40 iterations in 6662 ms. Result :unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1042 reset in 1179 ms.
Product exploration explored 100000 steps with 1032 reset in 1143 ms.
Support contains 2 out of 567 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 567/567 places, 511/511 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 567 transition count 507
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 563 transition count 507
Applied a total of 8 rules in 22 ms. Remains 563 /567 variables (removed 4) and now considering 507/511 (removed 4) transitions.
// Phase 1: matrix 507 rows 563 cols
[2024-06-01 15:48:42] [INFO ] Computed 56 invariants in 3 ms
[2024-06-01 15:48:43] [INFO ] Implicit Places using invariants in 1122 ms returned []
[2024-06-01 15:48:43] [INFO ] Invariant cache hit.
[2024-06-01 15:48:47] [INFO ] Implicit Places using invariants and state equation in 3388 ms returned []
Implicit Place search using SMT with State Equation took 4534 ms to find 0 implicit places.
[2024-06-01 15:48:47] [INFO ] Redundant transitions in 3 ms returned []
Running 408 sub problems to find dead transitions.
[2024-06-01 15:48:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (OVERLAPS) 2/466 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (OVERLAPS) 411/877 variables, 466/522 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 877/1070 variables, and 522 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 466/563 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 408 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/464 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (OVERLAPS) 2/466 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (OVERLAPS) 411/877 variables, 466/522 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/877 variables, 408/930 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 877/1070 variables, and 930 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30046 ms.
Refiners :[Generalized P Invariants (flows): 56/56 constraints, State Equation: 466/563 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 0/0 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 408 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Starting structural reductions in SI_LTL mode, iteration 1 : 563/567 places, 507/511 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64693 ms. Remains : 563/567 places, 507/511 transitions.
Treatment of property HirschbergSinclair-PT-50-LTLCardinality-15 finished in 255530 ms.
[2024-06-01 15:49:47] [INFO ] Flatten gal took : 120 ms
[2024-06-01 15:49:47] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-01 15:49:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1067 places, 1010 transitions and 3035 arcs took 31 ms.
Total runtime 1801022 ms.
There are residual formulas that ITS could not solve within timeout

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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024

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="HirschbergSinclair-PT-50"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is HirschbergSinclair-PT-50, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r500-smll-171649587500131"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-50.tgz
mv HirschbergSinclair-PT-50 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;