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

About the Execution of GreatSPN+red for BlocksWorld-PT-11

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15555.735 833306.00 1529786.00 1543.60 T normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 50M
-rw-r--r-- 1 mcc users 1.6M Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 7.0M Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.4M Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 7.3M Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 43K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 134K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 472K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.9M Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 1.7M Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 7.2M Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8M Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15M Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 101K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 243K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 3.2M Jun 7 06:26 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1717746197320

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=BlocksWorld-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-07 07:43:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-06-07 07:43:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 07:43:18] [INFO ] Load time of PNML (sax parser for PT used): 333 ms
[2024-06-07 07:43:18] [INFO ] Transformed 3421 places.
[2024-06-07 07:43:18] [INFO ] Transformed 6613 transitions.
[2024-06-07 07:43:18] [INFO ] Found NUPN structural information;
[2024-06-07 07:43:18] [INFO ] Completing missing partition info from NUPN : creating a component with [pred_on_table_0, pred_arm_empty_0, pred_on_table_1, pred_on_table_2, pred_on_table_3, pred_on_table_4, pred_on_table_5, pred_on_table_6, pred_on_table_7, pred_on_table_8, pred_on_table_9, pred_on_table_10, pred_on_table_11, pred_on_table_12, pred_on_table_13, pred_on_table_14, pred_on_table_15, pred_on_table_16, pred_on_table_17, pred_on_table_18, pred_on_table_19, pred_on_table_20, pred_on_table_21, pred_on_table_22, pred_on_table_23, pred_on_table_24, pred_on_table_25, pred_on_table_26, pred_on_table_27, pred_on_table_28, pred_on_table_29, pred_on_table_30, pred_on_table_31, pred_on_table_32, pred_on_table_33, pred_on_table_34, pred_on_table_35, pred_on_table_36, pred_on_table_37, pred_on_table_38, pred_on_table_39, pred_on_table_40, pred_on_table_41, pred_on_table_42, pred_on_table_43, pred_on_table_44, pred_on_table_45, pred_on_table_46, pred_on_table_47, pred_on_table_48, pred_on_table_49, pred_on_table_50, pred_on_table_51, pred_on_table_52, pred_on_table_53, pred_on_table_54, pred_on_table_55, pred_on_table_56]
[2024-06-07 07:43:18] [INFO ] Parsed PT model containing 3421 places and 6613 transitions and 33052 arcs in 488 ms.
RANDOM walk for 40000 steps (8 resets) in 8949 ms. (4 steps per ms) remains 136/3421 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 136/136 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 136/136 properties
// Phase 1: matrix 6613 rows 3421 cols
[2024-06-07 07:43:21] [INFO ] Computed 115 invariants in 106 ms
[2024-06-07 07:43:21] [INFO ] State equation strengthened by 97 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 3284/3420 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 136 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 (/ 19.0 20.0))
(s1 (/ 19.0 20.0))
(s3 0.0)
(s4 (/ 19.0 20.0))
(s5 (/ 9.0 10.0))
(s6 0.0)
(s7 (/ 9.0 10.0))
(s8 (/ 9.0 10.0))
(s9 0.0)
(s10 (/ 4.0 5.0))
(s11 (/ 7.0 10.0))
(s12 0.0)
(s13 (/ 19.0 20.0))
(s14 (/ 19.0 20.0))
(s15 0.0)
(s16 (/ 17.0 20.0))
(s17 (/ 19.0 20.0))
(s18 0.0)
(s19 (/ 4.0 5.0))
(s20 (/ 19.0 20.0))
(s21 0.0)
(s22 (/ 9.0 10.0))
(s23 (/ 19.0 20.0))
(s24 0.0)
(s25 (/ 3.0 4.0))
(s26 (/ 17.0 20.0))
(s27 0.0)
(s28 (/ 19.0 20.0))
(s29 (/ 19.0 20.0))
(s30 0.0)
(s31 (/ 17.0 20.0))
(s32 (/ 9.0 10.0))
(s33 0.0)
(s34 (/ 19.0 20.0))
(s35 (/ 9.0 10.0))
(s36 0.0)
(s37 (/ 9.0 10.0))
(s38 (/ 17.0 20.0))
(s39 0.0)
(s40 (/ 17.0 20.0))
(s41 (/ 17.0 20.0))
(s42 0.0)
(s43 (/ 9.0 10.0))
(s44 (/ 3.0 4.0))
(s45 0.0)
(s46 (/ 19.0 20.0))
(s47 (/ 19.0 20.0))
(s48 0.0)
(s49 (/ 17.0 20.0))
(s50 (/ 9.0 10.0))
(s51 0.0)
(s52 (/ 9.0 10.0))
(s53 (/ 9.0 10.0))
(s54 0.0)
(s55 (/ 19.0 20.0))
(s56 (/ 19.0 20.0))
(s57 0.0)
(s58 (/ 19.0 20.0))
(s59 (/ 9.0 10.0))
(s60 0.0)
(s61 (/ 9.0 10.0))
(s62 (/ 4.0 5.0))
(s63 0.0)
(s64 (/ 9.0 10.0))
(s65 (/ 17.0 20.0))
(s66 0.0)
(s67 (/ 9.0 10.0))
(s68 (/ 9.0 10.0))
(s69 0.0)
(s70 (/ 17.0 20.0))
(s71 (/ 19.0 20.0))
(s72 0.0)
(s73 (/ 19.0 20.0))
(s74 (/ 19.0 20.0))
(s75 0.0)
(s76 (/ 9.0 10.0))
(s77 (/ 9.0 10.0))
(s78 0.0)
(s79 (/ 19.0 20.0))
(s80 (/ 9.0 10.0))
(s81 0.0)
(s82 (/ 9.0 10.0))
(s83 (/ 9.0 10.0))
(s84 0.0)
(s85 (/ 19.0 20.0))
(s86 (/ 17.0 20.0))
(s87 0.0)
(s88 (/ 4.0 5.0))
(s89 (/ 11.0 20.0))
(s90 0.0)
(s91 (/ 19.0 20.0))
(s92 (/ 19.0 20.0))
(s93 0.0)
(s94 (/ 9.0 10.0))
(s95 (/ 9.0 10.0))
(s96 0.0)
(s97 (/ 9.0 10.0))
(s98 (/ 4.0 5.0))
(s99 0.0)
(s100 (/ 9.0 10.0))
(s101 (/ 17.0 20.0))
(s102 0.0)
(s103 (/ 17.0 20.0))
(s104 (/ 9.0 10.0))
(s105 0.0)
(s106 (/ 17.0 20.0))
(s107 (/ 9.0 10.0))
(s108 0.0)
(s109 (/ 19.0 20.0))
(s110 (/ 19.0 20.0))
(s111 0.0)
(s112 (/ 9.0 10.0))
(s113 (/ 19.0 20.0))
(s114 0.0)
(s115 (/ 9.0 10.0))
(s116 (/ 19.0 20.0))
(s117 0.0)
(s118 (/ 17.0 20.0))
(s119 (/ 17.0 20.0))
(s120 0.0)
(s121 (/ 3.0 4.0))
(s122 (/ 9.0 10.0))
(s123 0.0)
(s124 (/ 9.0 10.0))
(s125 (/ 17.0 20.0))
(s126 0.0)
(s127 (/ 3.0 4.0))
(s128 (/ 9.0 10.0))
(s129 0.0)
(s130 (/ 17.0 20.0))
(s131 (/ 9.0 10.0))
(s132 0.0)
(s133 (/ 4.0 5.0))
(s134 (/ 19.0 20.0))
(s135 0.0)
(s136 (/ 9.0 10.0))
(s137 (/ 17.0 20.0))
(s138 0.0)
(s139 (/ 19.0 20.0))
(s140 (/ 17.0 20.0))
(s141 0.0)
(s142 (/ 4.0 5.0))
(s143 (/ 17.0 20.0))
(s144 0.0)
(s145 (/ 19.0 20.0))
(s146 (/ 19.0 20.0))
(s147 0.0)
(s148 (/ 19.0 20.0))
(s149 (/ 19.0 20.0))
(s150 0.0)
(s151 (/ 4.0 5.0))
(s152 (/ 4.0 5.0))
(s153 0.0)
(s154 (/ 1.0 2.0))
(s155 (/ 3.0 4.0))
(s156 0.0)
(s157 (/ 19.0 20.0))
(s158 (/ 4.0 5.0))
(s159 0.0)
(s160 (/ 17.0 20.0))
(s161 (/ 4.0 5.0))
(s162 0.0)
(s163 (/ 9.0 10.0))
(s164 (/ 9.0 10.0))
(s165 0.0)
(s166 (/ 9.0 10.0))
(s167 (/ 17.0 20.0))
(s168 0.0)
(s169 (/ 9.0 10.0))
(s170 (/ 9.0 10.0))
(s171 0.0)
(s172 (/ 1.0 20.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 (/ 1.0 20.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 (/ 1.0 20.0))
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 (/ 1.0 20.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 (/ 1.0 20.0))
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 (/ 1.0 20.0))
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 (/ 1.0 20.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 (/ 1.0 20.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 (/ 1.0 20.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 (/ 1.0 20.0))
(s387 (/ 1.0 20.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 (/ 1.0 20.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 (/ 1.0 20.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 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3420/10034 variables, and 114 constraints, problems are : Problem set: 0 solved, 136 unsolved in 5053 ms.
Refiners :[Positive P Invariants (semi-flows): 114/115 constraints, State Equation: 0/3421 constraints, ReadFeed: 0/97 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 3284/3420 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-07 07:43:32] [INFO ] Deduced a trap composed of 58 places in 4087 ms of which 165 ms to minimize.
SMT process timed out in 10453ms, After SMT, problems are : Problem set: 0 solved, 136 unsolved
Fused 136 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 136 out of 3421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3421/3421 places, 6613/6613 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3421 transition count 6612
Applied a total of 1 rules in 34989 ms. Remains 3421 /3421 variables (removed 0) and now considering 6612/6613 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35003 ms. Remains : 3421/3421 places, 6612/6613 transitions.
RANDOM walk for 1669716 steps (4 resets) in 120004 ms. (13 steps per ms) remains 57/136 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3171 ms. (126 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3283 ms. (121 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3239 ms. (123 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3174 ms. (125 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3258 ms. (122 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3132 ms. (127 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3290 ms. (121 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3211 ms. (124 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3281 ms. (121 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3225 ms. (123 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3265 ms. (122 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3355 ms. (119 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3191 ms. (125 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3186 ms. (125 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3228 ms. (123 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3216 ms. (124 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3212 ms. (124 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3266 ms. (122 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3293 ms. (121 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3267 ms. (122 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3217 ms. (124 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3260 ms. (122 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3365 ms. (118 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3152 ms. (126 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3303 ms. (121 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3196 ms. (125 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3201 ms. (124 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3230 ms. (123 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3124 ms. (128 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3244 ms. (123 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3286 ms. (121 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3230 ms. (123 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3225 ms. (123 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3225 ms. (123 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3194 ms. (125 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3153 ms. (126 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3286 ms. (121 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3266 ms. (122 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3264 ms. (122 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3308 ms. (120 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3216 ms. (124 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3269 ms. (122 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3297 ms. (121 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3290 ms. (121 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3137 ms. (127 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3228 ms. (123 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3264 ms. (122 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3219 ms. (124 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3369 ms. (118 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3287 ms. (121 steps per ms) remains 57/57 properties
// Phase 1: matrix 6612 rows 3421 cols
[2024-06-07 07:45:20] [INFO ] Computed 115 invariants in 68 ms
[2024-06-07 07:45:20] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 3363/3420 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3420 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (OVERLAPS) 1/3421 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3421 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 6612/10033 variables, 3421/3536 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10033 variables, 96/3632 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10033 variables, 0/3632 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 0/10033 variables, 0/3632 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10033/10033 variables, and 3632 constraints, problems are : Problem set: 0 solved, 57 unsolved in 27743 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, State Equation: 3421/3421 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 3363/3420 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-06-07 07:45:52] [INFO ] Deduced a trap composed of 58 places in 4211 ms of which 24 ms to minimize.
[2024-06-07 07:45:56] [INFO ] Deduced a trap composed of 58 places in 4325 ms of which 35 ms to minimize.
[2024-06-07 07:46:01] [INFO ] Deduced a trap composed of 58 places in 4252 ms of which 24 ms to minimize.
[2024-06-07 07:46:05] [INFO ] Deduced a trap composed of 58 places in 3975 ms of which 21 ms to minimize.
[2024-06-07 07:46:09] [INFO ] Deduced a trap composed of 58 places in 4221 ms of which 22 ms to minimize.
[2024-06-07 07:46:13] [INFO ] Deduced a trap composed of 58 places in 4127 ms of which 23 ms to minimize.
[2024-06-07 07:46:17] [INFO ] Deduced a trap composed of 58 places in 4012 ms of which 22 ms to minimize.
[2024-06-07 07:46:21] [INFO ] Deduced a trap composed of 58 places in 3921 ms of which 21 ms to minimize.
[2024-06-07 07:46:25] [INFO ] Deduced a trap composed of 58 places in 3929 ms of which 21 ms to minimize.
[2024-06-07 07:46:29] [INFO ] Deduced a trap composed of 58 places in 3870 ms of which 23 ms to minimize.
[2024-06-07 07:46:33] [INFO ] Deduced a trap composed of 58 places in 3659 ms of which 20 ms to minimize.
SMT process timed out in 73389ms, After SMT, problems are : Problem set: 0 solved, 57 unsolved
Fused 57 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 57 out of 3421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3421/3421 places, 6612/6612 transitions.
Applied a total of 0 rules in 27065 ms. Remains 3421 /3421 variables (removed 0) and now considering 6612/6612 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27066 ms. Remains : 3421/3421 places, 6612/6612 transitions.
RANDOM walk for 1857041 steps (4 resets) in 120004 ms. (15 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3758 ms. (106 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3145 ms. (127 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3158 ms. (126 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3170 ms. (126 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3205 ms. (124 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3111 ms. (128 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3263 ms. (122 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3152 ms. (126 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3936 ms. (101 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3206 ms. (124 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3133 ms. (127 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3359 ms. (119 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3251 ms. (123 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3211 ms. (124 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3618 ms. (110 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 4006 ms. (99 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3345 ms. (119 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3446 ms. (116 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3494 ms. (114 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3152 ms. (126 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3196 ms. (125 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3309 ms. (120 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3068 ms. (130 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3194 ms. (125 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3160 ms. (126 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3280 ms. (121 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3421 ms. (116 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3202 ms. (124 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3175 ms. (125 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3106 ms. (128 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3106 ms. (128 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3166 ms. (126 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3152 ms. (126 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3133 ms. (127 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3084 ms. (129 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3183 ms. (125 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3241 ms. (123 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3165 ms. (126 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3183 ms. (125 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3268 ms. (122 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3133 ms. (127 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3223 ms. (124 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3235 ms. (123 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3232 ms. (123 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3194 ms. (125 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400002 steps (8 resets) in 3213 ms. (124 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3200 ms. (124 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400003 steps (8 resets) in 3195 ms. (125 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3162 ms. (126 steps per ms) remains 57/57 properties
BEST_FIRST walk for 400004 steps (8 resets) in 3242 ms. (123 steps per ms) remains 57/57 properties
Interrupted probabilistic random walk after 8185411 steps, run timeout after 219001 ms. (steps per millisecond=37 ) properties seen :0 out of 57
Probabilistic random walk after 8185411 steps, saw 7624680 distinct states, run finished after 219018 ms. (steps per millisecond=37 ) properties seen :0
[2024-06-07 07:51:53] [INFO ] Invariant cache hit.
[2024-06-07 07:51:53] [INFO ] State equation strengthened by 96 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 3363/3420 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3420 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (OVERLAPS) 1/3421 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3421 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 6612/10033 variables, 3421/3536 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10033 variables, 96/3632 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/10033 variables, 0/3632 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 0/10033 variables, 0/3632 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10033/10033 variables, and 3632 constraints, problems are : Problem set: 0 solved, 57 unsolved in 29024 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, State Equation: 3421/3421 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 3363/3420 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 57 unsolved
[2024-06-07 07:52:27] [INFO ] Deduced a trap composed of 58 places in 4054 ms of which 22 ms to minimize.
[2024-06-07 07:52:31] [INFO ] Deduced a trap composed of 58 places in 4149 ms of which 22 ms to minimize.
[2024-06-07 07:52:35] [INFO ] Deduced a trap composed of 58 places in 3903 ms of which 19 ms to minimize.
[2024-06-07 07:52:39] [INFO ] Deduced a trap composed of 58 places in 4096 ms of which 20 ms to minimize.
[2024-06-07 07:52:43] [INFO ] Deduced a trap composed of 58 places in 4023 ms of which 22 ms to minimize.
[2024-06-07 07:52:47] [INFO ] Deduced a trap composed of 58 places in 4003 ms of which 21 ms to minimize.
[2024-06-07 07:52:51] [INFO ] Deduced a trap composed of 58 places in 3992 ms of which 23 ms to minimize.
[2024-06-07 07:52:55] [INFO ] Deduced a trap composed of 58 places in 3897 ms of which 22 ms to minimize.
[2024-06-07 07:52:59] [INFO ] Deduced a trap composed of 58 places in 3681 ms of which 26 ms to minimize.
[2024-06-07 07:53:02] [INFO ] Deduced a trap composed of 58 places in 3751 ms of which 21 ms to minimize.
[2024-06-07 07:53:06] [INFO ] Deduced a trap composed of 58 places in 3537 ms of which 20 ms to minimize.
[2024-06-07 07:53:09] [INFO ] Deduced a trap composed of 58 places in 3383 ms of which 20 ms to minimize.
[2024-06-07 07:53:13] [INFO ] Deduced a trap composed of 58 places in 3344 ms of which 18 ms to minimize.
[2024-06-07 07:53:16] [INFO ] Deduced a trap composed of 58 places in 3278 ms of which 19 ms to minimize.
[2024-06-07 07:53:19] [INFO ] Deduced a trap composed of 58 places in 3226 ms of which 20 ms to minimize.
[2024-06-07 07:53:23] [INFO ] Deduced a trap composed of 58 places in 3147 ms of which 20 ms to minimize.
[2024-06-07 07:53:26] [INFO ] Deduced a trap composed of 58 places in 3105 ms of which 19 ms to minimize.
[2024-06-07 07:53:29] [INFO ] Deduced a trap composed of 58 places in 2995 ms of which 18 ms to minimize.
[2024-06-07 07:53:32] [INFO ] Deduced a trap composed of 58 places in 2971 ms of which 18 ms to minimize.
[2024-06-07 07:53:35] [INFO ] Deduced a trap composed of 58 places in 2605 ms of which 17 ms to minimize.
Problem smplace_462 is UNSAT
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL
SMT process timed out in 101711ms, After SMT, problems are : Problem set: 0 solved, 57 unsolved
Fused 57 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 57 out of 3421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3421/3421 places, 6612/6612 transitions.
Applied a total of 0 rules in 26915 ms. Remains 3421 /3421 variables (removed 0) and now considering 6612/6612 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26915 ms. Remains : 3421/3421 places, 6612/6612 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3421/3421 places, 6612/6612 transitions.
Applied a total of 0 rules in 26626 ms. Remains 3421 /3421 variables (removed 0) and now considering 6612/6612 (removed 0) transitions.
[2024-06-07 07:54:28] [INFO ] Invariant cache hit.
[2024-06-07 07:54:31] [INFO ] Implicit Places using invariants in 3311 ms returned []
[2024-06-07 07:54:31] [INFO ] Invariant cache hit.
[2024-06-07 07:54:34] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-07 07:54:42] [INFO ] Implicit Places using invariants and state equation in 10824 ms returned []
Implicit Place search using SMT with State Equation took 14150 ms to find 0 implicit places.
[2024-06-07 07:54:43] [INFO ] Redundant transitions in 682 ms returned []
Running 6603 sub problems to find dead transitions.
[2024-06-07 07:54:43] [INFO ] Invariant cache hit.
[2024-06-07 07:54:43] [INFO ] State equation strengthened by 96 read => feed constraints.
Problem TDEAD172 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD926 is UNSAT
Problem TDEAD984 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1448 is UNSAT
Problem TDEAD1506 is UNSAT
Problem TDEAD1564 is UNSAT
Problem TDEAD1622 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1796 is UNSAT
Problem TDEAD1854 is UNSAT
Problem TDEAD1912 is UNSAT
Problem TDEAD1970 is UNSAT
Problem TDEAD2028 is UNSAT
Problem TDEAD2202 is UNSAT
Problem TDEAD2260 is UNSAT
Problem TDEAD2318 is UNSAT
Problem TDEAD2434 is UNSAT
Problem TDEAD2492 is UNSAT
Problem TDEAD2550 is UNSAT
Problem TDEAD2666 is UNSAT
Problem TDEAD2782 is UNSAT
Problem TDEAD2840 is UNSAT
Problem TDEAD2898 is UNSAT
Problem TDEAD2956 is UNSAT
Problem TDEAD3014 is UNSAT
Problem TDEAD3072 is UNSAT
Problem TDEAD3130 is UNSAT
Problem TDEAD3188 is UNSAT
Problem TDEAD3246 is UNSAT
Problem TDEAD3304 is UNSAT
Problem TDEAD3362 is UNSAT
Problem TDEAD3420 is UNSAT
Problem TDEAD3532 is UNSAT
Problem TDEAD3642 is UNSAT
Problem TDEAD3750 is UNSAT
Problem TDEAD3856 is UNSAT
Problem TDEAD3960 is UNSAT
Problem TDEAD4062 is UNSAT
Problem TDEAD4162 is UNSAT
Problem TDEAD4260 is UNSAT
Problem TDEAD4356 is UNSAT
Problem TDEAD4542 is UNSAT
Problem TDEAD4632 is UNSAT
Problem TDEAD4720 is UNSAT
Problem TDEAD4806 is UNSAT
Problem TDEAD4890 is UNSAT
Problem TDEAD4972 is UNSAT
Problem TDEAD5052 is UNSAT
Problem TDEAD5130 is UNSAT
Problem TDEAD5206 is UNSAT
Problem TDEAD5280 is UNSAT
Problem TDEAD5422 is UNSAT
Problem TDEAD5490 is UNSAT
Problem TDEAD5556 is UNSAT
Problem TDEAD5620 is UNSAT
Problem TDEAD5682 is UNSAT
Problem TDEAD5742 is UNSAT
Problem TDEAD5800 is UNSAT
Problem TDEAD5856 is UNSAT
Problem TDEAD5910 is UNSAT
Problem TDEAD5962 is UNSAT
Problem TDEAD6012 is UNSAT
Problem TDEAD6150 is UNSAT
Problem TDEAD6192 is UNSAT
Problem TDEAD6232 is UNSAT
Problem TDEAD6306 is UNSAT
Problem TDEAD6340 is UNSAT
Problem TDEAD6372 is UNSAT
Problem TDEAD6430 is UNSAT
Problem TDEAD6480 is UNSAT
Problem TDEAD6502 is UNSAT
Problem TDEAD6522 is UNSAT
Problem TDEAD6540 is UNSAT
Problem TDEAD6556 is UNSAT
Problem TDEAD6570 is UNSAT
Problem TDEAD6582 is UNSAT
Problem TDEAD6592 is UNSAT
Problem TDEAD6600 is UNSAT
Problem TDEAD6606 is UNSAT
Problem TDEAD6610 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/3412 variables, 98/98 constraints. Problems are: Problem set: 98 solved, 6505 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3412/10033 variables, and 98 constraints, problems are : Problem set: 98 solved, 6505 unsolved in 30106 ms.
Refiners :[Positive P Invariants (semi-flows): 98/115 constraints, State Equation: 0/3421 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 6554/3306 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 98 solved, 6505 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3363 variables, 9/9 constraints. Problems are: Problem set: 98 solved, 6505 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3363/10033 variables, and 9 constraints, problems are : Problem set: 98 solved, 6505 unsolved in 30101 ms.
Refiners :[Positive P Invariants (semi-flows): 9/115 constraints, State Equation: 0/3421 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 3248/3306 constraints, Known Traps: 0/0 constraints]
After SMT, in 117106ms problems are : Problem set: 98 solved, 6505 unsolved
Search for dead transitions found 98 dead transitions in 117177ms
Found 98 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 98 transitions
Dead transitions reduction (with SMT) removed 98 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 3421/3421 places, 6514/6612 transitions.
Deduced a syphon composed of 49 places in 4 ms
Applied a total of 0 rules in 29261 ms. Remains 3421 /3421 variables (removed 0) and now considering 6514/6514 (removed 0) transitions.
[2024-06-07 07:57:10] [INFO ] Redundant transitions in 583 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 188540 ms. Remains : 3421/3421 places, 6514/6612 transitions.
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 0 transitions.
FORMULA StableMarking TRUE TECHNIQUES RANDOM_WALK SMT_REFINEMENT TOPOLOGICAL INITIAL_STATE
Total runtime 832103 ms.
ITS solved all properties within timeout

BK_STOP 1717747030626

--------------------
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 StableMarking -timeout 180 -rebuildPNML

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="BlocksWorld-PT-11"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is BlocksWorld-PT-11, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r612-tall-171774431200153"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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