About the Execution of ITS-Tools for Champagne-PT-H06T1U
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 305716.00 | 0.00 | 0.00 | FFFTFTFFTFFFFFFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r254-tall-174931339200059.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 Champagne-PT-H06T1U, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-174931339200059
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.8K Jun 6 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Jun 6 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Jun 6 08:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Jun 6 08:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 6 11:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 11:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 11:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 6 11:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 5 20:08 NewModel
-rw-r--r-- 1 mcc users 11K Jun 6 08:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Jun 6 08:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Jun 6 08:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 6 08:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 11:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 11:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 equiv_col
-rw-r--r-- 1 mcc users 7 Jun 5 20:08 instance
-rw-r--r-- 1 mcc users 6 Jun 5 20:08 iscolored
-rw-r--r-- 1 mcc users 102K 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 Champagne-PT-H06T1U-LTLCardinality-00
FORMULA_NAME Champagne-PT-H06T1U-LTLCardinality-01
FORMULA_NAME Champagne-PT-H06T1U-LTLCardinality-02
FORMULA_NAME Champagne-PT-H06T1U-LTLCardinality-03
FORMULA_NAME Champagne-PT-H06T1U-LTLCardinality-04
FORMULA_NAME Champagne-PT-H06T1U-LTLCardinality-05
FORMULA_NAME Champagne-PT-H06T1U-LTLCardinality-06
FORMULA_NAME Champagne-PT-H06T1U-LTLCardinality-07
FORMULA_NAME Champagne-PT-H06T1U-LTLCardinality-08
FORMULA_NAME Champagne-PT-H06T1U-LTLCardinality-09
FORMULA_NAME Champagne-PT-H06T1U-LTLCardinality-10
FORMULA_NAME Champagne-PT-H06T1U-LTLCardinality-11
FORMULA_NAME Champagne-PT-H06T1U-LTLCardinality-12
FORMULA_NAME Champagne-PT-H06T1U-LTLCardinality-13
FORMULA_NAME Champagne-PT-H06T1U-LTLCardinality-14
FORMULA_NAME Champagne-PT-H06T1U-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1749320262151
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H06T1U
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-07 18:17:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 18:17:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 18:17:43] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2025-06-07 18:17:43] [INFO ] Transformed 519 places.
[2025-06-07 18:17:43] [INFO ] Transformed 668 transitions.
[2025-06-07 18:17:43] [INFO ] Found NUPN structural information;
[2025-06-07 18:17:43] [INFO ] Parsed PT model containing 519 places and 668 transitions and 1625 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA Champagne-PT-H06T1U-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H06T1U-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H06T1U-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H06T1U-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H06T1U-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H06T1U-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H06T1U-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H06T1U-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H06T1U-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H06T1U-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H06T1U-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 519 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 519/519 places, 668/668 transitions.
Discarding 114 places :
Symmetric choice reduction at 0 with 114 rule applications. Total rules 114 place count 405 transition count 554
Iterating global reduction 0 with 114 rules applied. Total rules applied 228 place count 405 transition count 554
Discarding 74 places :
Symmetric choice reduction at 0 with 74 rule applications. Total rules 302 place count 331 transition count 480
Iterating global reduction 0 with 74 rules applied. Total rules applied 376 place count 331 transition count 480
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 414 place count 293 transition count 442
Iterating global reduction 0 with 38 rules applied. Total rules applied 452 place count 293 transition count 442
Applied a total of 452 rules in 101 ms. Remains 293 /519 variables (removed 226) and now considering 442/668 (removed 226) transitions.
// Phase 1: matrix 442 rows 293 cols
[2025-06-07 18:17:43] [INFO ] Computed 20 invariants in 21 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:17:44] [INFO ] Implicit Places using invariants in 262 ms returned []
[2025-06-07 18:17:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:17:44] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
Running 441 sub problems to find dead transitions.
[2025-06-07 18:17:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 1 (OVERLAPS) 1/293 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 441 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:50] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:17:51] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 4 (OVERLAPS) 442/735 variables, 293/315 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/735 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 441 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 1.0)
(t2 1.0)
(t3 1.0)
(t4 1.0)
(t5 1.0)
(t6 1.0)
(t7 0.0)
(t8 0.0)
(t9 0.0)
(t10 0.0)
(t11 0.0)
(t12 0.0)
(t13 0.0)
(t14 0.0)
(t15 0.0)
(t16 0.0)
(t17 1.0)
(t18 0.0)
(t19 0.0)
(t20 1.0)
(t21 0.0)
(t22 0.0)
(t23 0.0)
(t24 0.0)
(t25 0.0)
(t26 0.0)
(t27 0.0)
(t28 0.0)
(t29 0.0)
(t30 0.0)
(t31 1.0)
(t32 0.0)
(t33 0.0)
(t34 1.0)
(t35 1.0)
(t36 0.0)
(t37 0.0)
(t38 0.0)
(t39 0.0)
(t40 0.0)
(t41 0.0)
(t42 0.0)
(t43 0.0)
(t44 0.0)
(t45 0.0)
(t46 1.0)
(t47 1.0)
(t48 1.0)
(t49 0.0)
(t50 1.0)
(t51 0.0)
(t52 0.0)
(t53 0.0)
(t54 0.0)
(t55 0.0)
(t56 0.0)
(t57 0.0)
(t58 0.0)
(t59 0.0)
(t60 0.0)
(t61 0.0)
(t62 1.0)
(t63 0.0)
(t64 0.0)
(t65 1.0)
(t66 1.0)
(t67 0.0)
(t68 0.0)
(t69 0.0)
(t70 0.0)
(t71 0.0)
(t72 0.0)
(t73 0.0)
(t74 0.0)
(t75 0.0)
(t76 0.0)
(t77 0.0)
(t78 0.0)
(t79 1.0)
(t80 0.0)
(t81 0.0)
(t82 1.0)
(t83 1.0)
(t84 0.0)
(t85 0.0)
(t86 0.0)
(t87 0.0)
(t88 0.0)
(t89 0.0)
(t90 0.0)
(t91 0.0)
(t92 0.0)
(t93 0.0)
(t94 0.0)
(t95 1.0)
(t96 0.0)
(t97 0.0)
(t98 1.0)
(t99 0.0)
(t100 0.0)
(t101 0.0)
(t102 0.0)
(t103 0.0)
(t104 0.0)
(t105 0.0)
(t106 0.0)
(t107 0.0)
(t108 0.0)
(t109 0.0)
(t110 0.0)
(t111 0.0)
(t112 1.0)
(t113 0.0)
(t114 0.0)
(t115 1.0)
(t116 1.0)
(t117 0.0)
(t118 0.0)
(t119 0.0)
(t120 0.0)
(t121 0.0)
(t122 0.0)
(t123 0.0)
(t124 0.0)
(t125 0.0)
(t126 1.0)
(t127 0.0)
(t128 0.0)
(t129 0.0)
(t130 0.0)
(t131 0.0)
(t132 1.0)
(t133 1.0)
(t134 0.0)
(t135 0.0)
(t136 0.0)
(t137 0.0)
(t138 0.0)
(t139 0.0)
(t140 0.0)
(t141 0.0)
(t142 0.0)
(t143 0.0)
(t144 0.0)
(t145 1.0)
(t146 0.0)
(t147 0.0)
(t148 1.0)
(t149 1.0)
(t150 0.0)
(t151 0.0)
(t152 0.0)
(t153 0.0)
(t154 0.0)
(t155 1.0)
(t156 1.0)
(t157 1.0)
(t158 0.0)
(t159 0.0)
(t160 1.0)
(t161 0.0)
(t162 0.0)
(t163 1.0)
(t164 0.0)
(t165 0.0)
(t166 0.0)
(t167 0.0)
(t168 0.0)
(t169 0.0)
(t170 0.0)
(t171 0.0)
(t172 0.0)
(t173 0.0)
(t174 1.0)
(t175 0.0)
(t176 0.0)
(t177 1.0)
(t178 1.0)
(t179 0.0)
(t180 0.0)
(t181 0.0)
(t182 0.0)
(t183 0.0)
(t184 0.0)
(t185 0.0)
(t186 0.0)
(t187 0.0)
(t188 0.0)
(t189 1.0)
(t190 0.0)
(t191 0.0)
(t192 1.0)
(t193 1.0)
(t194 1.0)
(t195 1.0)
(t196 0.0)
(t197 0.0)
(t198 0.0)
(t199 0.0)
(t200 0.0)
(t201 0.0)
(t202 0.0)
(t203 0.0)
(t204 0.0)
(t205 0.0)
(t206 0.0)
(t207 1.0)
(t208 0.0)
(t209 1.0)
(t210 1.0)
(t211 1.0)
(t212 0.0)
(t213 0.0)
(t214 0.0)
(t215 0.0)
(t216 0.0)
(t217 0.0)
(t218 0.0)
(t219 0.0)
(t220 0.0)
(t221 1.0)
(t222 1.0)
(t223 0.0)
(t224 1.0)
(t225 1.0)
(t226 0.0)
(t227 0.0)
(t228 0.0)
(t229 0.0)
(t230 0.0)
(t231 0.0)
(t232 0.0)
(t233 0.0)
(t234 0.0)
(t235 1.0)
(t236 1.0)
(t237 0.0)
(t238 1.0)
(t239 1.0)
(t240 1.0)
(t241 0.0)
(t242 0.0)
(t243 0.0)
(t244 0.0)
(t245 0.0)
(t246 0.0)
(t247 0.0)
(t248 0.0)
(t249 0.0)
(t250 0.0)
(t251 1.0)
(t252 0.0)
(t253 0.0)
(t254 0.0)
(t255 1.0)
(t256 1.0)
(t257 1.0)
(t258 0.0)
(t259 0.0)
(t260 0.0)
(t261 0.0)
(t262 0.0)
(t263 0.0)
(t264 0.0)
(t265 0.0)
(t266 0.0)
(t267 0.0)
(t268 1.0)
(t269 0.0)
(t270 1.0)
(t271 1.0)
(t272 1.0)
(t273 0.0)
(t274 0.0)
(t275 0.0)
(t276 0.0)
(t277 0.0)
(t278 0.0)
(t279 0.0)
(t280 0.0)
(t281 0.0)
(t282 0.0)
(t283 0.0)
(t284 1.0)
(t285 0.0)
(t286 1.0)
(t287 1.0)
(t288 1.0)
(t289 0.0)
(t290 0.0)
(t291 0.0)
(t292 0.0)
(t293 0.0)
(t294 0.0)
(t295 0.0)
(t296 0.0)
(t297 0.0)
(t298 0.0)
(t299 0.0)
(t300 1.0)
(t301 0.0)
(t302 1.0)
(t303 1.0)
(t304 0.0)
(t305 0.0)
(t306 0.0)
(t307 0.0)
(t308 0.0)
(t309 0.0)
(t310 0.0)
(t311 0.0)
(t312 0.0)
(t313 0.0)
(t314 1.0)
(t315 0.0)
(t316 1.0)
(t317 0.0)
(t318 0.0)
(t319 0.0)
(t320 0.0)
(t321 0.0)
(t322 0.0)
(t323 0.0)
(t324 0.0)
(t325 0.0)
(t326 0.0)
(t327 0.0)
(t328 0.0)
(t329 0.0)
(t330 0.0)
(t331 0.0)
(t332 0.0)
(t333 0.0)
(t334 0.0)
(t335 0.0)
(t336 0.0)
(t337 0.0)
(t338 0.0)
(t339 0.0)
(t340 0.0)
(t341 1.0)
(t342 0.0)
(t343 0.0)
(t344 0.0)
(t345 0.0)
(t346 0.0)
(t347 0.0)
(t348 0.0)
(t349 0.0)
(t350 0.0)
(t351 0.0)
(t352 0.0)
(t353 0.0)
(t354 0.0)
(t355 0.0)
(t356 0.0)
(t357 0.0)
(t358 0.0)
(t359 0.0)
(t360 0.0)
(t361 0.0)
(t362 0.0)
(t363 0.0)
(t364 0.0)
(t365 0.0)
(t366 0.0)
(t367 0.0)
(t368 0.0)
(t369 0.0)
(t370 0.0)
(t371 0.0)
(t372 0.0)
(t373 0.0)
(t374 0.0)
(t375 0.0)
(t376 0.0)
(t377 0.0)
(t378 0.0)
(t379 0.0)
(t380 0.0)
(t381 0.0)
(t382 0.0)
(t383 0.0)
(t384 0.0)
(t385 0.0)
(t386 0.0)
(t387 0.0)
(t388 0.0)
(t389 0.0)
(t390 0.0)
(t391 0.0)
(t392 0.0)
(t393 0.0)
(t394 0.0)
(t395 0.0)timeout
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 735/735 variables, and 315 constraints, problems are : Problem set: 0 solved, 441 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 293/293 constraints, PredecessorRefiner: 441/441 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 441 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 1 (OVERLAPS) 1/293 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 441 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:18:16] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/293 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/293 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 5 (OVERLAPS) 442/735 variables, 293/316 constraints. Problems are: Problem set: 0 solved, 441 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/735 variables, 441/757 constraints. Problems are: Problem set: 0 solved, 441 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:18:24] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:18:25] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:18:26] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/735 variables, 3/760 constraints. Problems are: Problem set: 0 solved, 441 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:18:29] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:18:31] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 15 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/735 variables, 2/762 constraints. Problems are: Problem set: 0 solved, 441 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:18:35] [INFO ] Deduced a trap composed of 67 places in 51 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:18:35] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:18:36] [INFO ] Deduced a trap composed of 60 places in 86 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:18:37] [INFO ] Deduced a trap composed of 68 places in 89 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/735 variables, 4/766 constraints. Problems are: Problem set: 0 solved, 441 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 735/735 variables, and 766 constraints, problems are : Problem set: 0 solved, 441 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 293/293 constraints, PredecessorRefiner: 441/441 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60158ms problems are : Problem set: 0 solved, 441 unsolved
Search for dead transitions found 0 dead transitions in 60183ms
Starting structural reductions in LTL mode, iteration 1 : 293/519 places, 442/668 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60817 ms. Remains : 293/519 places, 442/668 transitions.
Support contains 14 out of 293 places after structural reductions.
[2025-06-07 18:18:44] [INFO ] Flatten gal took : 53 ms
[2025-06-07 18:18:44] [INFO ] Flatten gal took : 22 ms
[2025-06-07 18:18:44] [INFO ] Input system was already deterministic with 442 transitions.
RANDOM walk for 9106 steps (26 resets) in 311 ms. (29 steps per ms) remains 0/9 properties
Computed a total of 22 stabilizing places and 22 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 442/442 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 281 transition count 430
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 281 transition count 430
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 276 transition count 425
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 276 transition count 425
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 274 transition count 423
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 274 transition count 423
Applied a total of 38 rules in 18 ms. Remains 274 /293 variables (removed 19) and now considering 423/442 (removed 19) transitions.
// Phase 1: matrix 423 rows 274 cols
[2025-06-07 18:18:45] [INFO ] Computed 20 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:18:45] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-07 18:18:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:18:45] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 422 sub problems to find dead transitions.
[2025-06-07 18:18:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (OVERLAPS) 1/274 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (OVERLAPS) 423/697 variables, 274/294 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/697 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (OVERLAPS) 0/697 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 422 unsolved
No progress, stopping.
After SMT solving in domain Real declared 697/697 variables, and 294 constraints, problems are : Problem set: 0 solved, 422 unsolved in 28289 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 422 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/273 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (OVERLAPS) 1/274 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/274 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (OVERLAPS) 423/697 variables, 274/294 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/697 variables, 422/716 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:19:25] [INFO ] Deduced a trap along path composed of 13 places in 54 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/697 variables, 1/717 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:19:32] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:19:33] [INFO ] Deduced a trap composed of 53 places in 121 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:19:33] [INFO ] Deduced a trap composed of 54 places in 137 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/697 variables, 3/720 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:19:37] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/697 variables, 1/721 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 697/697 variables, and 721 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 274/274 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 58379ms problems are : Problem set: 0 solved, 422 unsolved
Search for dead transitions found 0 dead transitions in 58381ms
Starting structural reductions in LTL mode, iteration 1 : 274/293 places, 423/442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58640 ms. Remains : 274/293 places, 423/442 transitions.
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H06T1U-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Champagne-PT-H06T1U-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H06T1U-LTLCardinality-00 finished in 58905 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&(F(p1)||X(G(p2))))))'
Support contains 4 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 442/442 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 285 transition count 434
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 285 transition count 434
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 283 transition count 432
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 283 transition count 432
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 282 transition count 431
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 282 transition count 431
Applied a total of 22 rules in 18 ms. Remains 282 /293 variables (removed 11) and now considering 431/442 (removed 11) transitions.
// Phase 1: matrix 431 rows 282 cols
[2025-06-07 18:19:44] [INFO ] Computed 20 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:19:44] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-06-07 18:19:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:19:44] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Running 430 sub problems to find dead transitions.
[2025-06-07 18:19:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/282 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (OVERLAPS) 431/713 variables, 282/302 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/713 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 713/713 variables, and 302 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/281 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (OVERLAPS) 1/282 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (OVERLAPS) 431/713 variables, 282/302 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/713 variables, 430/732 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:20:26] [INFO ] Deduced a trap along path composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/713 variables, 1/733 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:20:34] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:20:34] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/713 variables, 2/735 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 713/713 variables, and 735 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 282/282 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60074ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 60075ms
Starting structural reductions in LTL mode, iteration 1 : 282/293 places, 431/442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60433 ms. Remains : 282/293 places, 431/442 transitions.
Stuttering acceptance computed with spot in 255 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0)]
Running random walk in product with property : Champagne-PT-H06T1U-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 50 steps with 0 reset in 2 ms.
FORMULA Champagne-PT-H06T1U-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H06T1U-LTLCardinality-04 finished in 60709 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 2 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 442/442 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 283 transition count 432
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 283 transition count 432
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 279 transition count 428
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 279 transition count 428
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 278 transition count 427
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 278 transition count 427
Applied a total of 30 rules in 20 ms. Remains 278 /293 variables (removed 15) and now considering 427/442 (removed 15) transitions.
// Phase 1: matrix 427 rows 278 cols
[2025-06-07 18:20:44] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:20:44] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-07 18:20:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:20:45] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2025-06-07 18:20:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/278 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (OVERLAPS) 427/705 variables, 278/298 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/705 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (OVERLAPS) 0/705 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 426 unsolved
No progress, stopping.
After SMT solving in domain Real declared 705/705 variables, and 298 constraints, problems are : Problem set: 0 solved, 426 unsolved in 29482 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/278 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/278 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (OVERLAPS) 427/705 variables, 278/298 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/705 variables, 426/724 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:21:26] [INFO ] Deduced a trap along path composed of 13 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/705 variables, 1/725 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:21:34] [INFO ] Deduced a trap composed of 66 places in 107 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/705 variables, 1/726 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:21:41] [INFO ] Deduced a trap composed of 56 places in 116 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/705 variables, 1/727 constraints. Problems are: Problem set: 0 solved, 426 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 705/705 variables, and 727 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 278/278 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 59540ms problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 59544ms
Starting structural reductions in LTL mode, iteration 1 : 278/293 places, 427/442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59820 ms. Remains : 278/293 places, 427/442 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : Champagne-PT-H06T1U-LTLCardinality-05
Product exploration explored 100000 steps with 33333 reset in 239 ms.
Product exploration explored 100000 steps with 33333 reset in 145 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Computed a total of 20 stabilizing places and 20 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 46 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Champagne-PT-H06T1U-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Champagne-PT-H06T1U-LTLCardinality-05 finished in 60406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F(p1)&&p0)))))'
Support contains 3 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 442/442 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 283 transition count 432
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 283 transition count 432
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 279 transition count 428
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 279 transition count 428
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 277 transition count 426
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 277 transition count 426
Applied a total of 32 rules in 10 ms. Remains 277 /293 variables (removed 16) and now considering 426/442 (removed 16) transitions.
// Phase 1: matrix 426 rows 277 cols
[2025-06-07 18:21:45] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:21:45] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-07 18:21:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:21:45] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2025-06-07 18:21:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/277 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (OVERLAPS) 426/703 variables, 277/297 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/703 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (OVERLAPS) 0/703 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 425 unsolved
No progress, stopping.
After SMT solving in domain Real declared 703/703 variables, and 297 constraints, problems are : Problem set: 0 solved, 425 unsolved in 28682 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/277 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (OVERLAPS) 426/703 variables, 277/297 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/703 variables, 425/722 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:22:26] [INFO ] Deduced a trap along path composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/703 variables, 1/723 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:22:32] [INFO ] Deduced a trap composed of 63 places in 101 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:22:33] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:22:34] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:22:35] [INFO ] Deduced a trap composed of 64 places in 111 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:22:35] [INFO ] Deduced a trap composed of 65 places in 103 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:22:35] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/703 variables, 6/729 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:22:40] [INFO ] Deduced a trap composed of 42 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:22:42] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 703/703 variables, and 731 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 58735ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 58736ms
Starting structural reductions in LTL mode, iteration 1 : 277/293 places, 426/442 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58997 ms. Remains : 277/293 places, 426/442 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Champagne-PT-H06T1U-LTLCardinality-10
Stuttering criterion allowed to conclude after 225 steps with 0 reset in 2 ms.
FORMULA Champagne-PT-H06T1U-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H06T1U-LTLCardinality-10 finished in 59181 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 293 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 293/293 places, 442/442 transitions.
Graph (trivial) has 300 edges and 293 vertex of which 152 / 293 are part of one of the 20 SCC in 4 ms
Free SCC test removed 132 places
Ensure Unique test removed 145 transitions
Reduce isomorphic transitions removed 145 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 160 transition count 269
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 60 rules applied. Total rules applied 88 place count 133 transition count 236
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 104 place count 117 transition count 236
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 120 place count 101 transition count 183
Iterating global reduction 3 with 16 rules applied. Total rules applied 136 place count 101 transition count 183
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 149 place count 101 transition count 170
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 217 place count 67 transition count 136
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 219 place count 65 transition count 128
Iterating global reduction 4 with 2 rules applied. Total rules applied 221 place count 65 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 223 place count 65 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 225 place count 64 transition count 128
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 227 place count 62 transition count 126
Applied a total of 227 rules in 54 ms. Remains 62 /293 variables (removed 231) and now considering 126/442 (removed 316) transitions.
[2025-06-07 18:22:44] [INFO ] Flow matrix only has 64 transitions (discarded 62 similar events)
// Phase 1: matrix 64 rows 62 cols
[2025-06-07 18:22:44] [INFO ] Computed 20 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:22:44] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-07 18:22:44] [INFO ] Flow matrix only has 64 transitions (discarded 62 similar events)
[2025-06-07 18:22:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 18:22:44] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 18:22:44] [INFO ] Redundant transitions in 3 ms returned []
Running 78 sub problems to find dead transitions.
[2025-06-07 18:22:44] [INFO ] Flow matrix only has 64 transitions (discarded 62 similar events)
[2025-06-07 18:22:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 3/62 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 63/125 variables, 62/82 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/126 variables, and 82 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1356 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 3/62 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 63/125 variables, 62/82 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 78/160 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-07 18:22:46] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/126 variables, and 161 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1836 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3203ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 3203ms
Starting structural reductions in SI_LTL mode, iteration 1 : 62/293 places, 126/442 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3364 ms. Remains : 62/293 places, 126/442 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Champagne-PT-H06T1U-LTLCardinality-13
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 2 ms.
FORMULA Champagne-PT-H06T1U-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H06T1U-LTLCardinality-13 finished in 3505 ms.
All properties solved by simple procedures.
Total runtime 304423 ms.
BK_STOP 1749320567867
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="Champagne-PT-H06T1U"
export BK_EXAMINATION="LTLCardinality"
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 Champagne-PT-H06T1U, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-174931339200059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Champagne-PT-H06T1U.tgz
mv Champagne-PT-H06T1U execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;