About the Execution of ITS-Tools for HirschbergSinclair-PT-25
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | T?FFFTFTFFFFFTFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r114-tall-174876422000091.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 HirschbergSinclair-PT-25, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876422000091
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 321K May 29 14:32 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 HirschbergSinclair-PT-25-LTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-25-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748778212423
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-25
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-01 11:43:33] [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-01 11:43:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 11:43:34] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2025-06-01 11:43:34] [INFO ] Transformed 600 places.
[2025-06-01 11:43:34] [INFO ] Transformed 545 transitions.
[2025-06-01 11:43:34] [INFO ] Parsed PT model containing 600 places and 545 transitions and 1664 arcs in 211 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-25-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 545/545 transitions.
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 578 transition count 545
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 38 place count 562 transition count 529
Iterating global reduction 1 with 16 rules applied. Total rules applied 54 place count 562 transition count 529
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 69 place count 547 transition count 514
Iterating global reduction 1 with 15 rules applied. Total rules applied 84 place count 547 transition count 514
Applied a total of 84 rules in 197 ms. Remains 547 /600 variables (removed 53) and now considering 514/545 (removed 31) transitions.
// Phase 1: matrix 514 rows 547 cols
[2025-06-01 11:43:34] [INFO ] Computed 33 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:43:35] [INFO ] Implicit Places using invariants in 541 ms returned []
[2025-06-01 11:43:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:43:42] [INFO ] Implicit Places using invariants and state equation in 7155 ms returned []
Implicit Place search using SMT with State Equation took 7743 ms to find 0 implicit places.
Running 489 sub problems to find dead transitions.
[2025-06-01 11:43:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/519 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/519 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 2 (OVERLAPS) 6/525 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 4 (OVERLAPS) 22/547 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 489 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 367.0)
(s2 0.0)
(s3 367.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 1.0)
(s10 366.0)
(s11 1.0)
(s12 0.0)
(s13 1.0)
(s14 364.0)
(s15 1.0)
(s16 0.0)
(s17 364.0)
(s18 0.0)
(s19 1.0)
(s20 359.0)
(s21 1.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 358.0)
(s28 0.0)
(s29 1.0)
(s30 357.0)
(s31 1.0)
(s32 0.0)
(s33 355.0)
(s34 0.0)
(s35 1.0)
(s36 352.0)
(s37 1.0)
(s38 350.0)
(s39 1.0)
(s40 349.0)
(s41 1.0)
(s42 346.0)
(s43 1.0)
(s44 0.0)
(s45 346.0)
(s46 343.0)
(s47 1.0)
(s48 0.0)
(s49 1.0)
(s50 1.0)
(s51 368.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 368.0)
(s62 1.0)
(s63 367.0)
(s64 1.0)
(s65 1.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 366.0)
(s75 1.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 364.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 361.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 359.0)
(s108 1.0)
(s109 359.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 357.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 353.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 547/1061 variables, and 33 constraints, problems are : Problem set: 0 solved, 489 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 0/547 constraints, PredecessorRefiner: 489/489 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 489 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/519 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/519 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 2 (OVERLAPS) 6/525 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 4 (OVERLAPS) 22/547 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 6 (OVERLAPS) 514/1061 variables, 547/580 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1061 variables, 489/1069 constraints. Problems are: Problem set: 0 solved, 489 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1061/1061 variables, and 1069 constraints, problems are : Problem set: 0 solved, 489 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 547/547 constraints, PredecessorRefiner: 489/489 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60211ms problems are : Problem set: 0 solved, 489 unsolved
Search for dead transitions found 0 dead transitions in 60226ms
Starting structural reductions in LTL mode, iteration 1 : 547/600 places, 514/545 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68220 ms. Remains : 547/600 places, 514/545 transitions.
Support contains 58 out of 547 places after structural reductions.
[2025-06-01 11:44:43] [INFO ] Flatten gal took : 120 ms
[2025-06-01 11:44:43] [INFO ] Flatten gal took : 56 ms
[2025-06-01 11:44:43] [INFO ] Input system was already deterministic with 514 transitions.
RANDOM walk for 40000 steps (72 resets) in 1800 ms. (22 steps per ms) remains 16/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
[2025-06-01 11:44:44] [INFO ] Invariant cache hit.
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/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 10/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 445/477 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 3/480 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 20/500 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/500 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp35 is UNSAT
At refinement iteration 9 (OVERLAPS) 514/1014 variables, 500/533 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1014 variables, 0/533 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 47/1061 variables, 47/580 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1061 variables, 0/580 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/1061 variables, 0/580 constraints. Problems are: Problem set: 14 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1061/1061 variables, and 580 constraints, problems are : Problem set: 14 solved, 2 unsolved in 1713 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 547/547 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 14 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/11 variables, 1/1 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/1 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 423/434 variables, 26/27 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 0/27 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 6/440 variables, 2/29 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/29 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 58/498 variables, 4/33 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/498 variables, 0/33 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 514/1012 variables, 498/531 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1012 variables, 1/532 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1012 variables, 0/532 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 49/1061 variables, 49/581 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1061 variables, 1/582 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1061 variables, 0/582 constraints. Problems are: Problem set: 14 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1061 variables, 0/582 constraints. Problems are: Problem set: 14 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1061/1061 variables, and 582 constraints, problems are : Problem set: 14 solved, 2 unsolved in 2166 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 547/547 constraints, PredecessorRefiner: 2/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3945ms problems are : Problem set: 14 solved, 2 unsolved
Parikh walk visited 0 properties in 406 ms.
Support contains 6 out of 547 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 547/547 places, 514/514 transitions.
Graph (complete) has 1030 edges and 547 vertex of which 520 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.2 ms
Discarding 27 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 246 rules applied. Total rules applied 247 place count 520 transition count 268
Reduce places removed 221 places and 0 transitions.
Graph (complete) has 506 edges and 299 vertex of which 210 are kept as prefixes of interest. Removing 89 places using SCC suffix rule.0 ms
Discarding 89 places :
Also discarding 0 output transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 225 rules applied. Total rules applied 472 place count 210 transition count 265
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Iterating post reduction 2 with 92 rules applied. Total rules applied 564 place count 207 transition count 176
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 564 place count 207 transition count 175
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 566 place count 206 transition count 175
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 567 place count 205 transition count 174
Iterating global reduction 3 with 1 rules applied. Total rules applied 568 place count 205 transition count 174
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 569 place count 205 transition count 173
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 330 edges and 204 vertex of which 203 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 571 place count 203 transition count 173
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 572 place count 203 transition count 172
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 574 place count 203 transition count 170
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 576 place count 201 transition count 170
Reduce places removed 23 places and 23 transitions.
Iterating global reduction 7 with 23 rules applied. Total rules applied 599 place count 178 transition count 147
Reduce places removed 21 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 7 with 100 rules applied. Total rules applied 699 place count 157 transition count 68
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 8 with 79 rules applied. Total rules applied 778 place count 78 transition count 68
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 32 Pre rules applied. Total rules applied 778 place count 78 transition count 36
Deduced a syphon composed of 32 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 9 with 66 rules applied. Total rules applied 844 place count 44 transition count 36
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 845 place count 44 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 846 place count 43 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 847 place count 42 transition count 34
Applied a total of 847 rules in 155 ms. Remains 42 /547 variables (removed 505) and now considering 34/514 (removed 480) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 42/547 places, 34/514 transitions.
RANDOM walk for 40000 steps (1140 resets) in 323 ms. (123 steps per ms) remains 1/2 properties
BEST_FIRST walk for 1226 steps (9 resets) in 8 ms. (136 steps per ms) remains 0/1 properties
FORMULA HirschbergSinclair-PT-25-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 14 atomic propositions for a total of 13 simplifications.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-25-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-25-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-25-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 547 stabilizing places and 514 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 547 transition count 514
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA HirschbergSinclair-PT-25-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-25-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-25-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(G(p0))&&F(p1))))'
Support contains 4 out of 547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 547/547 places, 514/514 transitions.
Graph (complete) has 1030 edges and 547 vertex of which 545 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 24 places and 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 224 transitions
Trivial Post-agglo rules discarded 224 transitions
Performed 224 trivial Post agglomeration. Transition count delta: 224
Iterating post reduction 0 with 224 rules applied. Total rules applied 225 place count 521 transition count 266
Reduce places removed 224 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 225 rules applied. Total rules applied 450 place count 297 transition count 265
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 451 place count 296 transition count 265
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 458 place count 289 transition count 258
Iterating global reduction 3 with 7 rules applied. Total rules applied 465 place count 289 transition count 258
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 467 place count 288 transition count 257
Applied a total of 467 rules in 116 ms. Remains 288 /547 variables (removed 259) and now considering 257/514 (removed 257) transitions.
// Phase 1: matrix 257 rows 288 cols
[2025-06-01 11:44:49] [INFO ] Computed 31 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:44:50] [INFO ] Implicit Places using invariants in 325 ms returned []
[2025-06-01 11:44:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:44:50] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-06-01 11:44:53] [INFO ] Implicit Places using invariants and state equation in 3057 ms returned []
Implicit Place search using SMT with State Equation took 3384 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:44:53] [INFO ] Redundant transitions in 17 ms returned []
Running 210 sub problems to find dead transitions.
[2025-06-01 11:44:53] [INFO ] Invariant cache hit.
[2025-06-01 11:44:53] [INFO ] State equation strengthened by 11 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 2/242 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 2/244 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 214/458 variables, 244/275 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 11/286 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (OVERLAPS) 1/459 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 11 (OVERLAPS) 0/459 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/545 variables, and 287 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 245/288 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 2/242 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 2/244 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 214/458 variables, 244/275 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 11/286 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 210/496 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 210 unsolved
SMT process timed out in 60056ms, After SMT, problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 60057ms
Starting structural reductions in SI_LTL mode, iteration 1 : 288/547 places, 257/514 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63602 ms. Remains : 288/547 places, 257/514 transitions.
Stuttering acceptance computed with spot in 317 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-01
Product exploration explored 100000 steps with 359 reset in 364 ms.
Product exploration explored 100000 steps with 359 reset in 265 ms.
Computed a total of 288 stabilizing places and 257 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 288 transition count 257
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p1)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 168 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (136 resets) in 409 ms. (97 steps per ms) remains 1/1 properties
BEST_FIRST walk for 8188 steps (0 resets) in 19 ms. (409 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p1)), (F (G p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 246 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 288 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 288/288 places, 257/257 transitions.
Applied a total of 0 rules in 13 ms. Remains 288 /288 variables (removed 0) and now considering 257/257 (removed 0) transitions.
[2025-06-01 11:45:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:45:55] [INFO ] Implicit Places using invariants in 736 ms returned []
[2025-06-01 11:45:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:45:56] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-06-01 11:45:59] [INFO ] Implicit Places using invariants and state equation in 3117 ms returned []
Implicit Place search using SMT with State Equation took 3859 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:45:59] [INFO ] Redundant transitions in 3 ms returned []
Running 210 sub problems to find dead transitions.
[2025-06-01 11:45:59] [INFO ] Invariant cache hit.
[2025-06-01 11:45:59] [INFO ] State equation strengthened by 11 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 2/242 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 2/244 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 214/458 variables, 244/275 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 11/286 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (OVERLAPS) 1/459 variables, 1/287 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 11 (OVERLAPS) 0/459 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/545 variables, and 287 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 245/288 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (OVERLAPS) 2/242 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 2/244 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 214/458 variables, 244/275 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 11/286 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 210/496 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 210 unsolved
SMT process timed out in 60050ms, After SMT, problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 60051ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63945 ms. Remains : 288/288 places, 257/257 transitions.
Computed a total of 288 stabilizing places and 257 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 288 transition count 257
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (136 resets) in 234 ms. (170 steps per ms) remains 1/1 properties
BEST_FIRST walk for 7968 steps (0 resets) in 14 ms. (531 steps per ms) remains 0/1 properties
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 359 reset in 198 ms.
Product exploration explored 100000 steps with 359 reset in 214 ms.
Built C files in :
/tmp/ltsmin6556633965440567076
[2025-06-01 11:47:00] [INFO ] Computing symmetric may disable matrix : 257 transitions.
[2025-06-01 11:47:00] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 11:47:00] [INFO ] Computing symmetric may enable matrix : 257 transitions.
[2025-06-01 11:47:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 11:47:00] [INFO ] Computing Do-Not-Accords matrix : 257 transitions.
[2025-06-01 11:47:00] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 11:47:00] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6556633965440567076
Running compilation step : cd /tmp/ltsmin6556633965440567076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 701 ms.
Running link step : cd /tmp/ltsmin6556633965440567076;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin6556633965440567076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased935444196719923477.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 288 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 288/288 places, 257/257 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 287 transition count 255
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 286 transition count 255
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4 place count 284 transition count 253
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 284 transition count 253
Applied a total of 6 rules in 29 ms. Remains 284 /288 variables (removed 4) and now considering 253/257 (removed 4) transitions.
// Phase 1: matrix 253 rows 284 cols
[2025-06-01 11:47:15] [INFO ] Computed 31 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:47:15] [INFO ] Implicit Places using invariants in 288 ms returned []
[2025-06-01 11:47:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:47:18] [INFO ] Implicit Places using invariants and state equation in 2527 ms returned []
Implicit Place search using SMT with State Equation took 2817 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:47:18] [INFO ] Redundant transitions in 2 ms returned []
Running 204 sub problems to find dead transitions.
[2025-06-01 11:47:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 2/236 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 2/238 variables, 26/31 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 207/445 variables, 238/269 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (OVERLAPS) 0/445 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/537 variables, and 269 constraints, problems are : Problem set: 0 solved, 204 unsolved in 20738 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 238/284 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (OVERLAPS) 2/236 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (OVERLAPS) 2/238 variables, 26/31 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 207/445 variables, 238/269 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 204/473 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/537 variables, and 473 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 238/284 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50771ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 50771ms
Starting structural reductions in SI_LTL mode, iteration 1 : 284/288 places, 253/257 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 53640 ms. Remains : 284/288 places, 253/257 transitions.
Built C files in :
/tmp/ltsmin5855113294446230141
[2025-06-01 11:48:09] [INFO ] Computing symmetric may disable matrix : 253 transitions.
[2025-06-01 11:48:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 11:48:09] [INFO ] Computing symmetric may enable matrix : 253 transitions.
[2025-06-01 11:48:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 11:48:09] [INFO ] Computing Do-Not-Accords matrix : 253 transitions.
[2025-06-01 11:48:09] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 11:48:09] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5855113294446230141
Running compilation step : cd /tmp/ltsmin5855113294446230141;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 504 ms.
Running link step : cd /tmp/ltsmin5855113294446230141;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin5855113294446230141;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12158270826853118685.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 11:48:24] [INFO ] Flatten gal took : 15 ms
[2025-06-01 11:48:24] [INFO ] Flatten gal took : 12 ms
[2025-06-01 11:48:24] [INFO ] Time to serialize gal into /tmp/LTL10152034337318410996.gal : 3 ms
[2025-06-01 11:48:24] [INFO ] Time to serialize properties into /tmp/LTL5753489351563288091.prop : 0 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10152034337318410996.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6849476274963823945.hoa' '-atoms' '/tmp/LTL5753489351563288091.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5753489351563288091.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6849476274963823945.hoa
Reverse transition relation is NOT exact ! Due to transitions t27.t28, t31.t32, t35.t36, t39.t40, t45.t46, t49.t50, t55.t56, t59.t60, t63.t64, t69.t70, t75...396
Computing Next relation with stutter on 2.14577e+18 deadlock states
Detected timeout of ITS tools.
[2025-06-01 11:48:39] [INFO ] Flatten gal took : 11 ms
[2025-06-01 11:48:39] [INFO ] Flatten gal took : 10 ms
[2025-06-01 11:48:39] [INFO ] Time to serialize gal into /tmp/LTL17973234218763032861.gal : 3 ms
[2025-06-01 11:48:39] [INFO ] Time to serialize properties into /tmp/LTL14432178256680837745.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17973234218763032861.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14432178256680837745.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((F(G("(rcv_left_reply_20_0_20<=election_1_0_1_to_left_1)")))&&(F("(reply_25_2_to_left_1<=reply_17_0_left17)")))))
Formula 0 simplified : F(GF!"(rcv_left_reply_20_0_20<=election_1_0_1_to_left_1)" | G!"(reply_25_2_to_left_1<=reply_17_0_left17)")
Reverse transition relation is NOT exact ! Due to transitions t0, t27.t28, t31.t32, t35.t36, t39.t40, t45.t46, t49.t50, t55.t56, t59.t60, t63.t64, t69.t70,...404
Computing Next relation with stutter on 3.43323e+18 deadlock states
Detected timeout of ITS tools.
[2025-06-01 11:48:54] [INFO ] Flatten gal took : 10 ms
[2025-06-01 11:48:54] [INFO ] Applying decomposition
[2025-06-01 11:48:54] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8222499622166081956.txt' '-o' '/tmp/graph8222499622166081956.bin' '-w' '/tmp/graph8222499622166081956.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8222499622166081956.bin' '-l' '-1' '-v' '-w' '/tmp/graph8222499622166081956.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:48:54] [INFO ] Decomposing Gal with order
[2025-06-01 11:48:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:48:54] [INFO ] Removed a total of 173 redundant transitions.
[2025-06-01 11:48:54] [INFO ] Flatten gal took : 60 ms
[2025-06-01 11:48:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 12 ms.
[2025-06-01 11:48:54] [INFO ] Time to serialize gal into /tmp/LTL17555545462253010114.gal : 6 ms
[2025-06-01 11:48:54] [INFO ] Time to serialize properties into /tmp/LTL6569952477705936480.ltl : 0 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17555545462253010114.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6569952477705936480.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F(G("(gu22.rcv_left_reply_20_0_20<=gu22.election_1_0_1_to_left_1)")))&&(F("(gu43.reply_25_2_to_left_1<=gu43.reply_17_0_left17)")...159
Formula 0 simplified : F(GF!"(gu22.rcv_left_reply_20_0_20<=gu22.election_1_0_1_to_left_1)" | G!"(gu43.reply_25_2_to_left_1<=gu43.reply_17_0_left17)")
Reverse transition relation is NOT exact ! Due to transitions gi4.gi0.gi1.t437_t438, gi4.gi0.gi1.t27_t28, gi4.gi0.gi4.t133_t134, gi4.gi0.gi4.t129_t130, gi4...598
Computing Next relation with stutter on 3.43323e+18 deadlock states
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-01 finished in 260398 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)&&(p1 U G(p2)))))'
Support contains 6 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 514/514 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 545 transition count 514
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 537 transition count 506
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 537 transition count 506
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 25 place count 530 transition count 499
Iterating global reduction 1 with 7 rules applied. Total rules applied 32 place count 530 transition count 499
Applied a total of 32 rules in 42 ms. Remains 530 /547 variables (removed 17) and now considering 499/514 (removed 15) transitions.
// Phase 1: matrix 499 rows 530 cols
[2025-06-01 11:49:09] [INFO ] Computed 31 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:49:10] [INFO ] Implicit Places using invariants in 317 ms returned []
[2025-06-01 11:49:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:49:17] [INFO ] Implicit Places using invariants and state equation in 7026 ms returned []
Implicit Place search using SMT with State Equation took 7363 ms to find 0 implicit places.
Running 474 sub problems to find dead transitions.
[2025-06-01 11:49:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/504 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 2 (OVERLAPS) 2/506 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/506 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 4 (OVERLAPS) 24/530 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 6 (OVERLAPS) 499/1029 variables, 530/561 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1029/1029 variables, and 561 constraints, problems are : Problem set: 0 solved, 474 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 530/530 constraints, PredecessorRefiner: 474/474 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 474 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/504 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 2 (OVERLAPS) 2/506 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/506 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 4 (OVERLAPS) 24/530 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 6 (OVERLAPS) 499/1029 variables, 530/561 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1029 variables, 474/1035 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1029/1029 variables, and 1035 constraints, problems are : Problem set: 0 solved, 474 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 530/530 constraints, PredecessorRefiner: 474/474 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 474 unsolved
Search for dead transitions found 0 dead transitions in 60125ms
Starting structural reductions in LTL mode, iteration 1 : 530/547 places, 499/514 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67534 ms. Remains : 530/547 places, 499/514 transitions.
Stuttering acceptance computed with spot in 260 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-02 finished in 67822 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&&X(G(p1))))))'
Support contains 4 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 514/514 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 544 transition count 514
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 13 place count 534 transition count 504
Iterating global reduction 1 with 10 rules applied. Total rules applied 23 place count 534 transition count 504
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 32 place count 525 transition count 495
Iterating global reduction 1 with 9 rules applied. Total rules applied 41 place count 525 transition count 495
Applied a total of 41 rules in 39 ms. Remains 525 /547 variables (removed 22) and now considering 495/514 (removed 19) transitions.
// Phase 1: matrix 495 rows 525 cols
[2025-06-01 11:50:17] [INFO ] Computed 30 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:50:18] [INFO ] Implicit Places using invariants in 410 ms returned []
[2025-06-01 11:50:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:50:25] [INFO ] Implicit Places using invariants and state equation in 7796 ms returned []
Implicit Place search using SMT with State Equation took 8212 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2025-06-01 11:50:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 25/525 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 495/1020 variables, 525/555 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1020/1020 variables, and 555 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 470 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 25/525 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (OVERLAPS) 495/1020 variables, 525/555 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1020 variables, 470/1025 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1020/1020 variables, and 1025 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Starting structural reductions in LTL mode, iteration 1 : 525/547 places, 495/514 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68374 ms. Remains : 525/547 places, 495/514 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-10 finished in 68523 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((p0||X(G(p1))))&&F(p2)))'
Support contains 6 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 514/514 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 544 transition count 514
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 535 transition count 505
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 535 transition count 505
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 28 place count 528 transition count 498
Iterating global reduction 1 with 7 rules applied. Total rules applied 35 place count 528 transition count 498
Applied a total of 35 rules in 44 ms. Remains 528 /547 variables (removed 19) and now considering 498/514 (removed 16) transitions.
// Phase 1: matrix 498 rows 528 cols
[2025-06-01 11:51:26] [INFO ] Computed 30 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:51:26] [INFO ] Implicit Places using invariants in 436 ms returned []
[2025-06-01 11:51:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:51:34] [INFO ] Implicit Places using invariants and state equation in 8267 ms returned []
Implicit Place search using SMT with State Equation took 8723 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2025-06-01 11:51:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 25/528 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 498/1026 variables, 528/558 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1026/1026 variables, and 558 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 528/528 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (OVERLAPS) 25/528 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/528 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 4 (OVERLAPS) 498/1026 variables, 528/558 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1026 variables, 473/1031 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1026/1026 variables, and 1031 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 528/528 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60132ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60133ms
Starting structural reductions in LTL mode, iteration 1 : 528/547 places, 498/514 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68903 ms. Remains : 528/547 places, 498/514 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-12 finished in 69080 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((p0||F(p1))))'
Support contains 4 out of 547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 547/547 places, 514/514 transitions.
Graph (complete) has 1030 edges and 547 vertex of which 544 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 25 places and 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 222 transitions
Trivial Post-agglo rules discarded 222 transitions
Performed 222 trivial Post agglomeration. Transition count delta: 222
Iterating post reduction 0 with 222 rules applied. Total rules applied 223 place count 519 transition count 267
Reduce places removed 222 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 224 rules applied. Total rules applied 447 place count 297 transition count 265
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 449 place count 295 transition count 265
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 458 place count 286 transition count 256
Iterating global reduction 3 with 9 rules applied. Total rules applied 467 place count 286 transition count 256
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 468 place count 286 transition count 255
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 469 place count 285 transition count 255
Applied a total of 469 rules in 38 ms. Remains 285 /547 variables (removed 262) and now considering 255/514 (removed 259) transitions.
// Phase 1: matrix 255 rows 285 cols
[2025-06-01 11:52:35] [INFO ] Computed 30 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:52:35] [INFO ] Implicit Places using invariants in 297 ms returned []
[2025-06-01 11:52:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:52:38] [INFO ] Implicit Places using invariants and state equation in 2677 ms returned []
Implicit Place search using SMT with State Equation took 3003 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:52:38] [INFO ] Redundant transitions in 2 ms returned []
Running 206 sub problems to find dead transitions.
[2025-06-01 11:52:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 2/238 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 210/448 variables, 238/268 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (OVERLAPS) 2/450 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/450 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 8 (OVERLAPS) 0/450 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 206 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/540 variables, and 270 constraints, problems are : Problem set: 0 solved, 206 unsolved in 26533 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 240/285 constraints, PredecessorRefiner: 206/206 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 206 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 2 (OVERLAPS) 2/238 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 4 (OVERLAPS) 210/448 variables, 238/268 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/448 variables, 206/474 constraints. Problems are: Problem set: 0 solved, 206 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 206 unsolved
SMT process timed out in 56585ms, After SMT, problems are : Problem set: 0 solved, 206 unsolved
Search for dead transitions found 0 dead transitions in 56585ms
Starting structural reductions in SI_LTL mode, iteration 1 : 285/547 places, 255/514 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 59632 ms. Remains : 285/547 places, 255/514 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-13
Product exploration explored 100000 steps with 358 reset in 214 ms.
Product exploration explored 100000 steps with 358 reset in 212 ms.
Computed a total of 285 stabilizing places and 255 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 285 transition count 255
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (136 resets) in 256 ms. (155 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40001 steps (12 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
[2025-06-01 11:53:35] [INFO ] Invariant cache hit.
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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 199/203 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/237 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 208/445 variables, 237/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/446 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/446 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 446/540 variables, and 268 constraints, problems are : Problem set: 0 solved, 1 unsolved in 298 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 238/285 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 199/203 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/237 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Int declared 445/540 variables, and 267 constraints, problems are : Problem set: 1 solved, 0 unsolved in 171 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 237/285 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 506ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 12 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-25-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-13 finished in 61112 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' '!(F(G(p0)))'
Support contains 2 out of 547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 547/547 places, 514/514 transitions.
Graph (complete) has 1030 edges and 547 vertex of which 544 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Reduce places removed 25 places and 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 225 transitions
Trivial Post-agglo rules discarded 225 transitions
Performed 225 trivial Post agglomeration. Transition count delta: 225
Iterating post reduction 0 with 225 rules applied. Total rules applied 226 place count 519 transition count 264
Reduce places removed 225 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 226 rules applied. Total rules applied 452 place count 294 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 453 place count 293 transition count 263
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 463 place count 283 transition count 253
Iterating global reduction 3 with 10 rules applied. Total rules applied 473 place count 283 transition count 253
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 474 place count 283 transition count 252
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 475 place count 282 transition count 252
Applied a total of 475 rules in 29 ms. Remains 282 /547 variables (removed 265) and now considering 252/514 (removed 262) transitions.
// Phase 1: matrix 252 rows 282 cols
[2025-06-01 11:53:36] [INFO ] Computed 30 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:53:36] [INFO ] Implicit Places using invariants in 331 ms returned []
[2025-06-01 11:53:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 11:53:39] [INFO ] Implicit Places using invariants and state equation in 2527 ms returned []
Implicit Place search using SMT with State Equation took 2874 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 11:53:39] [INFO ] Redundant transitions in 0 ms returned []
Running 203 sub problems to find dead transitions.
[2025-06-01 11:53:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 2/235 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 206/441 variables, 235/265 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (OVERLAPS) 3/444 variables, 2/267 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (OVERLAPS) 0/444 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 203 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/534 variables, and 267 constraints, problems are : Problem set: 0 solved, 203 unsolved in 24700 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 237/282 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 203 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 2 (OVERLAPS) 2/235 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 4 (OVERLAPS) 206/441 variables, 235/265 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/441 variables, 195/460 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/441 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 7 (OVERLAPS) 3/444 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 203 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 8/470 constraints. Problems are: Problem set: 0 solved, 203 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/534 variables, and 470 constraints, problems are : Problem set: 0 solved, 203 unsolved in 30044 ms.
Refiners :[Generalized P Invariants (flows): 30/30 constraints, State Equation: 237/282 constraints, PredecessorRefiner: 203/203 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54764ms problems are : Problem set: 0 solved, 203 unsolved
Search for dead transitions found 0 dead transitions in 54765ms
Starting structural reductions in SI_LTL mode, iteration 1 : 282/547 places, 252/514 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 57675 ms. Remains : 282/547 places, 252/514 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-25-LTLCardinality-14
Stuttering criterion allowed to conclude after 275 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-25-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-25-LTLCardinality-14 finished in 57727 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(G(p0))&&F(p1))))'
[2025-06-01 11:54:34] [INFO ] Flatten gal took : 65 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3465331384554128667
[2025-06-01 11:54:34] [INFO ] Computing symmetric may disable matrix : 514 transitions.
[2025-06-01 11:54:34] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 11:54:34] [INFO ] Computing symmetric may enable matrix : 514 transitions.
[2025-06-01 11:54:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 11:54:34] [INFO ] Applying decomposition
[2025-06-01 11:54:34] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2771970520302926772.txt' '-o' '/tmp/graph2771970520302926772.bin' '-w' '/tmp/graph2771970520302926772.weights'
[2025-06-01 11:54:34] [INFO ] Computing Do-Not-Accords matrix : 514 transitions.
[2025-06-01 11:54:34] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 11:54:34] [INFO ] Built C files in 128ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3465331384554128667
Running compilation step : cd /tmp/ltsmin3465331384554128667;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2771970520302926772.bin' '-l' '-1' '-v' '-w' '/tmp/graph2771970520302926772.weights' '-q' '0' '-e' '0.001'
[2025-06-01 11:54:34] [INFO ] Decomposing Gal with order
[2025-06-01 11:54:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 11:54:34] [INFO ] Removed a total of 41 redundant transitions.
[2025-06-01 11:54:34] [INFO ] Flatten gal took : 70 ms
[2025-06-01 11:54:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-01 11:54:34] [INFO ] Time to serialize gal into /tmp/LTLCardinality13212426049372330296.gal : 21 ms
[2025-06-01 11:54:34] [INFO ] Time to serialize properties into /tmp/LTLCardinality11970424237665860141.ltl : 0 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality13212426049372330296.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11970424237665860141.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((G((F(G("(gu32.rcv_left_reply_20_0_20<=gu32.election_1_0_1_to_left_1)")))&&(F("(gu28.reply_25_2_to_left_1<=gu28.reply_17_0_left17)")...159
Formula 0 simplified : F(GF!"(gu32.rcv_left_reply_20_0_20<=gu32.election_1_0_1_to_left_1)" | G!"(gu28.reply_25_2_to_left_1<=gu28.reply_17_0_left17)")
Compilation finished in 1473 ms.
Running link step : cd /tmp/ltsmin3465331384554128667;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin3465331384554128667;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[]((<>([]((LTLAPp0==true)))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions gi2.gi0.gi0.gu7.t60, gi2.gi0.gi0.gu8.t64, gi2.gi0.gi0.gu8.t68, gi2.gi0.gi0.gu9.t70, gi2.gi0.g...1459
Computing Next relation with stutter on 1.23019e+19 deadlock states
Detected timeout of ITS tools.
[2025-06-01 12:18:15] [INFO ] Flatten gal took : 58 ms
[2025-06-01 12:18:15] [INFO ] Time to serialize gal into /tmp/LTLCardinality9261873587816268039.gal : 12 ms
[2025-06-01 12:18:15] [INFO ] Time to serialize properties into /tmp/LTLCardinality12261713200881928393.ltl : 0 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9261873587816268039.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12261713200881928393.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 1 LTL properties
Checking formula 0 : !((G((F(G("(rcv_left_reply_20_0_20<=election_1_0_1_to_left_1)")))&&(F("(reply_25_2_to_left_1<=reply_17_0_left17)")))))
Formula 0 simplified : F(GF!"(rcv_left_reply_20_0_20<=election_1_0_1_to_left_1)" | G!"(reply_25_2_to_left_1<=reply_17_0_left17)")
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...540
Computing Next relation with stutter on 1.23019e+19 deadlock states
Detected timeout of ITS tools.
[2025-06-01 12:41:55] [INFO ] Flatten gal took : 38 ms
[2025-06-01 12:41:55] [INFO ] Input system was already deterministic with 514 transitions.
[2025-06-01 12:41:55] [INFO ] Transformed 547 places.
[2025-06-01 12:41:55] [INFO ] Transformed 514 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-01 12:41:56] [INFO ] Time to serialize gal into /tmp/LTLCardinality2973136765264913741.gal : 8 ms
[2025-06-01 12:41:56] [INFO ] Time to serialize properties into /tmp/LTLCardinality12366689634500154595.ltl : 0 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-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality2973136765264913741.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality12366689634500154595.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((F(G("(rcv_left_reply_20_0_20<=election_1_0_1_to_left_1)")))&&(F("(reply_25_2_to_left_1<=reply_17_0_left17)")))))
Formula 0 simplified : F(GF!"(rcv_left_reply_20_0_20<=election_1_0_1_to_left_1)" | G!"(reply_25_2_to_left_1<=reply_17_0_left17)")
BK_TIME_CONFINEMENT_REACHED
--------------------
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="HirschbergSinclair-PT-25"
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 HirschbergSinclair-PT-25, 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 r114-tall-174876422000091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-25.tgz
mv HirschbergSinclair-PT-25 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 ;