Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 17:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 11 17:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 38M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716992704338

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-08b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-29 14:25:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 14:25:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 14:25:07] [INFO ] Load time of PNML (sax parser for PT used): 1610 ms
[2024-05-29 14:25:07] [INFO ] Transformed 2746 places.
[2024-05-29 14:25:07] [INFO ] Transformed 42776 transitions.
[2024-05-29 14:25:07] [INFO ] Found NUPN structural information;
[2024-05-29 14:25:07] [INFO ] Parsed PT model containing 2746 places and 42776 transitions and 723933 arcs in 2004 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 19 ms.
Initial state reduction rules removed 2 formulas.
FORMULA StigmergyCommit-PT-08b-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-08b-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 128 out of 2746 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2746/2746 places, 42776/42776 transitions.
Discarding 208 places :
Symmetric choice reduction at 0 with 208 rule applications. Total rules 208 place count 2538 transition count 42568
Iterating global reduction 0 with 208 rules applied. Total rules applied 416 place count 2538 transition count 42568
Discarding 127 places :
Symmetric choice reduction at 0 with 127 rule applications. Total rules 543 place count 2411 transition count 42441
Iterating global reduction 0 with 127 rules applied. Total rules applied 670 place count 2411 transition count 42441
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 741 place count 2340 transition count 42370
Iterating global reduction 0 with 71 rules applied. Total rules applied 812 place count 2340 transition count 42370
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 870 place count 2282 transition count 42312
Iterating global reduction 0 with 58 rules applied. Total rules applied 928 place count 2282 transition count 42312
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 973 place count 2237 transition count 42267
Iterating global reduction 0 with 45 rules applied. Total rules applied 1018 place count 2237 transition count 42267
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 1063 place count 2192 transition count 42222
Iterating global reduction 0 with 45 rules applied. Total rules applied 1108 place count 2192 transition count 42222
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 1151 place count 2149 transition count 42179
Iterating global reduction 0 with 43 rules applied. Total rules applied 1194 place count 2149 transition count 42179
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 1235 place count 2108 transition count 42138
Iterating global reduction 0 with 41 rules applied. Total rules applied 1276 place count 2108 transition count 42138
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 1306 place count 2078 transition count 42108
Iterating global reduction 0 with 30 rules applied. Total rules applied 1336 place count 2078 transition count 42108
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 1355 place count 2059 transition count 42089
Iterating global reduction 0 with 19 rules applied. Total rules applied 1374 place count 2059 transition count 42089
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 1377 place count 2059 transition count 42086
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 1388 place count 2048 transition count 42075
Iterating global reduction 1 with 11 rules applied. Total rules applied 1399 place count 2048 transition count 42075
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 1409 place count 2038 transition count 42065
Iterating global reduction 1 with 10 rules applied. Total rules applied 1419 place count 2038 transition count 42065
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 1423 place count 2034 transition count 42061
Iterating global reduction 1 with 4 rules applied. Total rules applied 1427 place count 2034 transition count 42061
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 1431 place count 2030 transition count 42057
Iterating global reduction 1 with 4 rules applied. Total rules applied 1435 place count 2030 transition count 42057
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1438 place count 2027 transition count 42054
Iterating global reduction 1 with 3 rules applied. Total rules applied 1441 place count 2027 transition count 42054
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1444 place count 2024 transition count 42051
Iterating global reduction 1 with 3 rules applied. Total rules applied 1447 place count 2024 transition count 42051
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1450 place count 2021 transition count 42048
Iterating global reduction 1 with 3 rules applied. Total rules applied 1453 place count 2021 transition count 42048
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1456 place count 2018 transition count 42045
Iterating global reduction 1 with 3 rules applied. Total rules applied 1459 place count 2018 transition count 42045
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1462 place count 2015 transition count 42042
Iterating global reduction 1 with 3 rules applied. Total rules applied 1465 place count 2015 transition count 42042
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1468 place count 2012 transition count 42039
Iterating global reduction 1 with 3 rules applied. Total rules applied 1471 place count 2012 transition count 42039
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1473 place count 2010 transition count 42037
Iterating global reduction 1 with 2 rules applied. Total rules applied 1475 place count 2010 transition count 42037
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 1477 place count 2008 transition count 42035
Iterating global reduction 1 with 2 rules applied. Total rules applied 1479 place count 2008 transition count 42035
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 1481 place count 2008 transition count 42033
Applied a total of 1481 rules in 11319 ms. Remains 2008 /2746 variables (removed 738) and now considering 42033/42776 (removed 743) transitions.
// Phase 1: matrix 42033 rows 2008 cols
[2024-05-29 14:25:20] [INFO ] Computed 10 invariants in 1059 ms
[2024-05-29 14:25:33] [INFO ] Implicit Places using invariants in 14611 ms returned []
Implicit Place search using SMT only with invariants took 14654 ms to find 0 implicit places.
Running 42032 sub problems to find dead transitions.
[2024-05-29 14:25:34] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2007/44041 variables, and 0 constraints, problems are : Problem set: 0 solved, 42032 unsolved in 30545 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/2008 constraints, PredecessorRefiner: 42032/2612 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42032 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2007/44041 variables, and 0 constraints, problems are : Problem set: 0 solved, 42032 unsolved in 30487 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/2008 constraints, PredecessorRefiner: 39420/2612 constraints, Known Traps: 0/0 constraints]
After SMT, in 776235ms problems are : Problem set: 0 solved, 42032 unsolved
Search for dead transitions found 0 dead transitions in 776743ms
Starting structural reductions in LTL mode, iteration 1 : 2008/2746 places, 42033/42776 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 802907 ms. Remains : 2008/2746 places, 42033/42776 transitions.
Support contains 128 out of 2008 places after structural reductions.
[2024-05-29 14:38:34] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-29 14:38:35] [INFO ] Flatten gal took : 4016 ms
FORMULA StigmergyCommit-PT-08b-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-08b-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 14:38:39] [INFO ] Flatten gal took : 3905 ms
[2024-05-29 14:38:48] [INFO ] Input system was already deterministic with 42033 transitions.
Support contains 116 out of 2008 places (down from 128) after GAL structural reductions.
RANDOM walk for 40000 steps (243 resets) in 2905 ms. (13 steps per ms) remains 40/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 40/40 properties
[2024-05-29 14:38:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 1927/1994 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1994 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (OVERLAPS) 14/2008 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2008 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
SMT process timed out in 5613ms, After SMT, problems are : Problem set: 0 solved, 40 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 67 out of 2008 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2008/2008 places, 42033/42033 transitions.
Graph (trivial) has 1876 edges and 2008 vertex of which 128 / 2008 are part of one of the 23 SCC in 15 ms
Free SCC test removed 105 places
Drop transitions (Empty/Sink Transition effects.) removed 142 transitions
Reduce isomorphic transitions removed 142 transitions.
Graph (complete) has 3950 edges and 1903 vertex of which 1895 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.133 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1330 transitions
Trivial Post-agglo rules discarded 1330 transitions
Performed 1330 trivial Post agglomeration. Transition count delta: 1330
Iterating post reduction 0 with 1337 rules applied. Total rules applied 1339 place count 1895 transition count 40554
Reduce places removed 1330 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 1349 rules applied. Total rules applied 2688 place count 565 transition count 40535
Reduce places removed 9 places and 0 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Iterating post reduction 2 with 38 rules applied. Total rules applied 2726 place count 556 transition count 40506
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 33 rules applied. Total rules applied 2759 place count 527 transition count 40502
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2761 place count 525 transition count 40502
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 106 Pre rules applied. Total rules applied 2761 place count 525 transition count 40396
Deduced a syphon composed of 106 places in 22 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 5 with 212 rules applied. Total rules applied 2973 place count 419 transition count 40396
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 2978 place count 414 transition count 40391
Iterating global reduction 5 with 5 rules applied. Total rules applied 2983 place count 414 transition count 40391
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2983 place count 414 transition count 40390
Deduced a syphon composed of 1 places in 25 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2985 place count 413 transition count 40390
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 2988 place count 410 transition count 40387
Iterating global reduction 5 with 3 rules applied. Total rules applied 2991 place count 410 transition count 40387
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2992 place count 410 transition count 40386
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2993 place count 409 transition count 40385
Iterating global reduction 6 with 1 rules applied. Total rules applied 2994 place count 409 transition count 40385
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2995 place count 408 transition count 40384
Iterating global reduction 6 with 1 rules applied. Total rules applied 2996 place count 408 transition count 40384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2997 place count 408 transition count 40383
Performed 70 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 70 places in 32 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 7 with 140 rules applied. Total rules applied 3137 place count 338 transition count 40311
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 7 with 13 rules applied. Total rules applied 3150 place count 338 transition count 40298
Discarding 40 places :
Symmetric choice reduction at 8 with 40 rule applications. Total rules 3190 place count 298 transition count 1917
Iterating global reduction 8 with 40 rules applied. Total rules applied 3230 place count 298 transition count 1917
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 3248 place count 298 transition count 1899
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 3257 place count 289 transition count 1890
Iterating global reduction 9 with 9 rules applied. Total rules applied 3266 place count 289 transition count 1890
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 3273 place count 282 transition count 1883
Iterating global reduction 9 with 7 rules applied. Total rules applied 3280 place count 282 transition count 1883
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 3281 place count 282 transition count 1882
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 10 with 24 rules applied. Total rules applied 3305 place count 270 transition count 1870
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 3313 place count 266 transition count 1889
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 3315 place count 266 transition count 1887
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 11 with 6 rules applied. Total rules applied 3321 place count 266 transition count 1881
Free-agglomeration rule applied 70 times.
Iterating global reduction 11 with 70 rules applied. Total rules applied 3391 place count 266 transition count 1811
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 11 with 70 rules applied. Total rules applied 3461 place count 196 transition count 1811
Renaming transitions due to excessive name length > 1024 char.
Discarding 7 places :
Symmetric choice reduction at 12 with 7 rule applications. Total rules 3468 place count 189 transition count 1804
Iterating global reduction 12 with 7 rules applied. Total rules applied 3475 place count 189 transition count 1804
Drop transitions (Redundant composition of simpler transitions.) removed 518 transitions
Redundant transition composition rules discarded 518 transitions
Iterating global reduction 12 with 518 rules applied. Total rules applied 3993 place count 189 transition count 1286
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 12 with 3 rules applied. Total rules applied 3996 place count 189 transition count 1283
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 3999 place count 186 transition count 1283
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 13 with 9 rules applied. Total rules applied 4008 place count 186 transition count 1283
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 13 with 6 rules applied. Total rules applied 4014 place count 186 transition count 1277
Applied a total of 4014 rules in 17028 ms. Remains 186 /2008 variables (removed 1822) and now considering 1277/42033 (removed 40756) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17030 ms. Remains : 186/2008 places, 1277/42033 transitions.
RANDOM walk for 40000 steps (991 resets) in 1051 ms. (38 steps per ms) remains 25/40 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (9 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (9 resets) in 32 ms. (121 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (10 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (10 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (10 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (10 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (10 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (11 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (9 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (10 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (10 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (9 resets) in 12 ms. (307 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (10 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (11 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
// Phase 1: matrix 1277 rows 186 cols
[2024-05-29 14:39:12] [INFO ] Computed 9 invariants in 13 ms
[2024-05-29 14:39:13] [INFO ] State equation strengthened by 1097 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 129/167 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 1/168 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 1259/1427 variables, 168/177 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1427 variables, 571/748 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1427 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 19/1446 variables, 8/756 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1446 variables, 523/1279 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1446 variables, 0/1279 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (OVERLAPS) 14/1460 variables, 7/1286 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1460 variables, 3/1289 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1460 variables, 0/1289 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 14 (OVERLAPS) 3/1463 variables, 3/1292 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1463 variables, 0/1292 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 16 (OVERLAPS) 0/1463 variables, 0/1292 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1463/1463 variables, and 1292 constraints, problems are : Problem set: 0 solved, 25 unsolved in 7743 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 186/186 constraints, ReadFeed: 1097/1097 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 129/167 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-29 14:39:21] [INFO ] Deduced a trap composed of 29 places in 404 ms of which 20 ms to minimize.
[2024-05-29 14:39:21] [INFO ] Deduced a trap composed of 19 places in 399 ms of which 2 ms to minimize.
[2024-05-29 14:39:22] [INFO ] Deduced a trap composed of 22 places in 371 ms of which 2 ms to minimize.
[2024-05-29 14:39:22] [INFO ] Deduced a trap composed of 21 places in 328 ms of which 2 ms to minimize.
[2024-05-29 14:39:22] [INFO ] Deduced a trap composed of 26 places in 301 ms of which 1 ms to minimize.
[2024-05-29 14:39:23] [INFO ] Deduced a trap composed of 26 places in 288 ms of which 1 ms to minimize.
[2024-05-29 14:39:23] [INFO ] Deduced a trap composed of 20 places in 300 ms of which 2 ms to minimize.
[2024-05-29 14:39:23] [INFO ] Deduced a trap composed of 30 places in 291 ms of which 1 ms to minimize.
[2024-05-29 14:39:24] [INFO ] Deduced a trap composed of 21 places in 258 ms of which 1 ms to minimize.
[2024-05-29 14:39:24] [INFO ] Deduced a trap composed of 25 places in 225 ms of which 1 ms to minimize.
[2024-05-29 14:39:24] [INFO ] Deduced a trap composed of 26 places in 234 ms of which 3 ms to minimize.
[2024-05-29 14:39:24] [INFO ] Deduced a trap composed of 22 places in 226 ms of which 1 ms to minimize.
[2024-05-29 14:39:24] [INFO ] Deduced a trap composed of 21 places in 197 ms of which 1 ms to minimize.
[2024-05-29 14:39:25] [INFO ] Deduced a trap composed of 20 places in 270 ms of which 2 ms to minimize.
[2024-05-29 14:39:25] [INFO ] Deduced a trap composed of 31 places in 291 ms of which 1 ms to minimize.
[2024-05-29 14:39:25] [INFO ] Deduced a trap composed of 25 places in 257 ms of which 0 ms to minimize.
[2024-05-29 14:39:26] [INFO ] Deduced a trap composed of 28 places in 307 ms of which 1 ms to minimize.
[2024-05-29 14:39:26] [INFO ] Deduced a trap composed of 24 places in 294 ms of which 1 ms to minimize.
[2024-05-29 14:39:26] [INFO ] Deduced a trap composed of 32 places in 293 ms of which 1 ms to minimize.
[2024-05-29 14:39:27] [INFO ] Deduced a trap composed of 31 places in 325 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-29 14:39:27] [INFO ] Deduced a trap composed of 20 places in 275 ms of which 1 ms to minimize.
[2024-05-29 14:39:27] [INFO ] Deduced a trap composed of 12 places in 266 ms of which 1 ms to minimize.
[2024-05-29 14:39:27] [INFO ] Deduced a trap composed of 16 places in 257 ms of which 1 ms to minimize.
[2024-05-29 14:39:28] [INFO ] Deduced a trap composed of 26 places in 257 ms of which 1 ms to minimize.
[2024-05-29 14:39:28] [INFO ] Deduced a trap composed of 26 places in 229 ms of which 1 ms to minimize.
[2024-05-29 14:39:28] [INFO ] Deduced a trap composed of 35 places in 223 ms of which 0 ms to minimize.
[2024-05-29 14:39:28] [INFO ] Deduced a trap composed of 19 places in 250 ms of which 1 ms to minimize.
[2024-05-29 14:39:29] [INFO ] Deduced a trap composed of 19 places in 245 ms of which 1 ms to minimize.
[2024-05-29 14:39:29] [INFO ] Deduced a trap composed of 26 places in 247 ms of which 1 ms to minimize.
[2024-05-29 14:39:29] [INFO ] Deduced a trap composed of 26 places in 216 ms of which 1 ms to minimize.
[2024-05-29 14:39:29] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 1 ms to minimize.
[2024-05-29 14:39:30] [INFO ] Deduced a trap composed of 25 places in 275 ms of which 1 ms to minimize.
[2024-05-29 14:39:30] [INFO ] Deduced a trap composed of 35 places in 278 ms of which 1 ms to minimize.
[2024-05-29 14:39:30] [INFO ] Deduced a trap composed of 20 places in 256 ms of which 2 ms to minimize.
[2024-05-29 14:39:30] [INFO ] Deduced a trap composed of 26 places in 292 ms of which 4 ms to minimize.
[2024-05-29 14:39:31] [INFO ] Deduced a trap composed of 33 places in 284 ms of which 1 ms to minimize.
[2024-05-29 14:39:31] [INFO ] Deduced a trap composed of 30 places in 303 ms of which 1 ms to minimize.
[2024-05-29 14:39:31] [INFO ] Deduced a trap composed of 17 places in 319 ms of which 1 ms to minimize.
[2024-05-29 14:39:32] [INFO ] Deduced a trap composed of 20 places in 339 ms of which 1 ms to minimize.
[2024-05-29 14:39:32] [INFO ] Deduced a trap composed of 16 places in 278 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-29 14:39:32] [INFO ] Deduced a trap composed of 20 places in 203 ms of which 0 ms to minimize.
[2024-05-29 14:39:33] [INFO ] Deduced a trap composed of 16 places in 270 ms of which 0 ms to minimize.
Problem AtomicPropp31 is UNSAT
[2024-05-29 14:39:33] [INFO ] Deduced a trap composed of 20 places in 306 ms of which 0 ms to minimize.
[2024-05-29 14:39:33] [INFO ] Deduced a trap composed of 26 places in 278 ms of which 1 ms to minimize.
[2024-05-29 14:39:34] [INFO ] Deduced a trap composed of 26 places in 302 ms of which 1 ms to minimize.
[2024-05-29 14:39:34] [INFO ] Deduced a trap composed of 28 places in 281 ms of which 1 ms to minimize.
[2024-05-29 14:39:34] [INFO ] Deduced a trap composed of 20 places in 258 ms of which 1 ms to minimize.
[2024-05-29 14:39:34] [INFO ] Deduced a trap composed of 28 places in 246 ms of which 1 ms to minimize.
[2024-05-29 14:39:35] [INFO ] Deduced a trap composed of 18 places in 272 ms of which 1 ms to minimize.
[2024-05-29 14:39:35] [INFO ] Deduced a trap composed of 27 places in 223 ms of which 1 ms to minimize.
[2024-05-29 14:39:35] [INFO ] Deduced a trap composed of 21 places in 196 ms of which 0 ms to minimize.
[2024-05-29 14:39:35] [INFO ] Deduced a trap composed of 22 places in 171 ms of which 1 ms to minimize.
[2024-05-29 14:39:36] [INFO ] Deduced a trap composed of 18 places in 231 ms of which 1 ms to minimize.
[2024-05-29 14:39:36] [INFO ] Deduced a trap composed of 21 places in 187 ms of which 1 ms to minimize.
[2024-05-29 14:39:36] [INFO ] Deduced a trap composed of 25 places in 231 ms of which 0 ms to minimize.
[2024-05-29 14:39:36] [INFO ] Deduced a trap composed of 15 places in 251 ms of which 2 ms to minimize.
[2024-05-29 14:39:36] [INFO ] Deduced a trap composed of 28 places in 214 ms of which 1 ms to minimize.
[2024-05-29 14:39:37] [INFO ] Deduced a trap composed of 31 places in 219 ms of which 1 ms to minimize.
[2024-05-29 14:39:37] [INFO ] Deduced a trap composed of 21 places in 193 ms of which 1 ms to minimize.
[2024-05-29 14:39:37] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 1 ms to minimize.
Problem AtomicPropp31 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 20/68 constraints. Problems are: Problem set: 1 solved, 24 unsolved
[2024-05-29 14:39:37] [INFO ] Deduced a trap composed of 20 places in 277 ms of which 1 ms to minimize.
[2024-05-29 14:39:38] [INFO ] Deduced a trap composed of 22 places in 257 ms of which 1 ms to minimize.
[2024-05-29 14:39:38] [INFO ] Deduced a trap composed of 27 places in 224 ms of which 1 ms to minimize.
[2024-05-29 14:39:38] [INFO ] Deduced a trap composed of 20 places in 211 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 4/72 constraints. Problems are: Problem set: 1 solved, 24 unsolved
[2024-05-29 14:39:39] [INFO ] Deduced a trap composed of 24 places in 260 ms of which 1 ms to minimize.
[2024-05-29 14:39:39] [INFO ] Deduced a trap composed of 31 places in 283 ms of which 1 ms to minimize.
[2024-05-29 14:39:39] [INFO ] Deduced a trap composed of 18 places in 248 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/167 variables, 3/75 constraints. Problems are: Problem set: 1 solved, 24 unsolved
[2024-05-29 14:39:39] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 1 ms to minimize.
[2024-05-29 14:39:40] [INFO ] Deduced a trap composed of 20 places in 180 ms of which 0 ms to minimize.
[2024-05-29 14:39:40] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 1 ms to minimize.
[2024-05-29 14:39:40] [INFO ] Deduced a trap composed of 33 places in 220 ms of which 1 ms to minimize.
[2024-05-29 14:39:40] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 1 ms to minimize.
[2024-05-29 14:39:41] [INFO ] Deduced a trap composed of 32 places in 311 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 6/81 constraints. Problems are: Problem set: 1 solved, 24 unsolved
[2024-05-29 14:39:41] [INFO ] Deduced a trap composed of 27 places in 214 ms of which 1 ms to minimize.
[2024-05-29 14:39:41] [INFO ] Deduced a trap composed of 33 places in 260 ms of which 1 ms to minimize.
[2024-05-29 14:39:42] [INFO ] Deduced a trap composed of 27 places in 258 ms of which 1 ms to minimize.
[2024-05-29 14:39:42] [INFO ] Deduced a trap composed of 25 places in 222 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 4/85 constraints. Problems are: Problem set: 1 solved, 24 unsolved
[2024-05-29 14:39:42] [INFO ] Deduced a trap composed of 24 places in 222 ms of which 1 ms to minimize.
[2024-05-29 14:39:43] [INFO ] Deduced a trap composed of 19 places in 227 ms of which 1 ms to minimize.
[2024-05-29 14:39:43] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 3/88 constraints. Problems are: Problem set: 1 solved, 24 unsolved
[2024-05-29 14:39:43] [INFO ] Deduced a trap composed of 27 places in 296 ms of which 1 ms to minimize.
[2024-05-29 14:39:44] [INFO ] Deduced a trap composed of 19 places in 232 ms of which 1 ms to minimize.
[2024-05-29 14:39:44] [INFO ] Deduced a trap composed of 26 places in 249 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 3/91 constraints. Problems are: Problem set: 1 solved, 24 unsolved
[2024-05-29 14:39:44] [INFO ] Deduced a trap composed of 20 places in 218 ms of which 0 ms to minimize.
[2024-05-29 14:39:45] [INFO ] Deduced a trap composed of 26 places in 343 ms of which 1 ms to minimize.
[2024-05-29 14:39:45] [INFO ] Deduced a trap composed of 19 places in 336 ms of which 1 ms to minimize.
[2024-05-29 14:39:45] [INFO ] Deduced a trap composed of 20 places in 309 ms of which 1 ms to minimize.
[2024-05-29 14:39:46] [INFO ] Deduced a trap composed of 20 places in 317 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/167 variables, 5/96 constraints. Problems are: Problem set: 1 solved, 24 unsolved
[2024-05-29 14:39:46] [INFO ] Deduced a trap composed of 25 places in 307 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/167 variables, 1/97 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/167 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 14 (OVERLAPS) 1/168 variables, 1/98 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/168 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 16 (OVERLAPS) 1259/1427 variables, 168/266 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1427 variables, 571/837 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1427 variables, 17/854 constraints. Problems are: Problem set: 1 solved, 24 unsolved
[2024-05-29 14:39:48] [INFO ] Deduced a trap composed of 26 places in 282 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1427 variables, 1/855 constraints. Problems are: Problem set: 1 solved, 24 unsolved
[2024-05-29 14:39:49] [INFO ] Deduced a trap composed of 22 places in 235 ms of which 0 ms to minimize.
[2024-05-29 14:39:50] [INFO ] Deduced a trap composed of 26 places in 335 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1427 variables, 2/857 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1427 variables, 0/857 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 22 (OVERLAPS) 19/1446 variables, 8/865 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1446 variables, 523/1388 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1446 variables, 7/1395 constraints. Problems are: Problem set: 1 solved, 24 unsolved
[2024-05-29 14:39:56] [INFO ] Deduced a trap composed of 21 places in 267 ms of which 0 ms to minimize.
[2024-05-29 14:39:56] [INFO ] Deduced a trap composed of 29 places in 248 ms of which 1 ms to minimize.
[2024-05-29 14:39:56] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1446 variables, 3/1398 constraints. Problems are: Problem set: 1 solved, 24 unsolved
[2024-05-29 14:39:59] [INFO ] Deduced a trap composed of 33 places in 312 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1446 variables, 1/1399 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1446 variables, 0/1399 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 28 (OVERLAPS) 14/1460 variables, 7/1406 constraints. Problems are: Problem set: 1 solved, 24 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1460 variables, 3/1409 constraints. Problems are: Problem set: 1 solved, 24 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1460/1463 variables, and 1409 constraints, problems are : Problem set: 1 solved, 24 unsolved in 45009 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 183/186 constraints, ReadFeed: 1097/1097 constraints, PredecessorRefiner: 24/25 constraints, Known Traps: 96/96 constraints]
After SMT, in 53000ms problems are : Problem set: 1 solved, 24 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 1277/1277 transitions.
Graph (trivial) has 66 edges and 186 vertex of which 6 / 186 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 183 transition count 1249
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 45 place count 161 transition count 1249
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 45 place count 161 transition count 1246
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 51 place count 158 transition count 1246
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 55 place count 154 transition count 1242
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 154 transition count 1242
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 62 place count 151 transition count 1239
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 151 transition count 1239
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 150 transition count 1238
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 150 transition count 1238
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 93 place count 137 transition count 1225
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 96 place count 137 transition count 1222
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 108 place count 125 transition count 1210
Iterating global reduction 3 with 12 rules applied. Total rules applied 120 place count 125 transition count 1210
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 123 place count 125 transition count 1207
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 126 place count 122 transition count 1204
Iterating global reduction 4 with 3 rules applied. Total rules applied 129 place count 122 transition count 1204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 130 place count 122 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 131 place count 121 transition count 1202
Iterating global reduction 5 with 1 rules applied. Total rules applied 132 place count 121 transition count 1202
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 141 place count 121 transition count 1193
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 145 place count 121 transition count 1189
Free-agglomeration rule applied 8 times.
Iterating global reduction 6 with 8 rules applied. Total rules applied 153 place count 121 transition count 1181
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 162 place count 113 transition count 1180
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 7 with 16 rules applied. Total rules applied 178 place count 113 transition count 1164
Applied a total of 178 rules in 700 ms. Remains 113 /186 variables (removed 73) and now considering 1164/1277 (removed 113) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 716 ms. Remains : 113/186 places, 1164/1277 transitions.
RANDOM walk for 40000 steps (1341 resets) in 495 ms. (80 steps per ms) remains 21/24 properties
BEST_FIRST walk for 4004 steps (14 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (14 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (14 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (16 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (15 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (16 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (16 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (18 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (15 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (17 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (15 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (14 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (15 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (15 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (17 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (15 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (14 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (17 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (14 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (16 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
// Phase 1: matrix 1164 rows 113 cols
[2024-05-29 14:40:07] [INFO ] Computed 9 invariants in 5 ms
[2024-05-29 14:40:07] [INFO ] State equation strengthened by 1062 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 73/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/104 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 1155/1259 variables, 104/113 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1259 variables, 555/668 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1259 variables, 0/668 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 14/1273 variables, 6/674 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1273 variables, 506/1180 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1273 variables, 0/1180 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 4/1277 variables, 3/1183 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1277 variables, 1/1184 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1277 variables, 0/1184 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (OVERLAPS) 0/1277 variables, 0/1184 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1277/1277 variables, and 1184 constraints, problems are : Problem set: 0 solved, 21 unsolved in 3300 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 113/113 constraints, ReadFeed: 1062/1062 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 73/103 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-29 14:40:10] [INFO ] Deduced a trap composed of 12 places in 289 ms of which 1 ms to minimize.
[2024-05-29 14:40:10] [INFO ] Deduced a trap composed of 12 places in 233 ms of which 0 ms to minimize.
[2024-05-29 14:40:11] [INFO ] Deduced a trap composed of 14 places in 236 ms of which 1 ms to minimize.
[2024-05-29 14:40:11] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 1 ms to minimize.
[2024-05-29 14:40:11] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 1 ms to minimize.
[2024-05-29 14:40:11] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 1 ms to minimize.
[2024-05-29 14:40:12] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 1 ms to minimize.
[2024-05-29 14:40:12] [INFO ] Deduced a trap composed of 17 places in 294 ms of which 1 ms to minimize.
[2024-05-29 14:40:12] [INFO ] Deduced a trap composed of 23 places in 288 ms of which 0 ms to minimize.
[2024-05-29 14:40:12] [INFO ] Deduced a trap composed of 17 places in 233 ms of which 1 ms to minimize.
[2024-05-29 14:40:13] [INFO ] Deduced a trap composed of 17 places in 253 ms of which 0 ms to minimize.
[2024-05-29 14:40:13] [INFO ] Deduced a trap composed of 19 places in 213 ms of which 1 ms to minimize.
[2024-05-29 14:40:13] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-29 14:40:14] [INFO ] Deduced a trap composed of 21 places in 309 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 1/104 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 1155/1259 variables, 104/127 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1259 variables, 555/682 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1259 variables, 14/696 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-29 14:40:15] [INFO ] Deduced a trap composed of 24 places in 222 ms of which 1 ms to minimize.
[2024-05-29 14:40:15] [INFO ] Deduced a trap composed of 22 places in 239 ms of which 0 ms to minimize.
[2024-05-29 14:40:15] [INFO ] Deduced a trap composed of 14 places in 271 ms of which 1 ms to minimize.
[2024-05-29 14:40:16] [INFO ] Deduced a trap composed of 18 places in 276 ms of which 1 ms to minimize.
[2024-05-29 14:40:16] [INFO ] Deduced a trap composed of 11 places in 286 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1259 variables, 5/701 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-29 14:40:18] [INFO ] Deduced a trap composed of 24 places in 283 ms of which 1 ms to minimize.
[2024-05-29 14:40:18] [INFO ] Deduced a trap composed of 22 places in 242 ms of which 0 ms to minimize.
[2024-05-29 14:40:19] [INFO ] Deduced a trap composed of 14 places in 309 ms of which 1 ms to minimize.
[2024-05-29 14:40:19] [INFO ] Deduced a trap composed of 14 places in 314 ms of which 1 ms to minimize.
[2024-05-29 14:40:20] [INFO ] Deduced a trap composed of 14 places in 285 ms of which 0 ms to minimize.
[2024-05-29 14:40:20] [INFO ] Deduced a trap composed of 12 places in 294 ms of which 0 ms to minimize.
[2024-05-29 14:40:20] [INFO ] Deduced a trap composed of 17 places in 278 ms of which 1 ms to minimize.
[2024-05-29 14:40:20] [INFO ] Deduced a trap composed of 12 places in 294 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1259 variables, 8/709 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1259 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (OVERLAPS) 14/1273 variables, 6/715 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1273 variables, 506/1221 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1273 variables, 7/1228 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-29 14:40:23] [INFO ] Deduced a trap composed of 16 places in 292 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1273 variables, 1/1229 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1273 variables, 0/1229 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 18 (OVERLAPS) 4/1277 variables, 3/1232 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1277 variables, 1/1233 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-29 14:40:28] [INFO ] Deduced a trap composed of 13 places in 253 ms of which 1 ms to minimize.
Problem AtomicPropp63 is UNSAT
At refinement iteration 20 (INCLUDED_ONLY) 0/1277 variables, 1/1234 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1277 variables, 0/1234 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 22 (OVERLAPS) 0/1277 variables, 0/1234 constraints. Problems are: Problem set: 1 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1277/1277 variables, and 1234 constraints, problems are : Problem set: 1 solved, 20 unsolved in 21573 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 113/113 constraints, ReadFeed: 1062/1062 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 29/29 constraints]
After SMT, in 24949ms problems are : Problem set: 1 solved, 20 unsolved
Finished Parikh walk after 60 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=30 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 20 properties in 1790 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyCommit-PT-08b-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 14:40:37] [INFO ] Flatten gal took : 3563 ms
[2024-05-29 14:40:41] [INFO ] Flatten gal took : 3660 ms
[2024-05-29 14:40:49] [INFO ] Input system was already deterministic with 42033 transitions.
Computed a total of 396 stabilizing places and 414 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 2008/2008 places, 42033/42033 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 1970 transition count 41995
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 1970 transition count 41995
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 104 place count 1942 transition count 41967
Iterating global reduction 0 with 28 rules applied. Total rules applied 132 place count 1942 transition count 41967
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 133 place count 1942 transition count 41966
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 156 place count 1919 transition count 41943
Iterating global reduction 1 with 23 rules applied. Total rules applied 179 place count 1919 transition count 41943
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 180 place count 1919 transition count 41942
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 200 place count 1899 transition count 41922
Iterating global reduction 2 with 20 rules applied. Total rules applied 220 place count 1899 transition count 41922
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 238 place count 1881 transition count 41904
Iterating global reduction 2 with 18 rules applied. Total rules applied 256 place count 1881 transition count 41904
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 273 place count 1864 transition count 41887
Iterating global reduction 2 with 17 rules applied. Total rules applied 290 place count 1864 transition count 41887
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 291 place count 1864 transition count 41886
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 303 place count 1852 transition count 41874
Iterating global reduction 3 with 12 rules applied. Total rules applied 315 place count 1852 transition count 41874
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 326 place count 1841 transition count 41863
Iterating global reduction 3 with 11 rules applied. Total rules applied 337 place count 1841 transition count 41863
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 345 place count 1833 transition count 41855
Iterating global reduction 3 with 8 rules applied. Total rules applied 353 place count 1833 transition count 41855
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 355 place count 1833 transition count 41853
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 360 place count 1828 transition count 41848
Iterating global reduction 4 with 5 rules applied. Total rules applied 365 place count 1828 transition count 41848
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 367 place count 1828 transition count 41846
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 370 place count 1825 transition count 41843
Iterating global reduction 5 with 3 rules applied. Total rules applied 373 place count 1825 transition count 41843
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 376 place count 1822 transition count 41840
Iterating global reduction 5 with 3 rules applied. Total rules applied 379 place count 1822 transition count 41840
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 382 place count 1819 transition count 41837
Iterating global reduction 5 with 3 rules applied. Total rules applied 385 place count 1819 transition count 41837
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 388 place count 1816 transition count 41834
Iterating global reduction 5 with 3 rules applied. Total rules applied 391 place count 1816 transition count 41834
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 394 place count 1813 transition count 41831
Iterating global reduction 5 with 3 rules applied. Total rules applied 397 place count 1813 transition count 41831
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 400 place count 1810 transition count 41828
Iterating global reduction 5 with 3 rules applied. Total rules applied 403 place count 1810 transition count 41828
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 406 place count 1807 transition count 41825
Iterating global reduction 5 with 3 rules applied. Total rules applied 409 place count 1807 transition count 41825
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 412 place count 1804 transition count 41822
Iterating global reduction 5 with 3 rules applied. Total rules applied 415 place count 1804 transition count 41822
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 416 place count 1804 transition count 41821
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 418 place count 1802 transition count 41819
Iterating global reduction 6 with 2 rules applied. Total rules applied 420 place count 1802 transition count 41819
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 421 place count 1802 transition count 41818
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 422 place count 1801 transition count 41817
Iterating global reduction 7 with 1 rules applied. Total rules applied 423 place count 1801 transition count 41817
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 424 place count 1800 transition count 41816
Iterating global reduction 7 with 1 rules applied. Total rules applied 425 place count 1800 transition count 41816
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 426 place count 1800 transition count 41815
Applied a total of 426 rules in 10938 ms. Remains 1800 /2008 variables (removed 208) and now considering 41815/42033 (removed 218) transitions.
// Phase 1: matrix 41815 rows 1800 cols
[2024-05-29 14:41:02] [INFO ] Computed 10 invariants in 792 ms
[2024-05-29 14:41:15] [INFO ] Implicit Places using invariants in 14365 ms returned []
Implicit Place search using SMT only with invariants took 14379 ms to find 0 implicit places.
Running 41814 sub problems to find dead transitions.
[2024-05-29 14:41:16] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1799/43615 variables, and 0 constraints, problems are : Problem set: 0 solved, 41814 unsolved in 30469 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1800 constraints, PredecessorRefiner: 41814/2394 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41814 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1799/43615 variables, and 0 constraints, problems are : Problem set: 0 solved, 41814 unsolved in 30478 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/1800 constraints, PredecessorRefiner: 39420/2394 constraints, Known Traps: 0/0 constraints]
After SMT, in 815875ms problems are : Problem set: 0 solved, 41814 unsolved
Search for dead transitions found 0 dead transitions in 816285ms
Starting structural reductions in LTL mode, iteration 1 : 1800/2008 places, 41815/42033 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 841722 ms. Remains : 1800/2008 places, 41815/42033 transitions.
[2024-05-29 14:54:56] [INFO ] Flatten gal took : 4004 ms
[2024-05-29 14:55:00] [INFO ] Flatten gal took : 3701 ms
[2024-05-29 14:55:07] [INFO ] Input system was already deterministic with 41815 transitions.
[2024-05-29 14:55:11] [INFO ] Flatten gal took : 3461 ms
[2024-05-29 14:55:14] [INFO ] Flatten gal took : 3514 ms
[2024-05-29 14:55:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality11202936289809807516.gal : 783 ms
[2024-05-29 14:55:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality13032169894550794606.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality11202936289809807516.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13032169894550794606.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285

BK_STOP 1716994536354

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-08b"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-08b, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690531800193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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