Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r254-tall-174931340000471.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is MedleyB-PT-B06, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931340000471
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 6.8K Jun 6 09:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Jun 6 09:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 6 09:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 6 09:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Jun 6 12:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 6 12:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 12:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 12:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 5.0K Jun 6 09:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 39K Jun 6 09:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 6 09:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Jun 6 09:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 12:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 12:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 3.2M Jun 5 20:08 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MedleyB-PT-B06-ReachabilityFireability-2025-00
FORMULA_NAME MedleyB-PT-B06-ReachabilityFireability-2025-01
FORMULA_NAME MedleyB-PT-B06-ReachabilityFireability-2025-02
FORMULA_NAME MedleyB-PT-B06-ReachabilityFireability-2025-03
FORMULA_NAME MedleyB-PT-B06-ReachabilityFireability-2025-04
FORMULA_NAME MedleyB-PT-B06-ReachabilityFireability-2025-05
FORMULA_NAME MedleyB-PT-B06-ReachabilityFireability-2025-06
FORMULA_NAME MedleyB-PT-B06-ReachabilityFireability-2025-07
FORMULA_NAME MedleyB-PT-B06-ReachabilityFireability-2025-08
FORMULA_NAME MedleyB-PT-B06-ReachabilityFireability-2025-09
FORMULA_NAME MedleyB-PT-B06-ReachabilityFireability-2025-10
FORMULA_NAME MedleyB-PT-B06-ReachabilityFireability-2025-11
FORMULA_NAME MedleyB-PT-B06-ReachabilityFireability-2025-12
FORMULA_NAME MedleyB-PT-B06-ReachabilityFireability-2025-13
FORMULA_NAME MedleyB-PT-B06-ReachabilityFireability-2025-14
FORMULA_NAME MedleyB-PT-B06-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1749394904860

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyB-PT-B06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-08 15:01:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-08 15:01:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-08 15:01:46] [INFO ] Load time of PNML (sax parser for PT used): 284 ms
[2025-06-08 15:01:46] [INFO ] Transformed 964 places.
[2025-06-08 15:01:46] [INFO ] Transformed 5535 transitions.
[2025-06-08 15:01:46] [INFO ] Found NUPN structural information;
[2025-06-08 15:01:46] [INFO ] Parsed PT model containing 964 places and 5535 transitions and 65185 arcs in 474 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (323 resets) in 2174 ms. (18 steps per ms) remains 15/16 properties
FORMULA MedleyB-PT-B06-ReachabilityFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4004 steps (8 resets) in 236 ms. (16 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 294 ms. (13 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 97 ms. (40 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 118 ms. (33 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 193 ms. (20 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 171 ms. (23 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
[2025-06-08 15:01:48] [INFO ] Flatten gal took : 876 ms
[2025-06-08 15:01:48] [INFO ] Flatten gal took : 401 ms
[2025-06-08 15:01:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3351489514791439527.gal : 170 ms
[2025-06-08 15:01:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16024512083590393327.prop : 4 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3351489514791439527.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16024512083590393327.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality16024512083590393327.prop.
Interrupted probabilistic random walk after 119993 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 15
Probabilistic random walk after 119993 steps, saw 23879 distinct states, run finished after 3006 ms. (steps per millisecond=39 ) properties seen :0
// Phase 1: matrix 5535 rows 964 cols
[2025-06-08 15:01:51] [INFO ] Computed 8 invariants in 123 ms
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem MedleyB-PT-B06-ReachabilityFireability-2025-00 is UNSAT
FORMULA MedleyB-PT-B06-ReachabilityFireability-2025-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyB-PT-B06-ReachabilityFireability-2025-01 is UNSAT
FORMULA MedleyB-PT-B06-ReachabilityFireability-2025-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyB-PT-B06-ReachabilityFireability-2025-02 is UNSAT
FORMULA MedleyB-PT-B06-ReachabilityFireability-2025-02 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 861/964 variables, 8/111 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/964 variables, 861/972 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/964 variables, 0/972 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 5535/6499 variables, 964/1936 constraints. Problems are: Problem set: 3 solved, 12 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6499/6499 variables, and 1936 constraints, problems are : Problem set: 3 solved, 12 unsolved in 5041 ms.
Refiners :[Domain max(s): 964/964 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 964/964 constraints, PredecessorRefiner: 15/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 12 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 85/85 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/85 constraints. Problems are: Problem set: 3 solved, 12 unsolved
Problem MedleyB-PT-B06-ReachabilityFireability-2025-04 is UNSAT
FORMULA MedleyB-PT-B06-ReachabilityFireability-2025-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 879/964 variables, 8/93 constraints. Problems are: Problem set: 4 solved, 11 unsolved
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :10 after 14
SDD proceeding with computation,15 properties remain. new max is 32
SDD size :14 after 18
SDD proceeding with computation,15 properties remain. new max is 64
SDD size :18 after 33
SDD proceeding with computation,15 properties remain. new max is 128
SDD size :33 after 344
At refinement iteration 3 (INCLUDED_ONLY) 0/964 variables, 879/972 constraints. Problems are: Problem set: 4 solved, 11 unsolved
SDD proceeding with computation,15 properties remain. new max is 256
SDD size :344 after 2749
SDD proceeding with computation,15 properties remain. new max is 512
SDD size :2749 after 16821
SDD proceeding with computation,15 properties remain. new max is 1024
SDD size :16821 after 17081
SDD proceeding with computation,15 properties remain. new max is 2048
SDD size :17081 after 31316
SDD proceeding with computation,15 properties remain. new max is 4096
SDD size :31316 after 70210
SDD proceeding with computation,15 properties remain. new max is 8192
SDD size :70210 after 197003
At refinement iteration 4 (INCLUDED_ONLY) 0/964 variables, 0/972 constraints. Problems are: Problem set: 4 solved, 11 unsolved
SDD proceeding with computation,15 properties remain. new max is 16384
At refinement iteration 5 (OVERLAPS) 5535/6499 variables, 964/1936 constraints. Problems are: Problem set: 4 solved, 11 unsolved
SDD size :197003 after 1.86923e+07
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6499/6499 variables, and 1936 constraints, problems are : Problem set: 4 solved, 11 unsolved in 5042 ms.
Refiners :[Domain max(s): 964/964 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 964/964 constraints, PredecessorRefiner: 12/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10409ms problems are : Problem set: 4 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 76 out of 964 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 964/964 places, 5535/5535 transitions.
Graph (trivial) has 803 edges and 964 vertex of which 117 / 964 are part of one of the 19 SCC in 6 ms
Free SCC test removed 98 places
Drop transitions (Empty/Sink Transition effects.) removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Graph (complete) has 1966 edges and 866 vertex of which 852 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.31 ms
Discarding 14 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 477 transitions
Trivial Post-agglo rules discarded 477 transitions
Performed 477 trivial Post agglomeration. Transition count delta: 477
Iterating post reduction 0 with 484 rules applied. Total rules applied 486 place count 852 transition count 4917
Reduce places removed 477 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 497 rules applied. Total rules applied 983 place count 375 transition count 4897
Reduce places removed 10 places and 0 transitions.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Iterating post reduction 2 with 60 rules applied. Total rules applied 1043 place count 365 transition count 4847
Reduce places removed 50 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 54 rules applied. Total rules applied 1097 place count 315 transition count 4843
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1099 place count 313 transition count 4843
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 42 Pre rules applied. Total rules applied 1099 place count 313 transition count 4801
Deduced a syphon composed of 42 places in 8 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 84 rules applied. Total rules applied 1183 place count 271 transition count 4801
Discarding 66 places :
Symmetric choice reduction at 5 with 66 rule applications. Total rules 1249 place count 205 transition count 4735
Iterating global reduction 5 with 66 rules applied. Total rules applied 1315 place count 205 transition count 4735
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1321 place count 205 transition count 4729
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 1321 place count 205 transition count 4728
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1323 place count 204 transition count 4728
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1331 place count 196 transition count 4707
Iterating global reduction 6 with 8 rules applied. Total rules applied 1339 place count 196 transition count 4707
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1340 place count 196 transition count 4706
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1342 place count 194 transition count 4704
Iterating global reduction 7 with 2 rules applied. Total rules applied 1344 place count 194 transition count 4704
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 1384 place count 174 transition count 4684
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1390 place count 168 transition count 4678
Iterating global reduction 7 with 6 rules applied. Total rules applied 1396 place count 168 transition count 4678
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1404 place count 164 transition count 4686
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1405 place count 164 transition count 4685
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1407 place count 164 transition count 4683
Free-agglomeration rule applied 12 times.
Iterating global reduction 8 with 12 rules applied. Total rules applied 1419 place count 164 transition count 4671
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 1431 place count 152 transition count 4671
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1435 place count 152 transition count 4671
Applied a total of 1435 rules in 1173 ms. Remains 152 /964 variables (removed 812) and now considering 4671/5535 (removed 864) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1183 ms. Remains : 152/964 places, 4671/5535 transitions.
RANDOM walk for 40000 steps (1616 resets) in 2366 ms. (16 steps per ms) remains 10/11 properties
FORMULA MedleyB-PT-B06-ReachabilityFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (205 resets) in 1039 ms. (38 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (207 resets) in 411 ms. (97 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (211 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (214 resets) in 80 ms. (493 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (210 resets) in 393 ms. (101 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (221 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (202 resets) in 207 ms. (192 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (215 resets) in 86 ms. (459 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (218 resets) in 70 ms. (563 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (221 resets) in 119 ms. (333 steps per ms) remains 10/10 properties
SDD proceeding with computation,15 properties remain. new max is 32768
SDD size :1.86923e+07 after 4.53325e+08
Interrupted probabilistic random walk after 176461 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 10
Probabilistic random walk after 176461 steps, saw 40957 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
// Phase 1: matrix 4671 rows 152 cols
[2025-06-08 15:02:07] [INFO ] Computed 8 invariants in 52 ms
[2025-06-08 15:02:07] [INFO ] State equation strengthened by 96 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 78/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4671/4823 variables, 152/160 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4823 variables, 96/256 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4823 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/4823 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4823/4823 variables, and 256 constraints, problems are : Problem set: 0 solved, 10 unsolved in 3567 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 152/152 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 10/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 78/152 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4671/4823 variables, 152/160 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4823 variables, 96/256 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4823 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/4823 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4823/4823 variables, and 256 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5063 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 152/152 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 10/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8932ms problems are : Problem set: 0 solved, 10 unsolved
FORMULA MedleyB-PT-B06-ReachabilityFireability-2025-03 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B06-ReachabilityFireability-2025-05 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B06-ReachabilityFireability-2025-07 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B06-ReachabilityFireability-2025-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B06-ReachabilityFireability-2025-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B06-ReachabilityFireability-2025-11 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B06-ReachabilityFireability-2025-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B06-ReachabilityFireability-2025-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyB-PT-B06-ReachabilityFireability-2025-14 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 22 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
FORMULA MedleyB-PT-B06-ReachabilityFireability-2025-15 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 10 properties in 413 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 30422 ms.

BK_STOP 1749394936516

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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="MedleyB-PT-B06"
export BK_EXAMINATION="ReachabilityFireability"
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-5832"
echo " Executing tool itstools"
echo " Input is MedleyB-PT-B06, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-174931340000471"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyB-PT-B06.tgz
mv MedleyB-PT-B06 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;